/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 14:25:12,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 14:25:12,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 14:25:12,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 14:25:12,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 14:25:12,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 14:25:12,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 14:25:12,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 14:25:12,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 14:25:12,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 14:25:12,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 14:25:12,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 14:25:12,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 14:25:12,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 14:25:12,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 14:25:12,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 14:25:12,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 14:25:12,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 14:25:12,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 14:25:12,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 14:25:12,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 14:25:12,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 14:25:12,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 14:25:12,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 14:25:12,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 14:25:12,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 14:25:12,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 14:25:12,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 14:25:12,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 14:25:12,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 14:25:12,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 14:25:12,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 14:25:12,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 14:25:12,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 14:25:12,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 14:25:12,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 14:25:12,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 14:25:12,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 14:25:12,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 14:25:12,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 14:25:12,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 14:25:12,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-15 14:25:12,186 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 14:25:12,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 14:25:12,187 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 14:25:12,187 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 14:25:12,187 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 14:25:12,188 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 14:25:12,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 14:25:12,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 14:25:12,188 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 14:25:12,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 14:25:12,189 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 14:25:12,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 14:25:12,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 14:25:12,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 14:25:12,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 14:25:12,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 14:25:12,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 14:25:12,189 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 14:25:12,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 14:25:12,190 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 14:25:12,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 14:25:12,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 14:25:12,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 14:25:12,190 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 14:25:12,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 14:25:12,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:25:12,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 14:25:12,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 14:25:12,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 14:25:12,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 14:25:12,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 14:25:12,191 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 14:25:12,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 14:25:12,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 14:25:12,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 14:25:12,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 14:25:12,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 14:25:12,402 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 14:25:12,403 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 14:25:12,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-03-15 14:25:12,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f2c17e0/92949719eff744b8945555945ea30982/FLAG22be9e6b2 [2022-03-15 14:25:12,786 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 14:25:12,786 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-03-15 14:25:12,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f2c17e0/92949719eff744b8945555945ea30982/FLAG22be9e6b2 [2022-03-15 14:25:13,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f2c17e0/92949719eff744b8945555945ea30982 [2022-03-15 14:25:13,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 14:25:13,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 14:25:13,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 14:25:13,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 14:25:13,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 14:25:13,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2825fef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13, skipping insertion in model container [2022-03-15 14:25:13,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 14:25:13,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 14:25:13,423 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-prod-cons.wvr.c[3056,3069] [2022-03-15 14:25:13,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:25:13,445 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 14:25:13,480 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-prod-cons.wvr.c[3056,3069] [2022-03-15 14:25:13,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:25:13,493 INFO L208 MainTranslator]: Completed translation [2022-03-15 14:25:13,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13 WrapperNode [2022-03-15 14:25:13,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 14:25:13,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 14:25:13,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 14:25:13,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 14:25:13,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,522 INFO L137 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 166 [2022-03-15 14:25:13,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 14:25:13,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 14:25:13,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 14:25:13,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 14:25:13,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 14:25:13,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 14:25:13,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 14:25:13,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 14:25:13,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13" (1/1) ... [2022-03-15 14:25:13,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:25:13,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:25:13,574 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 14:25:13,577 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 14:25:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 14:25:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 14:25:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 14:25:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 14:25:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 14:25:13,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 14:25:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 14:25:13,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 14:25:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 14:25:13,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 14:25:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 14:25:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 14:25:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 14:25:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 14:25:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 14:25:13,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 14:25:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 14:25:13,604 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 14:25:13,677 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 14:25:13,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 14:25:13,908 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 14:25:13,951 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 14:25:13,951 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 14:25:13,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:25:13 BoogieIcfgContainer [2022-03-15 14:25:13,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 14:25:13,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 14:25:13,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 14:25:13,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 14:25:13,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:25:13" (1/3) ... [2022-03-15 14:25:13,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39077aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:25:13, skipping insertion in model container [2022-03-15 14:25:13,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:25:13" (2/3) ... [2022-03-15 14:25:13,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39077aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:25:13, skipping insertion in model container [2022-03-15 14:25:13,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:25:13" (3/3) ... [2022-03-15 14:25:13,966 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-03-15 14:25:13,972 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 14:25:13,973 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 14:25:13,973 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 14:25:13,973 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 14:25:14,032 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,032 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,033 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,033 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,038 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,038 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,039 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,039 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,039 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,039 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,042 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,042 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,047 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,047 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,047 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,047 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,051 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,051 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,052 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,054 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,054 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,054 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,054 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,054 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,054 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,055 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,055 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:25:14,059 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 14:25:14,110 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 14:25:14,116 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 14:25:14,116 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 14:25:14,125 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 156 transitions, 336 flow [2022-03-15 14:25:14,258 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-03-15 14:25:14,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:25:14,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:25:14,325 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:25:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:25:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2134475998, now seen corresponding path program 1 times [2022-03-15 14:25:14,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:25:14,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871044835] [2022-03-15 14:25:14,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:14,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:25:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:14,570 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 14:25:14,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:25:14,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871044835] [2022-03-15 14:25:14,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871044835] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:25:14,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:25:14,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 14:25:14,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74667202] [2022-03-15 14:25:14,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:25:14,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 14:25:14,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:25:14,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 14:25:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 14:25:14,608 INFO L87 Difference]: Start difference. First operand has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:25:14,676 INFO L93 Difference]: Finished difference Result 2453 states and 8070 transitions. [2022-03-15 14:25:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 14:25:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-03-15 14:25:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:25:14,710 INFO L225 Difference]: With dead ends: 2453 [2022-03-15 14:25:14,710 INFO L226 Difference]: Without dead ends: 2449 [2022-03-15 14:25:14,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 14:25:14,716 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:25:14,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:25:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2022-03-15 14:25:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2449. [2022-03-15 14:25:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 2448 states have (on average 3.2949346405228757) internal successors, (8066), 2448 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 8066 transitions. [2022-03-15 14:25:14,848 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 8066 transitions. Word has length 112 [2022-03-15 14:25:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:25:14,849 INFO L470 AbstractCegarLoop]: Abstraction has 2449 states and 8066 transitions. [2022-03-15 14:25:14,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 8066 transitions. [2022-03-15 14:25:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-03-15 14:25:14,858 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:25:14,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:25:14,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 14:25:14,859 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:25:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:25:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash -198236285, now seen corresponding path program 1 times [2022-03-15 14:25:14,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:25:14,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116257546] [2022-03-15 14:25:14,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:14,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:25:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:15,215 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 14:25:15,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:25:15,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116257546] [2022-03-15 14:25:15,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116257546] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:25:15,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:25:15,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 14:25:15,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144766619] [2022-03-15 14:25:15,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:25:15,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 14:25:15,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:25:15,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 14:25:15,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 14:25:15,224 INFO L87 Difference]: Start difference. First operand 2449 states and 8066 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:25:15,441 INFO L93 Difference]: Finished difference Result 3433 states and 11469 transitions. [2022-03-15 14:25:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 14:25:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-03-15 14:25:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:25:15,453 INFO L225 Difference]: With dead ends: 3433 [2022-03-15 14:25:15,454 INFO L226 Difference]: Without dead ends: 2164 [2022-03-15 14:25:15,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-03-15 14:25:15,455 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 336 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:25:15,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 475 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:25:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2022-03-15 14:25:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2164. [2022-03-15 14:25:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 2163 states have (on average 3.1673601479426723) internal successors, (6851), 2163 states have internal predecessors, (6851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 6851 transitions. [2022-03-15 14:25:15,514 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 6851 transitions. Word has length 112 [2022-03-15 14:25:15,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:25:15,516 INFO L470 AbstractCegarLoop]: Abstraction has 2164 states and 6851 transitions. [2022-03-15 14:25:15,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 6851 transitions. [2022-03-15 14:25:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-15 14:25:15,526 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:25:15,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:25:15,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 14:25:15,526 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:25:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:25:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash -50241742, now seen corresponding path program 1 times [2022-03-15 14:25:15,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:25:15,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064734174] [2022-03-15 14:25:15,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:15,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:25:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:25:15,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:25:15,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064734174] [2022-03-15 14:25:15,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064734174] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:25:15,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237841544] [2022-03-15 14:25:15,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:15,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:25:15,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:25:15,610 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 14:25:15,645 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 14:25:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:15,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 14:25:15,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:25:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:25:15,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:25:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:25:16,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237841544] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:25:16,118 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:25:16,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-03-15 14:25:16,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987662441] [2022-03-15 14:25:16,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:25:16,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 14:25:16,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:25:16,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 14:25:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 14:25:16,120 INFO L87 Difference]: Start difference. First operand 2164 states and 6851 transitions. Second operand has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:25:16,193 INFO L93 Difference]: Finished difference Result 2869 states and 9286 transitions. [2022-03-15 14:25:16,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 14:25:16,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-03-15 14:25:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:25:16,204 INFO L225 Difference]: With dead ends: 2869 [2022-03-15 14:25:16,204 INFO L226 Difference]: Without dead ends: 2305 [2022-03-15 14:25:16,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-15 14:25:16,205 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 346 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:25:16,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 446 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:25:16,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2022-03-15 14:25:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2022-03-15 14:25:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 2304 states have (on average 3.1236979166666665) internal successors, (7197), 2304 states have internal predecessors, (7197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 7197 transitions. [2022-03-15 14:25:16,269 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 7197 transitions. Word has length 116 [2022-03-15 14:25:16,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:25:16,270 INFO L470 AbstractCegarLoop]: Abstraction has 2305 states and 7197 transitions. [2022-03-15 14:25:16,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 7197 transitions. [2022-03-15 14:25:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-15 14:25:16,276 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:25:16,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:25:16,296 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 14:25:16,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:25:16,492 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:25:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:25:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash 102358740, now seen corresponding path program 2 times [2022-03-15 14:25:16,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:25:16,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130116705] [2022-03-15 14:25:16,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:16,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:25:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:25:16,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:25:16,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130116705] [2022-03-15 14:25:16,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130116705] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:25:16,632 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:25:16,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 14:25:16,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231490986] [2022-03-15 14:25:16,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:25:16,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 14:25:16,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:25:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 14:25:16,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 14:25:16,634 INFO L87 Difference]: Start difference. First operand 2305 states and 7197 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:25:16,662 INFO L93 Difference]: Finished difference Result 2493 states and 7603 transitions. [2022-03-15 14:25:16,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 14:25:16,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-03-15 14:25:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:25:16,672 INFO L225 Difference]: With dead ends: 2493 [2022-03-15 14:25:16,672 INFO L226 Difference]: Without dead ends: 2343 [2022-03-15 14:25:16,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 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 14:25:16,673 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:25:16,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 180 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:25:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-03-15 14:25:16,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-03-15 14:25:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 3.066609735269001) internal successors, (7182), 2342 states have internal predecessors, (7182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 7182 transitions. [2022-03-15 14:25:16,724 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 7182 transitions. Word has length 116 [2022-03-15 14:25:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:25:16,724 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 7182 transitions. [2022-03-15 14:25:16,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 7182 transitions. [2022-03-15 14:25:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-03-15 14:25:16,730 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:25:16,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:25:16,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 14:25:16,730 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:25:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:25:16,730 INFO L85 PathProgramCache]: Analyzing trace with hash 743330443, now seen corresponding path program 1 times [2022-03-15 14:25:16,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:25:16,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989798484] [2022-03-15 14:25:16,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:16,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:25:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:25:16,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:25:16,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989798484] [2022-03-15 14:25:16,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989798484] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:25:16,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:25:16,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 14:25:16,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900825146] [2022-03-15 14:25:16,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:25:16,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 14:25:16,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:25:16,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 14:25:16,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 14:25:16,779 INFO L87 Difference]: Start difference. First operand 2343 states and 7182 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:25:16,841 INFO L93 Difference]: Finished difference Result 2594 states and 7748 transitions. [2022-03-15 14:25:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 14:25:16,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-03-15 14:25:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:25:16,851 INFO L225 Difference]: With dead ends: 2594 [2022-03-15 14:25:16,851 INFO L226 Difference]: Without dead ends: 2349 [2022-03-15 14:25:16,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-15 14:25:16,852 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 334 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:25:16,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 355 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:25:16,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-03-15 14:25:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2344. [2022-03-15 14:25:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2343 states have (on average 3.0657276995305165) internal successors, (7183), 2343 states have internal predecessors, (7183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 7183 transitions. [2022-03-15 14:25:16,936 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 7183 transitions. Word has length 123 [2022-03-15 14:25:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:25:16,936 INFO L470 AbstractCegarLoop]: Abstraction has 2344 states and 7183 transitions. [2022-03-15 14:25:16,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 7183 transitions. [2022-03-15 14:25:16,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-03-15 14:25:16,942 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:25:16,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:25:16,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 14:25:16,942 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:25:16,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:25:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash -129850157, now seen corresponding path program 1 times [2022-03-15 14:25:16,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:25:16,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180094932] [2022-03-15 14:25:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:25:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:25:17,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:25:17,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180094932] [2022-03-15 14:25:17,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180094932] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:25:17,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446226138] [2022-03-15 14:25:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:17,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:25:17,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:25:17,820 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 14:25:17,823 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 14:25:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:17,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 14:25:17,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:25:18,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:25:19,218 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:25:19,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:25:19,698 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 14:25:19,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:25:19,829 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 14:25:19,990 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 14:25:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:25:20,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:25:20,298 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 14:25:20,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 14:25:21,525 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:25:21,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2022-03-15 14:25:21,536 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:25:21,536 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 362 treesize of output 354 [2022-03-15 14:25:21,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 266 [2022-03-15 14:25:21,554 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:25:21,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 290 treesize of output 288 [2022-03-15 14:25:21,560 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 254 treesize of output 230 [2022-03-15 14:25:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 14:25:22,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446226138] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:25:22,992 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:25:22,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31, 31] total 81 [2022-03-15 14:25:22,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616815562] [2022-03-15 14:25:22,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:25:22,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-03-15 14:25:22,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:25:22,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-03-15 14:25:22,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=5660, Unknown=26, NotChecked=310, Total=6480 [2022-03-15 14:25:22,994 INFO L87 Difference]: Start difference. First operand 2344 states and 7183 transitions. Second operand has 81 states, 81 states have (on average 4.049382716049383) internal successors, (328), 81 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:30,682 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~back~0 4))) (let ((.cse1 (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0))) (.cse0 (mod c_~v_assert~0 256)) (.cse2 (not (< c_~back~0 c_~n~0))) (.cse3 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse5)) 1))) (.cse4 (not (<= 0 c_~back~0)))) (and (not (<= .cse0 0)) (= c_~d~0 0) (or .cse1 .cse2 .cse3 .cse4) .cse1 (or (<= 1 c_~back~0) (< c_~back~0 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (* c_~front~0 4) .cse5))) (or (= .cse0 0) .cse2 (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) .cse3 .cse4)))) is different from false [2022-03-15 14:25:33,776 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) (or (<= 1 c_~back~0) (< c_~back~0 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (* c_~front~0 4) (* c_~back~0 4))))) is different from false [2022-03-15 14:25:34,088 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0))) (.cse1 (* c_~back~0 4))) (and (not (<= (mod c_~v_assert~0 256) 0)) (or .cse0 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1)) (not (<= 0 c_~back~0))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) .cse0 (or (<= 1 c_~back~0) (< c_~back~0 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (* c_~front~0 4) .cse1))))) is different from false [2022-03-15 14:25:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:25:34,676 INFO L93 Difference]: Finished difference Result 20348 states and 64283 transitions. [2022-03-15 14:25:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-15 14:25:34,677 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 4.049382716049383) internal successors, (328), 81 states have internal predecessors, (328), 0 states have call successors, (0), 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 130 [2022-03-15 14:25:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:25:34,744 INFO L225 Difference]: With dead ends: 20348 [2022-03-15 14:25:34,744 INFO L226 Difference]: Without dead ends: 15059 [2022-03-15 14:25:34,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 217 SyntacticMatches, 27 SemanticMatches, 178 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12092 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=3587, Invalid=26746, Unknown=137, NotChecked=1750, Total=32220 [2022-03-15 14:25:34,753 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 4545 mSDsluCounter, 11211 mSDsCounter, 0 mSdLazyCounter, 4124 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4545 SdHoareTripleChecker+Valid, 9977 SdHoareTripleChecker+Invalid, 8197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 4124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3853 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:25:34,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4545 Valid, 9977 Invalid, 8197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 4124 Invalid, 0 Unknown, 3853 Unchecked, 2.2s Time] [2022-03-15 14:25:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15059 states. [2022-03-15 14:25:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15059 to 3680. [2022-03-15 14:25:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3679 states have (on average 2.9766240826311496) internal successors, (10951), 3679 states have internal predecessors, (10951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 10951 transitions. [2022-03-15 14:25:34,925 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 10951 transitions. Word has length 130 [2022-03-15 14:25:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:25:34,925 INFO L470 AbstractCegarLoop]: Abstraction has 3680 states and 10951 transitions. [2022-03-15 14:25:34,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 4.049382716049383) internal successors, (328), 81 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 10951 transitions. [2022-03-15 14:25:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 14:25:34,934 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:25:34,934 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:25:34,953 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 14:25:35,147 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 14:25:35,147 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:25:35,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:25:35,148 INFO L85 PathProgramCache]: Analyzing trace with hash 526565270, now seen corresponding path program 2 times [2022-03-15 14:25:35,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:25:35,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018591102] [2022-03-15 14:25:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:35,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:25:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:25:35,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:25:35,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018591102] [2022-03-15 14:25:35,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018591102] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:25:35,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286202912] [2022-03-15 14:25:35,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:25:35,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:25:35,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:25:35,364 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 14:25:35,364 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 14:25:35,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:25:35,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:25:35,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 14:25:35,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:25:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:25:35,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:25:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:25:36,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286202912] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:25:36,086 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:25:36,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 5] total 16 [2022-03-15 14:25:36,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660994050] [2022-03-15 14:25:36,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:25:36,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:25:36,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:25:36,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:25:36,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:25:36,088 INFO L87 Difference]: Start difference. First operand 3680 states and 10951 transitions. Second operand has 16 states, 16 states have (on average 18.75) internal successors, (300), 16 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:25:36,493 INFO L93 Difference]: Finished difference Result 12206 states and 37480 transitions. [2022-03-15 14:25:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 14:25:36,493 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 18.75) internal successors, (300), 16 states have internal predecessors, (300), 0 states have call successors, (0), 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 134 [2022-03-15 14:25:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:25:36,522 INFO L225 Difference]: With dead ends: 12206 [2022-03-15 14:25:36,523 INFO L226 Difference]: Without dead ends: 11468 [2022-03-15 14:25:36,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2022-03-15 14:25:36,524 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 1263 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:25:36,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1263 Valid, 1134 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:25:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11468 states. [2022-03-15 14:25:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11468 to 7088. [2022-03-15 14:25:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7088 states, 7087 states have (on average 2.995908000564414) internal successors, (21232), 7087 states have internal predecessors, (21232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7088 states to 7088 states and 21232 transitions. [2022-03-15 14:25:36,703 INFO L78 Accepts]: Start accepts. Automaton has 7088 states and 21232 transitions. Word has length 134 [2022-03-15 14:25:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:25:36,703 INFO L470 AbstractCegarLoop]: Abstraction has 7088 states and 21232 transitions. [2022-03-15 14:25:36,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.75) internal successors, (300), 16 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 7088 states and 21232 transitions. [2022-03-15 14:25:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-03-15 14:25:36,719 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:25:36,719 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:25:36,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 14:25:36,935 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 14:25:36,935 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:25:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:25:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2146157939, now seen corresponding path program 3 times [2022-03-15 14:25:36,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:25:36,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052786370] [2022-03-15 14:25:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:25:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:38,059 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 14:25:38,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:25:38,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052786370] [2022-03-15 14:25:38,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052786370] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:25:38,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976451721] [2022-03-15 14:25:38,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:25:38,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:25:38,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:25:38,061 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 14:25:38,061 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 14:25:38,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:25:38,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:25:38,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 14:25:38,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:25:39,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:25:39,193 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 14:25:39,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:25:39,277 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 14:25:39,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 23 treesize of output 7 [2022-03-15 14:25:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:25:39,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:25:39,588 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_191) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 14:25:39,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_190 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_191) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) c_~W~0)) is different from false [2022-03-15 14:25:39,665 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:25:39,665 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 174 treesize of output 166 [2022-03-15 14:25:39,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 122 [2022-03-15 14:25:39,671 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 122 treesize of output 110 [2022-03-15 14:25:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-03-15 14:25:40,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976451721] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:25:40,856 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:25:40,856 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 66 [2022-03-15 14:25:40,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224577180] [2022-03-15 14:25:40,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:25:40,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 14:25:40,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:25:40,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 14:25:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=3701, Unknown=2, NotChecked=250, Total=4290 [2022-03-15 14:25:40,858 INFO L87 Difference]: Start difference. First operand 7088 states and 21232 transitions. Second operand has 66 states, 66 states have (on average 5.0606060606060606) internal successors, (334), 66 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:25:48,908 INFO L93 Difference]: Finished difference Result 12250 states and 36989 transitions. [2022-03-15 14:25:48,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 14:25:48,909 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 5.0606060606060606) internal successors, (334), 66 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-03-15 14:25:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:25:48,935 INFO L225 Difference]: With dead ends: 12250 [2022-03-15 14:25:48,935 INFO L226 Difference]: Without dead ends: 10747 [2022-03-15 14:25:48,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 238 SyntacticMatches, 7 SemanticMatches, 122 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4316 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2558, Invalid=12210, Unknown=2, NotChecked=482, Total=15252 [2022-03-15 14:25:48,938 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 2980 mSDsluCounter, 6545 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2980 SdHoareTripleChecker+Valid, 6053 SdHoareTripleChecker+Invalid, 4030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1476 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:25:48,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2980 Valid, 6053 Invalid, 4030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2453 Invalid, 0 Unknown, 1476 Unchecked, 1.2s Time] [2022-03-15 14:25:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10747 states. [2022-03-15 14:25:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10747 to 6736. [2022-03-15 14:25:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6736 states, 6735 states have (on average 3.0157386785449147) internal successors, (20311), 6735 states have internal predecessors, (20311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6736 states to 6736 states and 20311 transitions. [2022-03-15 14:25:49,075 INFO L78 Accepts]: Start accepts. Automaton has 6736 states and 20311 transitions. Word has length 137 [2022-03-15 14:25:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:25:49,076 INFO L470 AbstractCegarLoop]: Abstraction has 6736 states and 20311 transitions. [2022-03-15 14:25:49,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 5.0606060606060606) internal successors, (334), 66 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 6736 states and 20311 transitions. [2022-03-15 14:25:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-03-15 14:25:49,089 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:25:49,089 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:25:49,107 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 14:25:49,303 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 14:25:49,303 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:25:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:25:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1470367235, now seen corresponding path program 4 times [2022-03-15 14:25:49,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:25:49,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632011577] [2022-03-15 14:25:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:25:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:25:49,384 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:25:49,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632011577] [2022-03-15 14:25:49,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632011577] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:25:49,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14239739] [2022-03-15 14:25:49,385 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:25:49,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:25:49,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:25:49,386 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 14:25:49,387 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 14:25:49,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:25:49,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:25:49,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 14:25:49,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:25:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:25:49,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:25:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:25:50,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14239739] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:25:50,091 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:25:50,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-15 14:25:50,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232152414] [2022-03-15 14:25:50,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:25:50,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 14:25:50,091 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:25:50,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 14:25:50,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-03-15 14:25:50,092 INFO L87 Difference]: Start difference. First operand 6736 states and 20311 transitions. Second operand has 19 states, 19 states have (on average 12.368421052631579) internal successors, (235), 19 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:25:50,248 INFO L93 Difference]: Finished difference Result 5761 states and 16994 transitions. [2022-03-15 14:25:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 14:25:50,249 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.368421052631579) internal successors, (235), 19 states have internal predecessors, (235), 0 states have call successors, (0), 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 141 [2022-03-15 14:25:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:25:50,259 INFO L225 Difference]: With dead ends: 5761 [2022-03-15 14:25:50,260 INFO L226 Difference]: Without dead ends: 4914 [2022-03-15 14:25:50,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-03-15 14:25:50,260 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 676 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:25:50,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 972 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:25:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4914 states. [2022-03-15 14:25:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4914 to 4909. [2022-03-15 14:25:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4909 states, 4908 states have (on average 3.021801140994295) internal successors, (14831), 4908 states have internal predecessors, (14831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 14831 transitions. [2022-03-15 14:25:50,359 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 14831 transitions. Word has length 141 [2022-03-15 14:25:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:25:50,360 INFO L470 AbstractCegarLoop]: Abstraction has 4909 states and 14831 transitions. [2022-03-15 14:25:50,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.368421052631579) internal successors, (235), 19 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:25:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 14831 transitions. [2022-03-15 14:25:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-15 14:25:50,368 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:25:50,368 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:25:50,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 14:25:50,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:25:50,583 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:25:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:25:50,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1959922121, now seen corresponding path program 5 times [2022-03-15 14:25:50,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:25:50,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043699200] [2022-03-15 14:25:50,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:25:50,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:25:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:25:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:25:51,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:25:51,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043699200] [2022-03-15 14:25:51,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043699200] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:25:51,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493418464] [2022-03-15 14:25:51,867 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:25:51,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:25:51,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:25:51,868 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 14:25:51,869 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 14:25:51,956 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 14:25:51,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:25:51,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 14:25:51,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:25:52,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:25:52,042 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-15 14:25:52,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-15 14:25:52,504 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 14:25:52,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 14:25:54,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 14:25:54,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 14:25:54,949 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-15 14:25:54,950 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 47 treesize of output 16 [2022-03-15 14:25:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:25:55,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:25:55,522 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_263 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-03-15 14:25:55,552 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-03-15 14:25:56,015 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 14:25:56,015 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 134 treesize of output 153 [2022-03-15 14:25:56,023 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:25:56,024 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 93 treesize of output 67 [2022-03-15 14:25:56,031 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:25:56,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-15 14:25:59,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-03-15 14:25:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-03-15 14:25:59,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493418464] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:25:59,911 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:25:59,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 36] total 97 [2022-03-15 14:25:59,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117312464] [2022-03-15 14:25:59,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:25:59,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-03-15 14:25:59,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:25:59,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-03-15 14:25:59,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=8299, Unknown=2, NotChecked=374, Total=9312 [2022-03-15 14:25:59,913 INFO L87 Difference]: Start difference. First operand 4909 states and 14831 transitions. Second operand has 97 states, 97 states have (on average 3.9278350515463916) internal successors, (381), 97 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:26:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:26:47,775 INFO L93 Difference]: Finished difference Result 62321 states and 195898 transitions. [2022-03-15 14:26:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 273 states. [2022-03-15 14:26:47,775 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.9278350515463916) internal successors, (381), 97 states have internal predecessors, (381), 0 states have call successors, (0), 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 148 [2022-03-15 14:26:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:26:47,970 INFO L225 Difference]: With dead ends: 62321 [2022-03-15 14:26:47,971 INFO L226 Difference]: Without dead ends: 56090 [2022-03-15 14:26:47,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 326 SyntacticMatches, 106 SemanticMatches, 360 ConstructedPredicates, 2 IntricatePredicates, 7 DeprecatedPredicates, 62514 ImplicationChecksByTransitivity, 42.4s TimeCoverageRelationStatistics Valid=17220, Invalid=112026, Unknown=2, NotChecked=1434, Total=130682 [2022-03-15 14:26:47,979 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 7877 mSDsluCounter, 32900 mSDsCounter, 0 mSdLazyCounter, 11563 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7877 SdHoareTripleChecker+Valid, 28138 SdHoareTripleChecker+Invalid, 27887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 11563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15600 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-03-15 14:26:47,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7877 Valid, 28138 Invalid, 27887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [724 Valid, 11563 Invalid, 0 Unknown, 15600 Unchecked, 5.6s Time] [2022-03-15 14:26:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56090 states. [2022-03-15 14:26:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56090 to 18837. [2022-03-15 14:26:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18837 states, 18836 states have (on average 3.2380016988744957) internal successors, (60991), 18836 states have internal predecessors, (60991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:26:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18837 states to 18837 states and 60991 transitions. [2022-03-15 14:26:48,850 INFO L78 Accepts]: Start accepts. Automaton has 18837 states and 60991 transitions. Word has length 148 [2022-03-15 14:26:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:26:48,850 INFO L470 AbstractCegarLoop]: Abstraction has 18837 states and 60991 transitions. [2022-03-15 14:26:48,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.9278350515463916) internal successors, (381), 97 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:26:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 18837 states and 60991 transitions. [2022-03-15 14:26:48,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-15 14:26:48,883 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:26:48,883 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:26:48,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 14:26:49,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:26:49,099 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:26:49,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:26:49,100 INFO L85 PathProgramCache]: Analyzing trace with hash -864539759, now seen corresponding path program 6 times [2022-03-15 14:26:49,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:26:49,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585012045] [2022-03-15 14:26:49,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:26:49,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:26:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:26:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:26:50,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:26:50,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585012045] [2022-03-15 14:26:50,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585012045] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:26:50,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916983685] [2022-03-15 14:26:50,582 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:26:50,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:26:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:26:50,583 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 14:26:50,584 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 14:26:50,730 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 14:26:50,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:26:50,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 14:26:50,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:26:52,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:26:52,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 14:26:53,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:26:53,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 14:26:53,485 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-15 14:26:53,486 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 47 treesize of output 16 [2022-03-15 14:26:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:26:53,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:26:53,916 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-15 14:26:53,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-15 14:26:54,477 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 14:26:54,477 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 134 treesize of output 153 [2022-03-15 14:26:54,485 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:26:54,486 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 93 treesize of output 67 [2022-03-15 14:26:54,493 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:26:54,494 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 39 treesize of output 26 [2022-03-15 14:26:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-03-15 14:26:58,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916983685] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:26:58,449 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:26:58,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36, 36] total 98 [2022-03-15 14:26:58,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772253246] [2022-03-15 14:26:58,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:26:58,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-03-15 14:26:58,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:26:58,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-03-15 14:26:58,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=8460, Unknown=2, NotChecked=378, Total=9506 [2022-03-15 14:26:58,452 INFO L87 Difference]: Start difference. First operand 18837 states and 60991 transitions. Second operand has 98 states, 98 states have (on average 3.8877551020408165) internal successors, (381), 98 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:27:32,395 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~back~0 4))) (let ((.cse15 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse12 (= (* c_~front~0 4) .cse10))) (let ((.cse1 (or .cse2 .cse12)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse15 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse14 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse8 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse19 (* c_~front~0 4))) (+ c_~d~0 (select .cse18 (+ c_~queue~0.offset .cse19)) (select .cse18 (+ c_~queue~0.offset .cse19 4)))) c_~W~0))) (.cse6 (and .cse1 (or .cse2 .cse13) .cse3 .cse4 (or .cse14 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse9 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (.cse16 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse17 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= |c_thread2Thread1of1ForFork2_~temp~0#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (or .cse0 .cse8 .cse9 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)) 1)) (not (<= 0 c_~back~0))) (<= c_~d~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse8 (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse11 (<= 1 c_~back~0))) (and (or .cse11 .cse12) (or .cse11 .cse13) (or .cse14 .cse11) (or .cse11 .cse15)))) (= |c_thread2Thread1of1ForFork2_~temp~0#1| 1) (or (and .cse16 .cse1 .cse17 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 .cse9 (and .cse16 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse17 .cse4)) (< 1 c_~W~0) (<= (+ c_~d~0 1) c_~W~0)))))) is different from false [2022-03-15 14:27:32,946 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse11 (= (* c_~front~0 4) (* c_~back~0 4)))) (let ((.cse1 (or .cse2 .cse11)) (.cse12 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse14 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse6 (and .cse1 (or .cse2 .cse12) .cse3 .cse4 (or .cse13 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse15 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse16 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse9 (* c_~front~0 4))) (+ c_~d~0 (select .cse8 (+ c_~queue~0.offset .cse9)) (select .cse8 (+ c_~queue~0.offset .cse9 4)))) c_~W~0)) (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse10 (<= 1 c_~back~0))) (and (or .cse10 .cse11) (or .cse10 .cse12) (or .cse13 .cse10) (or .cse10 .cse14)))) (or (and .cse15 .cse1 .cse16 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1) (and .cse15 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse16 .cse4)))))) is different from false [2022-03-15 14:27:33,280 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ c_~d~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))) c_~W~0)))) (and (or (= (mod c_~v_assert~0 256) 0) .cse0 (not (< c_~back~0 c_~n~0)) (<= |c_thread1Thread1of1ForFork1_#t~post1#1| 1) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0)) is different from false [2022-03-15 14:27:34,281 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ c_~d~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))) c_~W~0)))) (and (or (= (mod c_~v_assert~0 256) 0) .cse0 (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0)) is different from false [2022-03-15 14:27:34,936 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~back~0 4))) (let ((.cse15 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse12 (= (* c_~front~0 4) .cse10))) (let ((.cse1 (or .cse2 .cse12)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse15 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse14 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse8 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse19 (* c_~front~0 4))) (+ c_~d~0 (select .cse18 (+ c_~queue~0.offset .cse19)) (select .cse18 (+ c_~queue~0.offset .cse19 4)))) c_~W~0))) (.cse6 (and .cse1 (or .cse2 .cse13) .cse3 .cse4 (or .cse14 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse9 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (.cse16 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse17 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (or .cse0 .cse8 .cse9 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)) 1)) (not (<= 0 c_~back~0))) (<= c_~d~0 2) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse8 (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse11 (<= 1 c_~back~0))) (and (or .cse11 .cse12) (or .cse11 .cse13) (or .cse14 .cse11) (or .cse11 .cse15)))) (or (and .cse16 .cse1 .cse17 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 .cse9 (and .cse16 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse17 .cse4)) (< 1 c_~W~0)))))) is different from false [2022-03-15 14:27:37,660 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) (or (< c_~back~0 0) (let ((.cse2 (<= 1 c_~back~0))) (and (or .cse2 (= (* c_~front~0 4) (* c_~back~0 4))) (or .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or .cse2 (<= c_~d~0 0)))))) is different from false [2022-03-15 14:27:38,935 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (< c_~back~0 0) (let ((.cse2 (<= 1 c_~back~0))) (and (or .cse2 (= (* c_~front~0 4) (* c_~back~0 4))) (or .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or .cse2 (<= c_~d~0 0)))))) is different from false [2022-03-15 14:27:39,132 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~back~0 4))) (let ((.cse15 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse12 (= (* c_~front~0 4) .cse10))) (let ((.cse1 (or .cse2 .cse12)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse15 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse14 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse8 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse19 (* c_~front~0 4))) (+ c_~d~0 (select .cse18 (+ c_~queue~0.offset .cse19)) (select .cse18 (+ c_~queue~0.offset .cse19 4)))) c_~W~0))) (.cse6 (and .cse1 (or .cse2 .cse13) .cse3 .cse4 (or .cse14 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse9 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (.cse16 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse17 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (or .cse0 .cse8 .cse9 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)) 1)) (not (<= 0 c_~back~0))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1|) c_~W~0) (<= c_~d~0 2) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse8 (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse11 (<= 1 c_~back~0))) (and (or .cse11 .cse12) (or .cse11 .cse13) (or .cse14 .cse11) (or .cse11 .cse15)))) (or (and .cse16 .cse1 .cse17 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 .cse9 (and .cse16 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse17 .cse4)) (< 1 c_~W~0)))))) is different from false [2022-03-15 14:27:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:27:40,787 INFO L93 Difference]: Finished difference Result 96174 states and 313453 transitions. [2022-03-15 14:27:40,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-03-15 14:27:40,788 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 3.8877551020408165) internal successors, (381), 98 states have internal predecessors, (381), 0 states have call successors, (0), 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 148 [2022-03-15 14:27:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:27:41,270 INFO L225 Difference]: With dead ends: 96174 [2022-03-15 14:27:41,270 INFO L226 Difference]: Without dead ends: 92664 [2022-03-15 14:27:41,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 259 SyntacticMatches, 87 SemanticMatches, 281 ConstructedPredicates, 10 IntricatePredicates, 11 DeprecatedPredicates, 34578 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=11246, Invalid=62909, Unknown=141, NotChecked=5510, Total=79806 [2022-03-15 14:27:41,274 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 8202 mSDsluCounter, 20678 mSDsCounter, 0 mSdLazyCounter, 7914 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8202 SdHoareTripleChecker+Valid, 18199 SdHoareTripleChecker+Invalid, 21615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 7914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12727 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:27:41,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8202 Valid, 18199 Invalid, 21615 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [974 Valid, 7914 Invalid, 0 Unknown, 12727 Unchecked, 4.2s Time] [2022-03-15 14:27:41,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92664 states. [2022-03-15 14:27:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92664 to 24955. [2022-03-15 14:27:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24955 states, 24954 states have (on average 3.2728620662018115) internal successors, (81671), 24954 states have internal predecessors, (81671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:27:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24955 states to 24955 states and 81671 transitions. [2022-03-15 14:27:42,718 INFO L78 Accepts]: Start accepts. Automaton has 24955 states and 81671 transitions. Word has length 148 [2022-03-15 14:27:42,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:27:42,718 INFO L470 AbstractCegarLoop]: Abstraction has 24955 states and 81671 transitions. [2022-03-15 14:27:42,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 3.8877551020408165) internal successors, (381), 98 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:27:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 24955 states and 81671 transitions. [2022-03-15 14:27:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-15 14:27:42,762 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:27:42,762 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:27:42,779 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 14:27:42,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:27:42,979 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:27:42,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:27:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1443540091, now seen corresponding path program 7 times [2022-03-15 14:27:42,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:27:42,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380134854] [2022-03-15 14:27:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:27:42,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:27:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:27:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:27:44,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:27:44,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380134854] [2022-03-15 14:27:44,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380134854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:27:44,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138834320] [2022-03-15 14:27:44,065 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:27:44,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:27:44,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:27:44,066 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 14:27:44,067 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 14:27:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:27:44,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 14:27:44,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:27:44,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:27:44,247 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-15 14:27:44,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-15 14:27:44,690 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 14:27:44,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 14:27:46,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 14:27:46,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 14:27:46,779 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-15 14:27:46,780 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 47 treesize of output 16 [2022-03-15 14:27:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:27:46,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:27:47,152 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-15 14:27:47,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0)) c_~W~0)) is different from false [2022-03-15 14:27:47,563 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 14:27:47,563 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 134 treesize of output 153 [2022-03-15 14:27:47,571 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:27:47,571 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 93 treesize of output 67 [2022-03-15 14:27:47,578 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:27:47,578 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 39 treesize of output 26 [2022-03-15 14:27:51,558 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 14:27:51,558 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 22 treesize of output 18 [2022-03-15 14:27:51,582 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-15 14:27:51,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138834320] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:27:51,583 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:27:51,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 36] total 97 [2022-03-15 14:27:51,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338207523] [2022-03-15 14:27:51,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:27:51,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-03-15 14:27:51,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:27:51,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-03-15 14:27:51,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=8262, Unknown=2, NotChecked=374, Total=9312 [2022-03-15 14:27:51,585 INFO L87 Difference]: Start difference. First operand 24955 states and 81671 transitions. Second operand has 97 states, 97 states have (on average 3.865979381443299) internal successors, (375), 97 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:28:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:28:12,301 INFO L93 Difference]: Finished difference Result 48303 states and 153878 transitions. [2022-03-15 14:28:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 14:28:12,301 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.865979381443299) internal successors, (375), 97 states have internal predecessors, (375), 0 states have call successors, (0), 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 148 [2022-03-15 14:28:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:28:12,426 INFO L225 Difference]: With dead ends: 48303 [2022-03-15 14:28:12,427 INFO L226 Difference]: Without dead ends: 47394 [2022-03-15 14:28:12,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 260 SyntacticMatches, 38 SemanticMatches, 200 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 14892 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=5252, Invalid=34508, Unknown=48, NotChecked=794, Total=40602 [2022-03-15 14:28:12,429 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 4772 mSDsluCounter, 16829 mSDsCounter, 0 mSdLazyCounter, 6181 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 14801 SdHoareTripleChecker+Invalid, 13272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 6181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6753 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:28:12,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4772 Valid, 14801 Invalid, 13272 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [338 Valid, 6181 Invalid, 0 Unknown, 6753 Unchecked, 2.7s Time] [2022-03-15 14:28:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47394 states. [2022-03-15 14:28:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47394 to 24347. [2022-03-15 14:28:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24347 states, 24346 states have (on average 3.266696787973384) internal successors, (79531), 24346 states have internal predecessors, (79531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:28:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24347 states to 24347 states and 79531 transitions. [2022-03-15 14:28:13,059 INFO L78 Accepts]: Start accepts. Automaton has 24347 states and 79531 transitions. Word has length 148 [2022-03-15 14:28:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:28:13,060 INFO L470 AbstractCegarLoop]: Abstraction has 24347 states and 79531 transitions. [2022-03-15 14:28:13,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.865979381443299) internal successors, (375), 97 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:28:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 24347 states and 79531 transitions. [2022-03-15 14:28:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-15 14:28:13,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:28:13,103 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:28:13,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 14:28:13,307 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,SelfDestructingSolverStorable11 [2022-03-15 14:28:13,307 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:28:13,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:28:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1715784193, now seen corresponding path program 8 times [2022-03-15 14:28:13,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:28:13,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491979908] [2022-03-15 14:28:13,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:28:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:28:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:28:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:28:14,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:28:14,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491979908] [2022-03-15 14:28:14,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491979908] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:28:14,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642564346] [2022-03-15 14:28:14,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:28:14,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:28:14,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:28:14,587 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 14:28:14,587 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 14:28:14,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:28:14,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:28:14,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 14:28:14,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:28:15,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:28:15,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:28:16,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:28:16,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:28:16,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 14:28:16,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:28:16,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 14:28:17,313 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-15 14:28:17,313 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 47 treesize of output 16 [2022-03-15 14:28:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:28:17,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:28:17,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_384) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-15 14:28:17,710 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_384) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-15 14:28:20,928 INFO L353 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-03-15 14:28:20,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 97 [2022-03-15 14:28:20,968 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 14:28:20,969 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 998 treesize of output 966 [2022-03-15 14:28:20,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:28:20,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 433 treesize of output 329 [2022-03-15 14:28:21,036 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 14:28:21,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 810 treesize of output 798 [2022-03-15 14:28:21,059 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:28:21,059 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 710 treesize of output 502 [2022-03-15 14:28:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-15 14:28:25,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642564346] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:28:25,495 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:28:25,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 38, 39] total 102 [2022-03-15 14:28:25,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494795453] [2022-03-15 14:28:25,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:28:25,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-03-15 14:28:25,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:28:25,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-03-15 14:28:25,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=9126, Unknown=22, NotChecked=394, Total=10302 [2022-03-15 14:28:25,497 INFO L87 Difference]: Start difference. First operand 24347 states and 79531 transitions. Second operand has 102 states, 102 states have (on average 3.6862745098039214) internal successors, (376), 102 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:28:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:28:40,570 INFO L93 Difference]: Finished difference Result 63720 states and 208353 transitions. [2022-03-15 14:28:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-03-15 14:28:40,571 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.6862745098039214) internal successors, (376), 102 states have internal predecessors, (376), 0 states have call successors, (0), 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 148 [2022-03-15 14:28:40,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:28:40,754 INFO L225 Difference]: With dead ends: 63720 [2022-03-15 14:28:40,754 INFO L226 Difference]: Without dead ends: 60948 [2022-03-15 14:28:40,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 249 SyntacticMatches, 28 SemanticMatches, 204 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 15418 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=4627, Invalid=36771, Unknown=22, NotChecked=810, Total=42230 [2022-03-15 14:28:40,757 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 4558 mSDsluCounter, 17472 mSDsCounter, 0 mSdLazyCounter, 7146 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4558 SdHoareTripleChecker+Valid, 15631 SdHoareTripleChecker+Invalid, 12855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 7146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5369 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:28:40,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4558 Valid, 15631 Invalid, 12855 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [340 Valid, 7146 Invalid, 0 Unknown, 5369 Unchecked, 3.0s Time] [2022-03-15 14:28:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60948 states. [2022-03-15 14:28:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60948 to 27280. [2022-03-15 14:28:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27280 states, 27279 states have (on average 3.2549213680853404) internal successors, (88791), 27279 states have internal predecessors, (88791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:28:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27280 states to 27280 states and 88791 transitions. [2022-03-15 14:28:41,824 INFO L78 Accepts]: Start accepts. Automaton has 27280 states and 88791 transitions. Word has length 148 [2022-03-15 14:28:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:28:41,824 INFO L470 AbstractCegarLoop]: Abstraction has 27280 states and 88791 transitions. [2022-03-15 14:28:41,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.6862745098039214) internal successors, (376), 102 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:28:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 27280 states and 88791 transitions. [2022-03-15 14:28:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-15 14:28:41,892 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:28:41,892 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:28:41,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 14:28:42,101 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,SelfDestructingSolverStorable12 [2022-03-15 14:28:42,103 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:28:42,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:28:42,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1475957881, now seen corresponding path program 9 times [2022-03-15 14:28:42,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:28:42,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88908118] [2022-03-15 14:28:42,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:28:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:28:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:28:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:28:43,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:28:43,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88908118] [2022-03-15 14:28:43,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88908118] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:28:43,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038838133] [2022-03-15 14:28:43,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:28:43,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:28:43,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:28:43,954 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 14:28:43,954 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 14:28:44,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 14:28:44,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:28:44,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 14:28:44,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:28:44,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:28:44,145 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-15 14:28:44,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-15 14:28:44,429 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:28:44,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 14:28:45,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 14:28:45,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:28:45,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 14:28:45,767 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:28:45,767 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 13 [2022-03-15 14:28:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 14:28:45,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:28:46,116 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1|) c_~W~0)) is different from false [2022-03-15 14:28:46,122 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) is different from false [2022-03-15 14:28:46,144 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_423)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-15 14:28:46,442 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 14:28:46,442 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 259 treesize of output 244 [2022-03-15 14:28:46,449 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:28:46,449 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 184 treesize of output 146 [2022-03-15 14:28:46,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 118 [2022-03-15 14:28:47,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:28:47,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:28:47,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-15 14:28:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 8 not checked. [2022-03-15 14:28:47,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038838133] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:28:47,987 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:28:47,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 27, 25] total 81 [2022-03-15 14:28:47,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075141727] [2022-03-15 14:28:47,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:28:47,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-03-15 14:28:47,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:28:47,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-03-15 14:28:47,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=5671, Unknown=3, NotChecked=462, Total=6480 [2022-03-15 14:28:47,989 INFO L87 Difference]: Start difference. First operand 27280 states and 88791 transitions. Second operand has 81 states, 81 states have (on average 4.432098765432099) internal successors, (359), 81 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 14:29:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:29:27,302 INFO L93 Difference]: Finished difference Result 122600 states and 396247 transitions. [2022-03-15 14:29:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2022-03-15 14:29:27,302 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 4.432098765432099) internal successors, (359), 81 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) Word has length 148 [2022-03-15 14:29:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:29:27,641 INFO L225 Difference]: With dead ends: 122600 [2022-03-15 14:29:27,641 INFO L226 Difference]: Without dead ends: 103211 [2022-03-15 14:29:27,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 294 SyntacticMatches, 30 SemanticMatches, 324 ConstructedPredicates, 3 IntricatePredicates, 4 DeprecatedPredicates, 42530 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=10946, Invalid=93069, Unknown=3, NotChecked=1932, Total=105950 [2022-03-15 14:29:27,647 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 7271 mSDsluCounter, 25581 mSDsCounter, 0 mSdLazyCounter, 14146 mSolverCounterSat, 795 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7271 SdHoareTripleChecker+Valid, 22608 SdHoareTripleChecker+Invalid, 23153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 795 IncrementalHoareTripleChecker+Valid, 14146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8212 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:29:27,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7271 Valid, 22608 Invalid, 23153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [795 Valid, 14146 Invalid, 0 Unknown, 8212 Unchecked, 7.2s Time] [2022-03-15 14:29:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103211 states. [2022-03-15 14:29:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103211 to 35997. [2022-03-15 14:29:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35997 states, 35996 states have (on average 3.2472774752750304) internal successors, (116889), 35996 states have internal predecessors, (116889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:29:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35997 states to 35997 states and 116889 transitions. [2022-03-15 14:29:29,083 INFO L78 Accepts]: Start accepts. Automaton has 35997 states and 116889 transitions. Word has length 148 [2022-03-15 14:29:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:29:29,083 INFO L470 AbstractCegarLoop]: Abstraction has 35997 states and 116889 transitions. [2022-03-15 14:29:29,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 4.432098765432099) internal successors, (359), 81 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 14:29:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 35997 states and 116889 transitions. [2022-03-15 14:29:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-15 14:29:29,142 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:29:29,142 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:29:29,158 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 14:29:29,342 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,SelfDestructingSolverStorable13 [2022-03-15 14:29:29,342 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:29:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:29:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash -790466885, now seen corresponding path program 10 times [2022-03-15 14:29:29,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:29:29,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372884333] [2022-03-15 14:29:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:29:29,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:29:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:29:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:29:30,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:29:30,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372884333] [2022-03-15 14:29:30,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372884333] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:29:30,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964895708] [2022-03-15 14:29:30,277 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:29:30,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:29:30,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:29:30,278 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 14:29:30,278 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 14:29:30,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:29:30,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:29:30,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 14:29:30,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:29:30,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:29:30,433 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 14:29:30,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-15 14:29:30,903 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:29:30,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-15 14:29:32,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 14:29:33,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:29:33,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 42 treesize of output 40 [2022-03-15 14:29:33,117 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-15 14:29:33,118 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 47 treesize of output 16 [2022-03-15 14:29:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:29:33,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:29:33,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 14:29:33,428 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 14:29:33,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) is different from false [2022-03-15 14:29:33,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-15 14:29:33,790 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 14:29:33,791 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 258 treesize of output 244 [2022-03-15 14:29:33,799 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:29:33,799 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 184 treesize of output 146 [2022-03-15 14:29:33,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 118 [2022-03-15 14:29:41,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:29:41,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-15 14:29:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-03-15 14:29:41,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964895708] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:29:41,215 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:29:41,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 36] total 97 [2022-03-15 14:29:41,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855615873] [2022-03-15 14:29:41,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:29:41,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-03-15 14:29:41,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:29:41,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-03-15 14:29:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=7917, Unknown=5, NotChecked=740, Total=9312 [2022-03-15 14:29:41,216 INFO L87 Difference]: Start difference. First operand 35997 states and 116889 transitions. Second operand has 97 states, 97 states have (on average 3.7938144329896906) internal successors, (368), 97 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:04,574 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1)))) (let ((.cse4 (= (mod c_~v_assert~0 256) 0)) (.cse1 (or .cse6 .cse2)) (.cse7 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse8 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (.cse0 (or (<= c_~front~0 c_~back~0) .cse2)) (.cse3 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse5 (< c_~back~0 0)) (.cse11 (+ |c_#StackHeapBarrier| 1))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and .cse0 .cse1 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) .cse3 (or (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2)) .cse4 .cse5) (= c_~d~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse4 (and (or (not (= |c_ULTIMATE.start_main_#t~ret9#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2) .cse0 .cse1 .cse3 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)))) .cse5) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (or .cse2 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse0 .cse1 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|))) .cse3) .cse4 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) .cse6 (or (and .cse7 .cse8 .cse0 .cse1 .cse3) .cse4 .cse5) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0) (or .cse4 (and (or .cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse0 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse1 .cse3) .cse5) (or (and .cse7 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse8 .cse0 .cse3) .cse5 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse10 (* c_~front~0 4))) (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse10 4)) c_~d~0 (select (select .cse9 c_~queue~0.base) (+ c_~queue~0.offset .cse10)))) c_~W~0)) (<= .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base|)))) is different from false [2022-03-15 14:30:05,922 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1)))) (let ((.cse4 (= (mod c_~v_assert~0 256) 0)) (.cse1 (or .cse6 .cse2)) (.cse7 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse8 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (.cse0 (or (<= c_~front~0 c_~back~0) .cse2)) (.cse3 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse5 (< c_~back~0 0)) (.cse11 (+ |c_#StackHeapBarrier| 1))) (and (or (and .cse0 .cse1 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) .cse3 (or (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2)) .cse4 .cse5) (= c_~d~0 0) (<= c_~v_assert~0 1) (or .cse4 (and (or (not (= |c_ULTIMATE.start_main_#t~ret9#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2) .cse0 .cse1 .cse3 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)))) .cse5) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (or .cse2 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse0 .cse1 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|))) .cse3) .cse4 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) .cse6 (or (and .cse7 .cse8 .cse0 .cse1 .cse3) .cse4 .cse5) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0) (or .cse4 (and (or .cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse0 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse1 .cse3) .cse5) (or (and .cse7 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse8 .cse0 .cse3) .cse5 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse10 (* c_~front~0 4))) (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse10 4)) c_~d~0 (select (select .cse9 c_~queue~0.base) (+ c_~queue~0.offset .cse10)))) c_~W~0)) (<= .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base|)))) is different from false [2022-03-15 14:30:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:30:12,600 INFO L93 Difference]: Finished difference Result 96089 states and 306275 transitions. [2022-03-15 14:30:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-03-15 14:30:12,601 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.7938144329896906) internal successors, (368), 97 states have internal predecessors, (368), 0 states have call successors, (0), 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 148 [2022-03-15 14:30:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:30:12,909 INFO L225 Difference]: With dead ends: 96089 [2022-03-15 14:30:12,909 INFO L226 Difference]: Without dead ends: 95009 [2022-03-15 14:30:12,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 261 SyntacticMatches, 64 SemanticMatches, 241 ConstructedPredicates, 6 IntricatePredicates, 7 DeprecatedPredicates, 24299 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=7718, Invalid=48231, Unknown=7, NotChecked=2850, Total=58806 [2022-03-15 14:30:12,912 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 4379 mSDsluCounter, 21743 mSDsCounter, 0 mSdLazyCounter, 8190 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4379 SdHoareTripleChecker+Valid, 18527 SdHoareTripleChecker+Invalid, 21664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 8190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13147 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:30:12,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4379 Valid, 18527 Invalid, 21664 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [327 Valid, 8190 Invalid, 0 Unknown, 13147 Unchecked, 3.7s Time] [2022-03-15 14:30:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95009 states. [2022-03-15 14:30:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95009 to 39510. [2022-03-15 14:30:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39510 states, 39509 states have (on average 3.2510820319420892) internal successors, (128447), 39509 states have internal predecessors, (128447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39510 states to 39510 states and 128447 transitions. [2022-03-15 14:30:14,295 INFO L78 Accepts]: Start accepts. Automaton has 39510 states and 128447 transitions. Word has length 148 [2022-03-15 14:30:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:30:14,295 INFO L470 AbstractCegarLoop]: Abstraction has 39510 states and 128447 transitions. [2022-03-15 14:30:14,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.7938144329896906) internal successors, (368), 97 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:30:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 39510 states and 128447 transitions. [2022-03-15 14:30:14,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-15 14:30:14,358 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:30:14,358 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:30:14,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-15 14:30:14,563 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,SelfDestructingSolverStorable14 [2022-03-15 14:30:14,563 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:30:14,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:30:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash 606033631, now seen corresponding path program 11 times [2022-03-15 14:30:14,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:30:14,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834581571] [2022-03-15 14:30:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:30:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:30:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:30:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:15,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:30:15,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834581571] [2022-03-15 14:30:15,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834581571] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:30:15,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842915336] [2022-03-15 14:30:15,742 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:30:15,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:30:15,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:30:15,743 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 14:30:15,743 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 14:30:15,831 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 14:30:15,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:30:15,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 14:30:15,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:30:16,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:30:17,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:30:18,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:30:18,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 14:30:18,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:30:18,710 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 42 treesize of output 40 [2022-03-15 14:30:18,942 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-15 14:30:18,942 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 47 treesize of output 16 [2022-03-15 14:30:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:30:19,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:30:19,357 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_505 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-03-15 14:30:19,368 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_505 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0))) is different from false [2022-03-15 14:30:19,376 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_505 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-03-15 14:30:19,419 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_504)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-03-15 14:30:21,708 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:30:21,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-03-15 14:30:21,748 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 14:30:21,748 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 1958 treesize of output 1794 [2022-03-15 14:30:21,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:30:21,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1694 treesize of output 1390 [2022-03-15 14:30:21,775 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 1390 treesize of output 1166 [2022-03-15 14:30:21,819 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 14:30:21,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1214 treesize of output 1102 [2022-03-15 14:32:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-03-15 14:32:54,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842915336] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:32:54,329 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:32:54,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 38, 38] total 102 [2022-03-15 14:32:54,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494700180] [2022-03-15 14:32:54,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:32:54,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-03-15 14:32:54,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:32:54,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-03-15 14:32:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=735, Invalid=8776, Unknown=11, NotChecked=780, Total=10302 [2022-03-15 14:32:54,330 INFO L87 Difference]: Start difference. First operand 39510 states and 128447 transitions. Second operand has 102 states, 102 states have (on average 3.6176470588235294) internal successors, (369), 102 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 14:33:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:33:15,652 INFO L93 Difference]: Finished difference Result 81049 states and 262148 transitions. [2022-03-15 14:33:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-03-15 14:33:15,652 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.6176470588235294) internal successors, (369), 102 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) Word has length 148 [2022-03-15 14:33:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:33:15,890 INFO L225 Difference]: With dead ends: 81049 [2022-03-15 14:33:15,890 INFO L226 Difference]: Without dead ends: 81034 [2022-03-15 14:33:15,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 240 SyntacticMatches, 51 SemanticMatches, 225 ConstructedPredicates, 4 IntricatePredicates, 6 DeprecatedPredicates, 20402 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=6333, Invalid=43178, Unknown=11, NotChecked=1780, Total=51302 [2022-03-15 14:33:15,892 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 5480 mSDsluCounter, 15535 mSDsCounter, 0 mSdLazyCounter, 6300 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5480 SdHoareTripleChecker+Valid, 13710 SdHoareTripleChecker+Invalid, 15443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 6300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8748 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:33:15,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5480 Valid, 13710 Invalid, 15443 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [395 Valid, 6300 Invalid, 0 Unknown, 8748 Unchecked, 3.0s Time] [2022-03-15 14:33:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81034 states. [2022-03-15 14:33:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81034 to 46107. [2022-03-15 14:33:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46107 states, 46106 states have (on average 3.2735652626556195) internal successors, (150931), 46106 states have internal predecessors, (150931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 14:33:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46107 states to 46107 states and 150931 transitions. [2022-03-15 14:33:17,059 INFO L78 Accepts]: Start accepts. Automaton has 46107 states and 150931 transitions. Word has length 148 [2022-03-15 14:33:17,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:33:17,060 INFO L470 AbstractCegarLoop]: Abstraction has 46107 states and 150931 transitions. [2022-03-15 14:33:17,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.6176470588235294) internal successors, (369), 102 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 14:33:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 46107 states and 150931 transitions. [2022-03-15 14:33:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-15 14:33:17,135 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:33:17,135 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:33:17,152 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 14:33:17,336 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,SelfDestructingSolverStorable15 [2022-03-15 14:33:17,336 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 14:33:17,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:33:17,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2070442625, now seen corresponding path program 12 times [2022-03-15 14:33:17,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:33:17,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122476228] [2022-03-15 14:33:17,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:33:17,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:33:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:33:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:33:18,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:33:18,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122476228] [2022-03-15 14:33:18,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122476228] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:33:18,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683655080] [2022-03-15 14:33:18,483 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:33:18,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:33:18,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:33:18,484 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 14:33:18,485 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 14:33:18,582 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 14:33:18,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:33:18,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 14:33:18,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:33:18,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:33:18,680 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-15 14:33:18,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-15 14:33:19,220 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:33:19,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 14:33:19,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 14:33:20,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:33:21,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 14:33:21,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:33:21,827 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 42 treesize of output 40 [2022-03-15 14:33:21,914 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 14:33:21,915 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 13 [2022-03-15 14:33:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 14:33:22,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:33:22,231 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 14:33:22,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 14:33:22,242 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) c_~W~0)) is different from false [2022-03-15 14:33:22,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_547)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-15 14:33:23,791 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:33:23,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2022-03-15 14:33:23,833 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 14:33:23,833 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 15288 treesize of output 13723 [2022-03-15 14:33:23,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:33:23,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13622 treesize of output 11190 [2022-03-15 14:33:23,912 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 11190 treesize of output 9398 [2022-03-15 14:33:23,985 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 14:33:23,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9447 treesize of output 8270 Received shutdown request... [2022-03-15 14:38:19,846 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 14:38:19,848 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 14:38:19,864 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 14:38:19,872 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 14:38:19,872 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 14:38:20,055 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,SelfDestructingSolverStorable16 [2022-03-15 14:38:20,057 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 7ms.. [2022-03-15 14:38:20,059 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 14:38:20,059 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 14:38:20,059 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 14:38:20,061 INFO L732 BasicCegarLoop]: Path program histogram: [12, 2, 1, 1, 1] [2022-03-15 14:38:20,062 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 14:38:20,062 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 14:38:20,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:38:20 BasicIcfg [2022-03-15 14:38:20,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 14:38:20,064 INFO L158 Benchmark]: Toolchain (without parser) took 786850.63ms. Allocated memory was 213.9MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 156.3MB in the beginning and 900.4MB in the end (delta: -744.1MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-03-15 14:38:20,064 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 213.9MB. Free memory was 172.6MB in the beginning and 172.5MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 14:38:20,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.93ms. Allocated memory was 213.9MB in the beginning and 294.6MB in the end (delta: 80.7MB). Free memory was 156.1MB in the beginning and 262.9MB in the end (delta: -106.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-03-15 14:38:20,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.32ms. Allocated memory is still 294.6MB. Free memory was 262.9MB in the beginning and 260.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 14:38:20,065 INFO L158 Benchmark]: Boogie Preprocessor took 26.63ms. Allocated memory is still 294.6MB. Free memory was 260.9MB in the beginning and 259.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 14:38:20,065 INFO L158 Benchmark]: RCFGBuilder took 403.21ms. Allocated memory is still 294.6MB. Free memory was 259.4MB in the beginning and 240.2MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-15 14:38:20,065 INFO L158 Benchmark]: TraceAbstraction took 786109.43ms. Allocated memory was 294.6MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 239.9MB in the beginning and 900.4MB in the end (delta: -660.5MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-03-15 14:38:20,066 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 213.9MB. Free memory was 172.6MB in the beginning and 172.5MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 278.93ms. Allocated memory was 213.9MB in the beginning and 294.6MB in the end (delta: 80.7MB). Free memory was 156.1MB in the beginning and 262.9MB in the end (delta: -106.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.32ms. Allocated memory is still 294.6MB. Free memory was 262.9MB in the beginning and 260.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.63ms. Allocated memory is still 294.6MB. Free memory was 260.9MB in the beginning and 259.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 403.21ms. Allocated memory is still 294.6MB. Free memory was 259.4MB in the beginning and 240.2MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 786109.43ms. Allocated memory was 294.6MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 239.9MB in the beginning and 900.4MB in the end (delta: -660.5MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 7ms.. - TimeoutResultAtElement [Line: 110]: 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 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 7ms.. - TimeoutResultAtElement [Line: 109]: 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 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 7ms.. - TimeoutResultAtElement [Line: 108]: 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 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 7ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 786.0s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.5s, AutomataDifference: 241.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53044 SdHoareTripleChecker+Valid, 33.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53044 mSDsluCounter, 151333 SdHoareTripleChecker+Invalid, 27.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 75885 IncrementalHoareTripleChecker+Unchecked, 171422 mSDsCounter, 4292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68666 IncrementalHoareTripleChecker+Invalid, 148843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4292 mSolverCounterUnsat, 4652 mSDtfsCounter, 68666 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5769 GetRequests, 3115 SyntacticMatches, 439 SemanticMatches, 2215 ConstructedPredicates, 36 IntricatePredicates, 41 DeprecatedPredicates, 231355 ImplicationChecksByTransitivity, 220.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46107occurred in iteration=16, InterpolantAutomatonStates: 1481, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 339097 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 227.9s InterpolantComputationTime, 3851 NumberOfCodeBlocks, 3828 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 5505 ConstructedInterpolants, 633 QuantifiedInterpolants, 109437 SizeOfPredicates, 350 NumberOfNonLiveVariables, 4061 ConjunctsInSsa, 580 ConjunctsInUnsatCore, 40 InterpolantComputations, 4 PerfectInterpolantSequences, 94/624 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