/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-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 14:12:20,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 14:12:20,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 14:12:20,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 14:12:20,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 14:12:20,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 14:12:20,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 14:12:20,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 14:12:20,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 14:12:20,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 14:12:20,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 14:12:20,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 14:12:20,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 14:12:20,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 14:12:20,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 14:12:20,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 14:12:20,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 14:12:20,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 14:12:20,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 14:12:20,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 14:12:20,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 14:12:20,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 14:12:20,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 14:12:20,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 14:12:20,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 14:12:20,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 14:12:20,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 14:12:20,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 14:12:20,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 14:12:20,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 14:12:20,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 14:12:20,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 14:12:20,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 14:12:20,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 14:12:20,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 14:12:20,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 14:12:20,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 14:12:20,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 14:12:20,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 14:12:20,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 14:12:20,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 14:12:20,117 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:12:20,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 14:12:20,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 14:12:20,153 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 14:12:20,153 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 14:12:20,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 14:12:20,154 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 14:12:20,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 14:12:20,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 14:12:20,155 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 14:12:20,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 14:12:20,155 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 14:12:20,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 14:12:20,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 14:12:20,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 14:12:20,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 14:12:20,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 14:12:20,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 14:12:20,155 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 14:12:20,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 14:12:20,156 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 14:12:20,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 14:12:20,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 14:12:20,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 14:12:20,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 14:12:20,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 14:12:20,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:12:20,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 14:12:20,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 14:12:20,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 14:12:20,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 14:12:20,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 14:12:20,157 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 14:12:20,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 14:12:20,157 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:12:20,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 14:12:20,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 14:12:20,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 14:12:20,417 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 14:12:20,422 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 14:12:20,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-03-15 14:12:20,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e35da95b1/cdca4deea25846f48f0db522ceca4197/FLAG641d4f11d [2022-03-15 14:12:20,797 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 14:12:20,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-03-15 14:12:20,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e35da95b1/cdca4deea25846f48f0db522ceca4197/FLAG641d4f11d [2022-03-15 14:12:20,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e35da95b1/cdca4deea25846f48f0db522ceca4197 [2022-03-15 14:12:20,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 14:12:20,815 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 14:12:20,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 14:12:20,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 14:12:20,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 14:12:20,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:12:20" (1/1) ... [2022-03-15 14:12:20,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1b1996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:20, skipping insertion in model container [2022-03-15 14:12:20,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:12:20" (1/1) ... [2022-03-15 14:12:20,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 14:12:20,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 14:12:21,033 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-min-max-inc.wvr.c[3018,3031] [2022-03-15 14:12:21,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:12:21,089 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 14:12:21,134 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-min-max-inc.wvr.c[3018,3031] [2022-03-15 14:12:21,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 14:12:21,150 INFO L208 MainTranslator]: Completed translation [2022-03-15 14:12:21,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:21 WrapperNode [2022-03-15 14:12:21,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 14:12:21,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 14:12:21,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 14:12:21,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 14:12:21,156 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:12:21" (1/1) ... [2022-03-15 14:12:21,162 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:12:21" (1/1) ... [2022-03-15 14:12:21,176 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-03-15 14:12:21,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 14:12:21,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 14:12:21,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 14:12:21,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 14:12:21,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:21" (1/1) ... [2022-03-15 14:12:21,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:21" (1/1) ... [2022-03-15 14:12:21,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:21" (1/1) ... [2022-03-15 14:12:21,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:21" (1/1) ... [2022-03-15 14:12:21,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:21" (1/1) ... [2022-03-15 14:12:21,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:21" (1/1) ... [2022-03-15 14:12:21,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:21" (1/1) ... [2022-03-15 14:12:21,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 14:12:21,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 14:12:21,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 14:12:21,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 14:12:21,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:21" (1/1) ... [2022-03-15 14:12:21,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 14:12:21,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:21,218 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:12:21,230 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:12:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 14:12:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 14:12:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 14:12:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 14:12:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 14:12:21,267 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 14:12:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 14:12:21,267 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 14:12:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 14:12:21,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 14:12:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 14:12:21,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 14:12:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 14:12:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 14:12:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 14:12:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 14:12:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 14:12:21,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 14:12:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 14:12:21,271 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:12:21,382 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 14:12:21,383 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 14:12:21,673 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 14:12:21,746 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 14:12:21,746 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 14:12:21,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:12:21 BoogieIcfgContainer [2022-03-15 14:12:21,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 14:12:21,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 14:12:21,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 14:12:21,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 14:12:21,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:12:20" (1/3) ... [2022-03-15 14:12:21,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72925cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:12:21, skipping insertion in model container [2022-03-15 14:12:21,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:12:21" (2/3) ... [2022-03-15 14:12:21,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72925cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:12:21, skipping insertion in model container [2022-03-15 14:12:21,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:12:21" (3/3) ... [2022-03-15 14:12:21,756 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2022-03-15 14:12:21,759 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 14:12:21,759 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 14:12:21,759 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 14:12:21,759 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 14:12:21,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,791 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,791 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,791 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,791 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,791 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,791 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,792 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,793 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,794 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,794 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,794 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,795 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,795 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,795 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,796 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,796 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,796 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,796 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,796 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,797 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,798 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,798 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,798 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,798 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,798 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,798 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,798 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,799 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,799 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,799 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,799 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,800 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,800 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,800 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,800 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,800 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,800 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,801 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,802 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,803 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,803 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,803 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,803 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,803 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,803 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,803 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,803 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,804 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,804 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,804 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,804 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,807 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,808 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,808 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,808 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,808 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,809 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,809 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,809 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,810 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,810 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,810 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,810 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,810 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,810 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,810 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 14:12:21,825 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 14:12:21,871 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 14:12:21,878 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:12:21,878 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 14:12:21,894 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 172 transitions, 376 flow [2022-03-15 14:12:23,047 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have 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:12:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have 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:12:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-15 14:12:23,347 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:23,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:23,348 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:12:23,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1420994164, now seen corresponding path program 1 times [2022-03-15 14:12:23,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:23,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306247167] [2022-03-15 14:12:23,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:23,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:23,629 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:12:23,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:23,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306247167] [2022-03-15 14:12:23,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306247167] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:12:23,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:12:23,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 14:12:23,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200455296] [2022-03-15 14:12:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:23,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 14:12:23,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:23,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 14:12:23,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 14:12:23,697 INFO L87 Difference]: Start difference. First operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 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 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have 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:12:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:24,207 INFO L93 Difference]: Finished difference Result 26140 states and 111710 transitions. [2022-03-15 14:12:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 14:12:24,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-03-15 14:12:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:24,505 INFO L225 Difference]: With dead ends: 26140 [2022-03-15 14:12:24,505 INFO L226 Difference]: Without dead ends: 26136 [2022-03-15 14:12:24,506 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:12:24,509 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:24,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:12:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26136 states. [2022-03-15 14:12:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26136 to 26136. [2022-03-15 14:12:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26136 states, 26135 states have (on average 4.274191696958102) internal successors, (111706), 26135 states have internal predecessors, (111706), 0 states have call successors, (0), 0 states have 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:12:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26136 states to 26136 states and 111706 transitions. [2022-03-15 14:12:25,706 INFO L78 Accepts]: Start accepts. Automaton has 26136 states and 111706 transitions. Word has length 121 [2022-03-15 14:12:25,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:25,706 INFO L470 AbstractCegarLoop]: Abstraction has 26136 states and 111706 transitions. [2022-03-15 14:12:25,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have 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:12:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 26136 states and 111706 transitions. [2022-03-15 14:12:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-15 14:12:25,994 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:25,994 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] [2022-03-15 14:12:25,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 14:12:25,995 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:12:25,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:25,995 INFO L85 PathProgramCache]: Analyzing trace with hash -507464182, now seen corresponding path program 1 times [2022-03-15 14:12:25,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:25,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666538625] [2022-03-15 14:12:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:25,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:26,213 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:12:26,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:26,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666538625] [2022-03-15 14:12:26,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666538625] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:12:26,214 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:12:26,214 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 14:12:26,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737393026] [2022-03-15 14:12:26,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:26,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 14:12:26,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 14:12:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-03-15 14:12:26,216 INFO L87 Difference]: Start difference. First operand 26136 states and 111706 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have 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:12:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:26,673 INFO L93 Difference]: Finished difference Result 35136 states and 150562 transitions. [2022-03-15 14:12:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 14:12:26,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-03-15 14:12:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:27,051 INFO L225 Difference]: With dead ends: 35136 [2022-03-15 14:12:27,052 INFO L226 Difference]: Without dead ends: 35136 [2022-03-15 14:12:27,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-03-15 14:12:27,053 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 352 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:27,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 319 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:12:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35136 states. [2022-03-15 14:12:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35136 to 28386. [2022-03-15 14:12:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28386 states, 28385 states have (on average 4.277611414479479) internal successors, (121420), 28385 states have internal predecessors, (121420), 0 states have call successors, (0), 0 states have 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:12:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28386 states to 28386 states and 121420 transitions. [2022-03-15 14:12:28,435 INFO L78 Accepts]: Start accepts. Automaton has 28386 states and 121420 transitions. Word has length 121 [2022-03-15 14:12:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:28,436 INFO L470 AbstractCegarLoop]: Abstraction has 28386 states and 121420 transitions. [2022-03-15 14:12:28,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have 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:12:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 28386 states and 121420 transitions. [2022-03-15 14:12:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-15 14:12:28,533 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:28,534 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] [2022-03-15 14:12:28,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 14:12:28,535 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:12:28,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:28,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1313580435, now seen corresponding path program 1 times [2022-03-15 14:12:28,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:28,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218175780] [2022-03-15 14:12:28,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:28,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:28,706 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:12:28,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:28,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218175780] [2022-03-15 14:12:28,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218175780] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:12:28,707 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:12:28,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 14:12:28,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864678664] [2022-03-15 14:12:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:28,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 14:12:28,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 14:12:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-15 14:12:28,709 INFO L87 Difference]: Start difference. First operand 28386 states and 121420 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:12:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:29,205 INFO L93 Difference]: Finished difference Result 37401 states and 158042 transitions. [2022-03-15 14:12:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 14:12:29,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2022-03-15 14:12:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:29,403 INFO L225 Difference]: With dead ends: 37401 [2022-03-15 14:12:29,403 INFO L226 Difference]: Without dead ends: 28392 [2022-03-15 14:12:29,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-03-15 14:12:29,404 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 425 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:29,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 475 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:12:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28392 states. [2022-03-15 14:12:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28392 to 28387. [2022-03-15 14:12:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28387 states, 28386 states have (on average 4.277495948707109) internal successors, (121421), 28386 states have internal predecessors, (121421), 0 states have call successors, (0), 0 states have 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:12:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28387 states to 28387 states and 121421 transitions. [2022-03-15 14:12:30,440 INFO L78 Accepts]: Start accepts. Automaton has 28387 states and 121421 transitions. Word has length 126 [2022-03-15 14:12:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:30,440 INFO L470 AbstractCegarLoop]: Abstraction has 28387 states and 121421 transitions. [2022-03-15 14:12:30,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:12:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 28387 states and 121421 transitions. [2022-03-15 14:12:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-15 14:12:30,512 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:30,512 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, 1, 1, 1] [2022-03-15 14:12:30,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 14:12:30,512 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:12:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1766570838, now seen corresponding path program 1 times [2022-03-15 14:12:30,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:30,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135148162] [2022-03-15 14:12:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:30,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:30,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:30,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135148162] [2022-03-15 14:12:30,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135148162] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:30,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61612149] [2022-03-15 14:12:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:30,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:30,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:30,642 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:12:30,646 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:12:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:30,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 14:12:30,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:31,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:31,302 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:12:31,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61612149] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:31,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 14:12:31,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-15 14:12:31,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652514247] [2022-03-15 14:12:31,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:31,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 14:12:31,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:31,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 14:12:31,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-15 14:12:31,304 INFO L87 Difference]: Start difference. First operand 28387 states and 121421 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:12:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:31,777 INFO L93 Difference]: Finished difference Result 30943 states and 132410 transitions. [2022-03-15 14:12:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 14:12:31,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2022-03-15 14:12:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:31,885 INFO L225 Difference]: With dead ends: 30943 [2022-03-15 14:12:31,885 INFO L226 Difference]: Without dead ends: 30943 [2022-03-15 14:12:31,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-15 14:12:31,886 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 280 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:31,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 368 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:12:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2022-03-15 14:12:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 30943. [2022-03-15 14:12:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30943 states, 30942 states have (on average 4.279296748755737) internal successors, (132410), 30942 states have internal predecessors, (132410), 0 states have call successors, (0), 0 states have 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:12:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30943 states to 30943 states and 132410 transitions. [2022-03-15 14:12:32,835 INFO L78 Accepts]: Start accepts. Automaton has 30943 states and 132410 transitions. Word has length 133 [2022-03-15 14:12:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:32,836 INFO L470 AbstractCegarLoop]: Abstraction has 30943 states and 132410 transitions. [2022-03-15 14:12:32,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:12:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 30943 states and 132410 transitions. [2022-03-15 14:12:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-15 14:12:32,907 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:32,908 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:12:32,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 14:12:33,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:33,124 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:12:33,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1027911653, now seen corresponding path program 1 times [2022-03-15 14:12:33,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:33,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295298840] [2022-03-15 14:12:33,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:33,217 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:33,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295298840] [2022-03-15 14:12:33,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295298840] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:33,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675979504] [2022-03-15 14:12:33,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:33,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:33,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:33,224 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:12:33,226 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:12:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:33,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 14:12:33,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:33,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:34,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675979504] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:34,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 14:12:34,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-15 14:12:34,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880291765] [2022-03-15 14:12:34,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:12:34,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 14:12:34,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:34,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 14:12:34,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-15 14:12:34,083 INFO L87 Difference]: Start difference. First operand 30943 states and 132410 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:12:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:34,418 INFO L93 Difference]: Finished difference Result 34267 states and 146807 transitions. [2022-03-15 14:12:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 14:12:34,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2022-03-15 14:12:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:34,563 INFO L225 Difference]: With dead ends: 34267 [2022-03-15 14:12:34,563 INFO L226 Difference]: Without dead ends: 34267 [2022-03-15 14:12:34,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-15 14:12:34,564 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 240 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:34,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 410 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:12:34,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34267 states. [2022-03-15 14:12:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34267 to 34267. [2022-03-15 14:12:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34267 states, 34266 states have (on average 4.284334325570536) internal successors, (146807), 34266 states have internal predecessors, (146807), 0 states have call successors, (0), 0 states have 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:12:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34267 states to 34267 states and 146807 transitions. [2022-03-15 14:12:35,656 INFO L78 Accepts]: Start accepts. Automaton has 34267 states and 146807 transitions. Word has length 138 [2022-03-15 14:12:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:35,656 INFO L470 AbstractCegarLoop]: Abstraction has 34267 states and 146807 transitions. [2022-03-15 14:12:35,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:12:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 34267 states and 146807 transitions. [2022-03-15 14:12:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-15 14:12:35,754 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:35,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:12:35,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 14:12:35,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:35,970 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:12:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash 334563494, now seen corresponding path program 1 times [2022-03-15 14:12:35,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:35,971 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796589260] [2022-03-15 14:12:35,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:35,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 14:12:36,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:36,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796589260] [2022-03-15 14:12:36,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796589260] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:36,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581715705] [2022-03-15 14:12:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:36,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:36,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:36,504 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:12:36,505 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:12:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:36,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 14:12:36,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:36,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 14:12:37,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 14:12:37,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:12:37,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 14:12:37,239 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 15 treesize of output 7 [2022-03-15 14:12:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 14:12:37,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:37,586 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-03-15 14:12:37,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (and (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 (+ .cse0 1))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)))))) (<= 2147483647 .cse0)))) is different from false [2022-03-15 14:12:37,901 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (<= .cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)) (< (select .cse2 c_~A~0.offset) .cse1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset)))) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1))))))) is different from false [2022-03-15 14:12:37,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (and (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 2))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse3 (select .cse5 c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< (select .cse3 c_~A~0.offset) .cse4) (<= .cse4 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset) 1)))))))) (<= 2147483647 .cse1))))) is different from false [2022-03-15 14:12:38,139 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_#t~ret16#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret16#1.offset| (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< (select .cse0 |c_ULTIMATE.start_main_#t~ret16#1.offset|) .cse1) (<= .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 1))))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse3 |c_ULTIMATE.start_main_#t~ret16#1.base|) (+ |c_ULTIMATE.start_main_#t~ret16#1.offset| (* thread1Thread1of1ForFork0_~i~0 4))) (+ 2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|))))) (<= (select (select .cse4 |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) (+ .cse5 1)))) (<= 2147483647 .cse5))))) is different from false [2022-03-15 14:12:38,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= 2147483647 .cse0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse1 (select .cse3 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1)) (< (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) .cse1)))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 2)))) (<= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ .cse0 1)))))))) is different from false [2022-03-15 14:12:38,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (and (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2)))) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse2 1))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse5 (+ (* thread1Thread1of1ForFork0_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse3 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse3))))))) (<= 2147483647 .cse2))))) is different from false [2022-03-15 14:12:38,676 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:12:38,677 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 220 treesize of output 124 [2022-03-15 14:12:38,701 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:12:38,702 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 1183 treesize of output 1011 [2022-03-15 14:12:38,743 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:12:38,743 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 515 treesize of output 471 [2022-03-15 14:12:38,752 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 483 treesize of output 443 [2022-03-15 14:12:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-15 14:12:39,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581715705] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:12:39,081 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:12:39,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 38 [2022-03-15 14:12:39,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505873252] [2022-03-15 14:12:39,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:12:39,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 14:12:39,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:39,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 14:12:39,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=846, Unknown=7, NotChecked=448, Total=1406 [2022-03-15 14:12:39,083 INFO L87 Difference]: Start difference. First operand 34267 states and 146807 transitions. Second operand has 38 states, 38 states have (on average 9.789473684210526) internal successors, (372), 38 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:12:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:42,395 INFO L93 Difference]: Finished difference Result 182723 states and 790142 transitions. [2022-03-15 14:12:42,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 14:12:42,396 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 9.789473684210526) internal successors, (372), 38 states have internal predecessors, (372), 0 states have call successors, (0), 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 143 [2022-03-15 14:12:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:43,203 INFO L225 Difference]: With dead ends: 182723 [2022-03-15 14:12:43,203 INFO L226 Difference]: Without dead ends: 94065 [2022-03-15 14:12:43,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 266 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=765, Invalid=2796, Unknown=7, NotChecked=854, Total=4422 [2022-03-15 14:12:43,205 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1940 mSDsluCounter, 4155 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 5053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3602 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:43,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1940 Valid, 4126 Invalid, 5053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1343 Invalid, 0 Unknown, 3602 Unchecked, 0.7s Time] [2022-03-15 14:12:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94065 states. [2022-03-15 14:12:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94065 to 35288. [2022-03-15 14:12:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35288 states, 35287 states have (on average 4.248703488536855) internal successors, (149924), 35287 states have internal predecessors, (149924), 0 states have call successors, (0), 0 states have 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:12:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35288 states to 35288 states and 149924 transitions. [2022-03-15 14:12:46,127 INFO L78 Accepts]: Start accepts. Automaton has 35288 states and 149924 transitions. Word has length 143 [2022-03-15 14:12:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:46,127 INFO L470 AbstractCegarLoop]: Abstraction has 35288 states and 149924 transitions. [2022-03-15 14:12:46,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 9.789473684210526) internal successors, (372), 38 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have 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:12:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 35288 states and 149924 transitions. [2022-03-15 14:12:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-15 14:12:46,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:46,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:12:46,252 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:12:46,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:46,448 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:12:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:46,449 INFO L85 PathProgramCache]: Analyzing trace with hash 940179670, now seen corresponding path program 2 times [2022-03-15 14:12:46,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:46,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047416247] [2022-03-15 14:12:46,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:47,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:47,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047416247] [2022-03-15 14:12:47,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047416247] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:47,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073458853] [2022-03-15 14:12:47,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:12:47,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:47,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:47,627 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:12:47,628 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:12:47,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:12:47,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:12:47,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 14:12:47,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:47,749 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:12:47,769 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-15 14:12:47,770 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:12:47,808 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-03-15 14:12:47,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-03-15 14:12:47,968 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 14:12:47,968 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:12:48,148 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 14 treesize of output 16 [2022-03-15 14:12:48,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 14 treesize of output 16 [2022-03-15 14:12:48,211 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 15 treesize of output 7 [2022-03-15 14:12:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 14:12:48,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:48,502 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_231 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-03-15 14:12:48,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int)) (v_ArrVal_231 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-03-15 14:12:48,658 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int)) (v_ArrVal_231 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse3)) (.cse2 (+ .cse0 1))) (and (or (not .cse1) (<= c_~min~0 .cse2)) (or .cse1 (<= .cse3 .cse2)))))))) is different from false [2022-03-15 14:12:48,737 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int)) (v_ArrVal_231 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_231) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (< c_~min~0 .cse1)) (.cse2 (+ .cse3 1))) (and (or .cse0 (<= .cse1 .cse2)) (or (not .cse0) (<= c_~min~0 .cse2))))) (<= 2147483647 .cse3)))) is different from false [2022-03-15 14:12:48,773 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 247 treesize of output 215 [2022-03-15 14:12:48,780 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 105 treesize of output 97 [2022-03-15 14:12:48,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 183 [2022-03-15 14:12:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-03-15 14:12:49,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073458853] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:12:49,182 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:12:49,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 20] total 37 [2022-03-15 14:12:49,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201319436] [2022-03-15 14:12:49,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:12:49,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 14:12:49,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:12:49,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 14:12:49,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=942, Unknown=4, NotChecked=260, Total=1332 [2022-03-15 14:12:49,184 INFO L87 Difference]: Start difference. First operand 35288 states and 149924 transitions. Second operand has 37 states, 37 states have (on average 9.108108108108109) internal successors, (337), 37 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have 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:12:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:12:52,835 INFO L93 Difference]: Finished difference Result 194519 states and 838925 transitions. [2022-03-15 14:12:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 14:12:52,835 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 9.108108108108109) internal successors, (337), 37 states have internal predecessors, (337), 0 states have call successors, (0), 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 143 [2022-03-15 14:12:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:12:53,582 INFO L225 Difference]: With dead ends: 194519 [2022-03-15 14:12:53,582 INFO L226 Difference]: Without dead ends: 137857 [2022-03-15 14:12:53,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 272 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=554, Invalid=2998, Unknown=4, NotChecked=476, Total=4032 [2022-03-15 14:12:53,584 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 1724 mSDsluCounter, 4411 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 4390 SdHoareTripleChecker+Invalid, 3139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1768 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 14:12:53,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1724 Valid, 4390 Invalid, 3139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1261 Invalid, 0 Unknown, 1768 Unchecked, 0.9s Time] [2022-03-15 14:12:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137857 states. [2022-03-15 14:12:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137857 to 34727. [2022-03-15 14:12:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34727 states, 34726 states have (on average 4.253038069458043) internal successors, (147691), 34726 states have internal predecessors, (147691), 0 states have call successors, (0), 0 states have 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:12:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34727 states to 34727 states and 147691 transitions. [2022-03-15 14:12:56,558 INFO L78 Accepts]: Start accepts. Automaton has 34727 states and 147691 transitions. Word has length 143 [2022-03-15 14:12:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:12:56,558 INFO L470 AbstractCegarLoop]: Abstraction has 34727 states and 147691 transitions. [2022-03-15 14:12:56,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.108108108108109) internal successors, (337), 37 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have 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:12:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 34727 states and 147691 transitions. [2022-03-15 14:12:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-15 14:12:56,635 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:12:56,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:12:56,654 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:12:56,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:56,857 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:12:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:12:56,858 INFO L85 PathProgramCache]: Analyzing trace with hash -263687870, now seen corresponding path program 3 times [2022-03-15 14:12:56,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:12:56,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188102881] [2022-03-15 14:12:56,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:12:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:12:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:12:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:57,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:12:57,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188102881] [2022-03-15 14:12:57,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188102881] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:12:57,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475754435] [2022-03-15 14:12:57,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:12:57,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:12:57,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:12:57,210 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:12:57,212 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:12:57,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:12:57,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:12:57,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 14:12:57,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:12:58,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:12:58,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 14:12:58,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:12:58,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 14:12:58,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-15 14:12:58,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:12:58,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 14:12:58,601 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 17 treesize of output 9 [2022-03-15 14:12:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:12:58,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:12:58,815 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-03-15 14:12:58,866 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 .cse2 v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (+ (select .cse1 .cse2) 1) v_ArrVal_278)) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2022-03-15 14:12:58,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (not (<= (+ (select .cse0 c_~A~0.offset) 1) v_ArrVal_278)) (<= c_~min~0 (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-03-15 14:12:58,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (not (<= (+ (select .cse1 c_~A~0.offset) 1) v_ArrVal_278))))))) is different from false [2022-03-15 14:12:58,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (+ (select .cse1 c_~A~0.offset) 1) v_ArrVal_278)) (<= c_~min~0 (+ .cse0 1))))))) is different from false [2022-03-15 14:12:59,223 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse4 (select .cse5 c_~A~0.base))) (let ((.cse3 (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse0 (< c_~min~0 .cse1)) (.cse2 (+ .cse3 1))) (and (or .cse0 (<= .cse1 .cse2)) (or (not .cse0) (<= c_~min~0 .cse2))))) (<= 2147483647 .cse3) (not (<= (+ (select .cse4 c_~A~0.offset) 1) v_ArrVal_278))))))) is different from false [2022-03-15 14:12:59,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277))) (let ((.cse1 (select .cse5 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse5 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_280) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (+ (select .cse1 c_~A~0.offset) 1) v_ArrVal_278)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (+ .cse0 1)) (.cse4 (< c_~min~0 .cse2))) (and (or (<= .cse2 .cse3) .cse4) (or (<= c_~min~0 .cse3) (not .cse4)))))))))) is different from false [2022-03-15 14:12:59,430 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 315 treesize of output 279 [2022-03-15 14:12:59,434 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 219 treesize of output 203 [2022-03-15 14:12:59,438 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 60 treesize of output 56 [2022-03-15 14:12:59,442 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 56 treesize of output 54 [2022-03-15 14:13:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-15 14:13:00,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475754435] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:13:00,290 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:13:00,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 52 [2022-03-15 14:13:00,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563143641] [2022-03-15 14:13:00,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:13:00,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 14:13:00,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:13:00,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 14:13:00,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1822, Unknown=7, NotChecked=644, Total=2652 [2022-03-15 14:13:00,292 INFO L87 Difference]: Start difference. First operand 34727 states and 147691 transitions. Second operand has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have 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:13:06,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:13:06,449 INFO L93 Difference]: Finished difference Result 275931 states and 1198537 transitions. [2022-03-15 14:13:06,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 14:13:06,449 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 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 143 [2022-03-15 14:13:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:13:07,811 INFO L225 Difference]: With dead ends: 275931 [2022-03-15 14:13:07,811 INFO L226 Difference]: Without dead ends: 179015 [2022-03-15 14:13:07,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 255 SyntacticMatches, 11 SemanticMatches, 93 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1558, Invalid=6119, Unknown=7, NotChecked=1246, Total=8930 [2022-03-15 14:13:07,813 INFO L933 BasicCegarLoop]: 483 mSDtfsCounter, 2935 mSDsluCounter, 6814 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2935 SdHoareTripleChecker+Valid, 6772 SdHoareTripleChecker+Invalid, 7702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5035 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:13:07,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2935 Valid, 6772 Invalid, 7702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2558 Invalid, 0 Unknown, 5035 Unchecked, 1.1s Time] [2022-03-15 14:13:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179015 states. [2022-03-15 14:13:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179015 to 34147. [2022-03-15 14:13:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34147 states, 34146 states have (on average 4.24767176243191) internal successors, (145041), 34146 states have internal predecessors, (145041), 0 states have call successors, (0), 0 states have 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:13:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34147 states to 34147 states and 145041 transitions. [2022-03-15 14:13:11,422 INFO L78 Accepts]: Start accepts. Automaton has 34147 states and 145041 transitions. Word has length 143 [2022-03-15 14:13:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:13:11,422 INFO L470 AbstractCegarLoop]: Abstraction has 34147 states and 145041 transitions. [2022-03-15 14:13:11,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have 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:13:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 34147 states and 145041 transitions. [2022-03-15 14:13:11,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-15 14:13:11,507 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:13:11,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:13:11,526 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:13:11,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:13:11,724 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:13:11,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:13:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1870998198, now seen corresponding path program 4 times [2022-03-15 14:13:11,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:13:11,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698391982] [2022-03-15 14:13:11,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:13:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:13:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:13:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 14:13:11,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:13:11,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698391982] [2022-03-15 14:13:11,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698391982] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 14:13:11,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 14:13:11,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 14:13:11,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82556275] [2022-03-15 14:13:11,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 14:13:11,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 14:13:11,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:13:11,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 14:13:11,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-15 14:13:11,805 INFO L87 Difference]: Start difference. First operand 34147 states and 145041 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have 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:13:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:13:12,627 INFO L93 Difference]: Finished difference Result 49552 states and 212202 transitions. [2022-03-15 14:13:12,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 14:13:12,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-03-15 14:13:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:13:12,742 INFO L225 Difference]: With dead ends: 49552 [2022-03-15 14:13:12,742 INFO L226 Difference]: Without dead ends: 29945 [2022-03-15 14:13:12,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-15 14:13:12,743 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 14:13:12,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 698 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 14:13:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29945 states. [2022-03-15 14:13:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29945 to 29945. [2022-03-15 14:13:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29945 states, 29944 states have (on average 4.260786802030457) internal successors, (127585), 29944 states have internal predecessors, (127585), 0 states have call successors, (0), 0 states have 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:13:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29945 states to 29945 states and 127585 transitions. [2022-03-15 14:13:13,951 INFO L78 Accepts]: Start accepts. Automaton has 29945 states and 127585 transitions. Word has length 143 [2022-03-15 14:13:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:13:13,953 INFO L470 AbstractCegarLoop]: Abstraction has 29945 states and 127585 transitions. [2022-03-15 14:13:13,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have 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:13:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 29945 states and 127585 transitions. [2022-03-15 14:13:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-15 14:13:14,023 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:13:14,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:13:14,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 14:13:14,024 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:13:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:13:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash -342153556, now seen corresponding path program 5 times [2022-03-15 14:13:14,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:13:14,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394598816] [2022-03-15 14:13:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:13:14,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:13:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:13:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 14:13:14,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:13:14,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394598816] [2022-03-15 14:13:14,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394598816] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:13:14,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023372659] [2022-03-15 14:13:14,182 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:13:14,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:13:14,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:13:14,183 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:13:14,184 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:13:14,278 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 14:13:14,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:13:14,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 14:13:14,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:13:14,431 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:13:14,432 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 61 treesize of output 41 [2022-03-15 14:13:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 14:13:14,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:13:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 14:13:14,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023372659] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:13:14,959 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:13:14,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-03-15 14:13:14,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642975329] [2022-03-15 14:13:14,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:13:14,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 14:13:14,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:13:14,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 14:13:14,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-03-15 14:13:14,960 INFO L87 Difference]: Start difference. First operand 29945 states and 127585 transitions. Second operand has 16 states, 16 states have (on average 15.125) internal successors, (242), 16 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:13:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:13:16,737 INFO L93 Difference]: Finished difference Result 157839 states and 681442 transitions. [2022-03-15 14:13:16,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 14:13:16,737 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.125) internal successors, (242), 16 states have internal predecessors, (242), 0 states have call successors, (0), 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 143 [2022-03-15 14:13:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:13:17,604 INFO L225 Difference]: With dead ends: 157839 [2022-03-15 14:13:17,605 INFO L226 Difference]: Without dead ends: 103206 [2022-03-15 14:13:17,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2022-03-15 14:13:17,605 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 617 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:13:17,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 2107 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 467 Invalid, 0 Unknown, 142 Unchecked, 0.2s Time] [2022-03-15 14:13:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103206 states. [2022-03-15 14:13:20,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103206 to 61925. [2022-03-15 14:13:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61925 states, 61924 states have (on average 4.077417479490989) internal successors, (252490), 61924 states have internal predecessors, (252490), 0 states have call successors, (0), 0 states have 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:13:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61925 states to 61925 states and 252490 transitions. [2022-03-15 14:13:20,386 INFO L78 Accepts]: Start accepts. Automaton has 61925 states and 252490 transitions. Word has length 143 [2022-03-15 14:13:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:13:20,387 INFO L470 AbstractCegarLoop]: Abstraction has 61925 states and 252490 transitions. [2022-03-15 14:13:20,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.125) internal successors, (242), 16 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:13:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 61925 states and 252490 transitions. [2022-03-15 14:13:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-15 14:13:20,545 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:13:20,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:13:20,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 14:13:20,759 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:13:20,760 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:13:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:13:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1120956340, now seen corresponding path program 6 times [2022-03-15 14:13:20,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:13:20,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851522573] [2022-03-15 14:13:20,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:13:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:13:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:13:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 14:13:21,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:13:21,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851522573] [2022-03-15 14:13:21,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851522573] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:13:21,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095521822] [2022-03-15 14:13:21,201 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:13:21,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:13:21,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:13:21,202 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:13:21,203 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:13:21,314 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 14:13:21,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:13:21,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 14:13:21,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:13:21,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:13:21,913 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 21 treesize of output 21 [2022-03-15 14:13:22,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 35 treesize of output 19 [2022-03-15 14:13:22,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:13:22,131 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 16 treesize of output 18 [2022-03-15 14:13:22,181 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 17 treesize of output 9 [2022-03-15 14:13:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:22,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:13:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:24,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095521822] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:13:24,484 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:13:24,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21, 15] total 37 [2022-03-15 14:13:24,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320509877] [2022-03-15 14:13:24,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:13:24,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 14:13:24,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:13:24,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 14:13:24,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1072, Unknown=38, NotChecked=0, Total=1332 [2022-03-15 14:13:24,486 INFO L87 Difference]: Start difference. First operand 61925 states and 252490 transitions. Second operand has 37 states, 37 states have (on average 8.675675675675675) internal successors, (321), 37 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have 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:13:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:13:35,711 INFO L93 Difference]: Finished difference Result 226451 states and 945981 transitions. [2022-03-15 14:13:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 14:13:35,711 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 8.675675675675675) internal successors, (321), 37 states have internal predecessors, (321), 0 states have call successors, (0), 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 143 [2022-03-15 14:13:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:13:36,565 INFO L225 Difference]: With dead ends: 226451 [2022-03-15 14:13:36,565 INFO L226 Difference]: Without dead ends: 101830 [2022-03-15 14:13:36,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1862 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1715, Invalid=5713, Unknown=54, NotChecked=0, Total=7482 [2022-03-15 14:13:36,568 INFO L933 BasicCegarLoop]: 447 mSDtfsCounter, 1709 mSDsluCounter, 6046 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 5991 SdHoareTripleChecker+Invalid, 2951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1064 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 14:13:36,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1709 Valid, 5991 Invalid, 2951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1827 Invalid, 0 Unknown, 1064 Unchecked, 0.9s Time] [2022-03-15 14:13:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101830 states. [2022-03-15 14:13:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101830 to 52797. [2022-03-15 14:13:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52797 states, 52796 states have (on average 4.1002159254488975) internal successors, (216475), 52796 states have internal predecessors, (216475), 0 states have call successors, (0), 0 states have 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:13:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52797 states to 52797 states and 216475 transitions. [2022-03-15 14:13:39,446 INFO L78 Accepts]: Start accepts. Automaton has 52797 states and 216475 transitions. Word has length 143 [2022-03-15 14:13:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:13:39,447 INFO L470 AbstractCegarLoop]: Abstraction has 52797 states and 216475 transitions. [2022-03-15 14:13:39,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 8.675675675675675) internal successors, (321), 37 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have 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:13:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 52797 states and 216475 transitions. [2022-03-15 14:13:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-15 14:13:39,595 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:13:39,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:13:39,612 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:13:39,811 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:13:39,812 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:13:39,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:13:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash 627705186, now seen corresponding path program 7 times [2022-03-15 14:13:39,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:13:39,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547337147] [2022-03-15 14:13:39,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:13:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:13:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:13:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:40,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:13:40,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547337147] [2022-03-15 14:13:40,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547337147] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:13:40,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909928385] [2022-03-15 14:13:40,502 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:13:40,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:13:40,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:13:40,516 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:13:40,517 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:13:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:13:40,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 14:13:40,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:13:40,646 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:13:40,669 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-15 14:13:40,670 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:13:40,733 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 14:13:40,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 14:13:40,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 14:13:40,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-15 14:13:40,932 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:13:40,932 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 63 treesize of output 43 [2022-03-15 14:13:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:41,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:13:44,566 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_443 Int) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_441 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_441) c_~A~0.base))) (let ((.cse1 (select (store .cse0 c_~A~0.offset v_ArrVal_443) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (not (<= v_ArrVal_443 (+ (select .cse0 c_~A~0.offset) 1))) (< v_ArrVal_443 .cse1) (<= .cse1 (+ c_~max~0 1)))))) (<= 2147483647 c_~max~0)) is different from false [2022-03-15 14:13:44,663 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 118 treesize of output 106 [2022-03-15 14:13:44,672 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:13:44,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 88 [2022-03-15 14:13:44,681 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:13:44,682 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 131 treesize of output 119 [2022-03-15 14:13:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 14:13:44,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909928385] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:13:44,897 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:13:44,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 31 [2022-03-15 14:13:44,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689443695] [2022-03-15 14:13:44,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:13:44,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 14:13:44,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:13:44,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 14:13:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=757, Unknown=5, NotChecked=56, Total=930 [2022-03-15 14:13:44,898 INFO L87 Difference]: Start difference. First operand 52797 states and 216475 transitions. Second operand has 31 states, 31 states have (on average 9.580645161290322) internal successors, (297), 31 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have 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:13:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:13:48,192 INFO L93 Difference]: Finished difference Result 203537 states and 858497 transitions. [2022-03-15 14:13:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 14:13:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.580645161290322) internal successors, (297), 31 states have internal predecessors, (297), 0 states have call successors, (0), 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 143 [2022-03-15 14:13:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:13:48,930 INFO L225 Difference]: With dead ends: 203537 [2022-03-15 14:13:48,931 INFO L226 Difference]: Without dead ends: 86049 [2022-03-15 14:13:48,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 279 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=796, Invalid=3109, Unknown=5, NotChecked=122, Total=4032 [2022-03-15 14:13:48,932 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 2377 mSDsluCounter, 4898 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2377 SdHoareTripleChecker+Valid, 4785 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 764 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 14:13:48,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2377 Valid, 4785 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1576 Invalid, 0 Unknown, 764 Unchecked, 0.7s Time] [2022-03-15 14:13:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86049 states. [2022-03-15 14:13:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86049 to 29472. [2022-03-15 14:13:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29472 states, 29471 states have (on average 4.237793084727359) internal successors, (124892), 29471 states have internal predecessors, (124892), 0 states have call successors, (0), 0 states have 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:13:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29472 states to 29472 states and 124892 transitions. [2022-03-15 14:13:50,372 INFO L78 Accepts]: Start accepts. Automaton has 29472 states and 124892 transitions. Word has length 143 [2022-03-15 14:13:50,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:13:50,372 INFO L470 AbstractCegarLoop]: Abstraction has 29472 states and 124892 transitions. [2022-03-15 14:13:50,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.580645161290322) internal successors, (297), 31 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have 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:13:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 29472 states and 124892 transitions. [2022-03-15 14:13:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-15 14:13:50,775 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:13:50,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:13:50,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 14:13:50,976 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:13:50,976 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:13:50,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:13:50,976 INFO L85 PathProgramCache]: Analyzing trace with hash 929095160, now seen corresponding path program 8 times [2022-03-15 14:13:50,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:13:50,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267177568] [2022-03-15 14:13:50,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:13:50,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:13:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:13:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:51,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:13:51,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267177568] [2022-03-15 14:13:51,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267177568] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:13:51,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361058273] [2022-03-15 14:13:51,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 14:13:51,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:13:51,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:13:51,356 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:13:51,369 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:13:51,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 14:13:51,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:13:51,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 14:13:51,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:13:51,506 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:13:51,530 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-15 14:13:51,532 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:13:51,697 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 14:13:51,697 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:13:52,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 14:13:52,141 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 28 treesize of output 16 [2022-03-15 14:13:52,213 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 16 treesize of output 18 [2022-03-15 14:13:52,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-03-15 14:13:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:13:52,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:13:52,653 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_493 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_493) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))) (<= 2147483647 c_~max~0)) is different from false [2022-03-15 14:13:52,706 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_491 Int) (v_ArrVal_493 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (or (not (<= v_ArrVal_491 (+ (select .cse0 .cse1) 1))) (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 .cse1 v_ArrVal_491)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_493) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)))))) is different from false [2022-03-15 14:13:52,727 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_491 Int) (v_ArrVal_493 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (or (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_491)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_493) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (not (<= v_ArrVal_491 (+ (select .cse0 c_~A~0.offset) 1)))))) (<= 2147483647 c_~max~0)) is different from false [2022-03-15 14:13:52,748 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 Int) (v_ArrVal_493 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490))) (let ((.cse0 (select .cse1 c_~A~0.base))) (or (not (<= v_ArrVal_491 (+ (select .cse0 c_~A~0.offset) 1))) (<= (select (select (store (store .cse1 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_491)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_493) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))))))) is different from false [2022-03-15 14:13:52,811 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 105 treesize of output 81 [2022-03-15 14:13:52,814 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 54 treesize of output 50 [2022-03-15 14:13:52,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-03-15 14:13:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-15 14:13:53,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361058273] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:13:53,146 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:13:53,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 45 [2022-03-15 14:13:53,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123757400] [2022-03-15 14:13:53,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:13:53,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 14:13:53,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:13:53,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 14:13:53,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1479, Unknown=4, NotChecked=324, Total=1980 [2022-03-15 14:13:53,148 INFO L87 Difference]: Start difference. First operand 29472 states and 124892 transitions. Second operand has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have 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:13:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:13:59,205 INFO L93 Difference]: Finished difference Result 198905 states and 866132 transitions. [2022-03-15 14:13:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 14:13:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 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 143 [2022-03-15 14:13:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:14:00,073 INFO L225 Difference]: With dead ends: 198905 [2022-03-15 14:14:00,073 INFO L226 Difference]: Without dead ends: 105323 [2022-03-15 14:14:00,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 263 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2247, Invalid=7271, Unknown=4, NotChecked=780, Total=10302 [2022-03-15 14:14:00,076 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 3659 mSDsluCounter, 4602 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3659 SdHoareTripleChecker+Valid, 4636 SdHoareTripleChecker+Invalid, 5117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3201 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 14:14:00,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3659 Valid, 4636 Invalid, 5117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1724 Invalid, 0 Unknown, 3201 Unchecked, 1.6s Time] [2022-03-15 14:14:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105323 states. [2022-03-15 14:14:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105323 to 28157. [2022-03-15 14:14:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28157 states, 28156 states have (on average 4.237249609319505) internal successors, (119304), 28156 states have internal predecessors, (119304), 0 states have call successors, (0), 0 states have 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:14:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28157 states to 28157 states and 119304 transitions. [2022-03-15 14:14:02,036 INFO L78 Accepts]: Start accepts. Automaton has 28157 states and 119304 transitions. Word has length 143 [2022-03-15 14:14:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:14:02,041 INFO L470 AbstractCegarLoop]: Abstraction has 28157 states and 119304 transitions. [2022-03-15 14:14:02,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have 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:14:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 28157 states and 119304 transitions. [2022-03-15 14:14:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-15 14:14:02,107 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:14:02,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:14:02,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 14:14:02,323 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:14:02,324 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:14:02,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:14:02,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1049396362, now seen corresponding path program 9 times [2022-03-15 14:14:02,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:14:02,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148420109] [2022-03-15 14:14:02,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:14:02,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:14:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:14:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 14:14:02,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:14:02,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148420109] [2022-03-15 14:14:02,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148420109] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:14:02,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866043814] [2022-03-15 14:14:02,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 14:14:02,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:14:02,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:14:02,412 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:14:02,418 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:14:02,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 14:14:02,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:14:02,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 14:14:02,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:14:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 14:14:02,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:14:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 14:14:02,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866043814] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:14:02,982 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:14:02,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 14:14:02,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602093490] [2022-03-15 14:14:02,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:14:02,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 14:14:02,983 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:14:02,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 14:14:02,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-15 14:14:02,983 INFO L87 Difference]: Start difference. First operand 28157 states and 119304 transitions. Second operand has 8 states, 8 states have (on average 33.625) internal successors, (269), 8 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have 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:14:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:14:03,578 INFO L93 Difference]: Finished difference Result 38564 states and 164557 transitions. [2022-03-15 14:14:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 14:14:03,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.625) internal successors, (269), 8 states have internal predecessors, (269), 0 states have call successors, (0), 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 143 [2022-03-15 14:14:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:14:03,661 INFO L225 Difference]: With dead ends: 38564 [2022-03-15 14:14:03,661 INFO L226 Difference]: Without dead ends: 22799 [2022-03-15 14:14:03,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-03-15 14:14:03,662 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 72 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 14:14:03,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 680 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 14:14:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22799 states. [2022-03-15 14:14:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22799 to 22679. [2022-03-15 14:14:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22679 states, 22678 states have (on average 4.1738248522797425) internal successors, (94654), 22678 states have internal predecessors, (94654), 0 states have call successors, (0), 0 states have 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:14:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22679 states to 22679 states and 94654 transitions. [2022-03-15 14:14:04,336 INFO L78 Accepts]: Start accepts. Automaton has 22679 states and 94654 transitions. Word has length 143 [2022-03-15 14:14:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:14:04,336 INFO L470 AbstractCegarLoop]: Abstraction has 22679 states and 94654 transitions. [2022-03-15 14:14:04,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.625) internal successors, (269), 8 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have 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:14:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 22679 states and 94654 transitions. [2022-03-15 14:14:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-15 14:14:04,382 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:14:04,382 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:14:04,401 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:14:04,595 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:14:04,595 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:14:04,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:14:04,596 INFO L85 PathProgramCache]: Analyzing trace with hash 553266371, now seen corresponding path program 10 times [2022-03-15 14:14:04,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:14:04,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139252213] [2022-03-15 14:14:04,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:14:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:14:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:14:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:14:04,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:14:04,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139252213] [2022-03-15 14:14:04,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139252213] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:14:04,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464971494] [2022-03-15 14:14:04,714 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 14:14:04,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:14:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:14:04,718 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:14:04,719 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:14:04,809 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 14:14:04,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:14:04,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 14:14:04,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:14:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:14:05,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:14:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 14:14:05,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464971494] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:14:05,378 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:14:05,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-03-15 14:14:05,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977956947] [2022-03-15 14:14:05,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:14:05,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 14:14:05,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:14:05,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 14:14:05,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-03-15 14:14:05,380 INFO L87 Difference]: Start difference. First operand 22679 states and 94654 transitions. Second operand has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have 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:14:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:14:05,979 INFO L93 Difference]: Finished difference Result 24058 states and 98308 transitions. [2022-03-15 14:14:05,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 14:14:05,979 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 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:14:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:14:06,054 INFO L225 Difference]: With dead ends: 24058 [2022-03-15 14:14:06,054 INFO L226 Difference]: Without dead ends: 22691 [2022-03-15 14:14:06,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=955, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 14:14:06,056 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 1129 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 14:14:06,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1129 Valid, 1452 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 14:14:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22691 states. [2022-03-15 14:14:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22691 to 22686. [2022-03-15 14:14:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22686 states, 22685 states have (on average 4.172845492616267) internal successors, (94661), 22685 states have internal predecessors, (94661), 0 states have call successors, (0), 0 states have 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:14:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22686 states to 22686 states and 94661 transitions. [2022-03-15 14:14:06,726 INFO L78 Accepts]: Start accepts. Automaton has 22686 states and 94661 transitions. Word has length 148 [2022-03-15 14:14:06,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:14:06,726 INFO L470 AbstractCegarLoop]: Abstraction has 22686 states and 94661 transitions. [2022-03-15 14:14:06,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have 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:14:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 22686 states and 94661 transitions. [2022-03-15 14:14:06,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-03-15 14:14:06,774 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:14:06,774 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:14:06,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 14:14:06,987 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:14:06,987 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:14:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:14:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash 502139116, now seen corresponding path program 11 times [2022-03-15 14:14:06,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:14:06,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755179087] [2022-03-15 14:14:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:14:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:14:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:14:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 14:14:07,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:14:07,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755179087] [2022-03-15 14:14:07,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755179087] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:14:07,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112255412] [2022-03-15 14:14:07,124 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 14:14:07,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:14:07,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:14:07,126 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:14:07,127 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:14:07,232 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 14:14:07,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:14:07,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 14:14:07,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:14:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:14:07,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:14:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 14:14:07,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112255412] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:14:07,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:14:07,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2022-03-15 14:14:07,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392822038] [2022-03-15 14:14:07,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:14:07,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 14:14:07,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:14:07,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 14:14:07,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2022-03-15 14:14:07,796 INFO L87 Difference]: Start difference. First operand 22686 states and 94661 transitions. Second operand has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have 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:14:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:14:09,707 INFO L93 Difference]: Finished difference Result 85789 states and 362636 transitions. [2022-03-15 14:14:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 14:14:09,708 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 0 states have call successors, (0), 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 155 [2022-03-15 14:14:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:14:10,327 INFO L225 Difference]: With dead ends: 85789 [2022-03-15 14:14:10,328 INFO L226 Difference]: Without dead ends: 85789 [2022-03-15 14:14:10,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=858, Invalid=2682, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 14:14:10,329 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 1430 mSDsluCounter, 3330 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 14:14:10,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1430 Valid, 3210 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 14:14:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85789 states. [2022-03-15 14:14:12,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85789 to 47858. [2022-03-15 14:14:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47858 states, 47857 states have (on average 4.272478425308733) internal successors, (204468), 47857 states have internal predecessors, (204468), 0 states have call successors, (0), 0 states have 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:14:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47858 states to 47858 states and 204468 transitions. [2022-03-15 14:14:12,506 INFO L78 Accepts]: Start accepts. Automaton has 47858 states and 204468 transitions. Word has length 155 [2022-03-15 14:14:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:14:12,506 INFO L470 AbstractCegarLoop]: Abstraction has 47858 states and 204468 transitions. [2022-03-15 14:14:12,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have 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:14:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 47858 states and 204468 transitions. [2022-03-15 14:14:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-15 14:14:12,630 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:14:12,630 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:14:12,649 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:14:12,843 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:14:12,843 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:14:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:14:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1458780785, now seen corresponding path program 12 times [2022-03-15 14:14:12,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:14:12,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788982008] [2022-03-15 14:14:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:14:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:14:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:14:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 14:14:12,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:14:12,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788982008] [2022-03-15 14:14:12,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788982008] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:14:12,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651835346] [2022-03-15 14:14:12,998 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 14:14:12,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:14:12,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:14:13,000 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:14:13,032 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:14:13,342 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 14:14:13,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 14:14:13,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 14:14:13,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:14:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-03-15 14:14:13,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:14:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-03-15 14:14:13,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651835346] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:14:13,878 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:14:13,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-03-15 14:14:13,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692411568] [2022-03-15 14:14:13,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:14:13,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 14:14:13,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:14:13,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 14:14:13,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-03-15 14:14:13,879 INFO L87 Difference]: Start difference. First operand 47858 states and 204468 transitions. Second operand has 19 states, 19 states have (on average 12.789473684210526) internal successors, (243), 19 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have 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:14:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 14:14:15,101 INFO L93 Difference]: Finished difference Result 80479 states and 347149 transitions. [2022-03-15 14:14:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 14:14:15,102 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.789473684210526) internal successors, (243), 19 states have internal predecessors, (243), 0 states have call successors, (0), 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 160 [2022-03-15 14:14:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 14:14:15,452 INFO L225 Difference]: With dead ends: 80479 [2022-03-15 14:14:15,452 INFO L226 Difference]: Without dead ends: 80479 [2022-03-15 14:14:15,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 14:14:15,453 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 722 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 14:14:15,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 2267 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 14:14:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80479 states. [2022-03-15 14:14:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80479 to 67618. [2022-03-15 14:14:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67618 states, 67617 states have (on average 4.315896889835396) internal successors, (291828), 67617 states have internal predecessors, (291828), 0 states have call successors, (0), 0 states have 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:14:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67618 states to 67618 states and 291828 transitions. [2022-03-15 14:14:17,864 INFO L78 Accepts]: Start accepts. Automaton has 67618 states and 291828 transitions. Word has length 160 [2022-03-15 14:14:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 14:14:17,868 INFO L470 AbstractCegarLoop]: Abstraction has 67618 states and 291828 transitions. [2022-03-15 14:14:17,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.789473684210526) internal successors, (243), 19 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have 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:14:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 67618 states and 291828 transitions. [2022-03-15 14:14:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-03-15 14:14:18,362 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 14:14:18,369 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 14:14:18,385 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:14:18,585 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:14:18,585 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 14:14:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 14:14:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1560126616, now seen corresponding path program 13 times [2022-03-15 14:14:18,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 14:14:18,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910100262] [2022-03-15 14:14:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 14:14:18,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 14:14:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:14:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 14:14:18,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 14:14:18,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910100262] [2022-03-15 14:14:18,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910100262] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 14:14:18,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550433328] [2022-03-15 14:14:18,945 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 14:14:18,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 14:14:18,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 14:14:18,946 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 14:14:18,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 14:14:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 14:14:19,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 14:14:19,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 14:14:19,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 14:14:19,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 14:14:19,373 INFO L353 Elim1Store]: treesize reduction 41, result has 6.8 percent of original size [2022-03-15 14:14:19,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 23 [2022-03-15 14:14:19,445 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-15 14:14:19,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 24 [2022-03-15 14:14:19,565 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:14:19,566 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 62 treesize of output 34 [2022-03-15 14:14:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-03-15 14:14:19,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 14:14:48,103 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_746 Int) (v_subst_2 Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_744 Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_742) c_~A~0.base))) (let ((.cse0 (store (store .cse2 c_~A~0.offset v_ArrVal_744) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_746))) (let ((.cse1 (select .cse0 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (< (select .cse0 c_~A~0.offset) .cse1) (<= .cse1 (+ c_~max~0 1)) (not (<= v_ArrVal_744 (+ (select .cse2 c_~A~0.offset) 1))) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1)))))) (<= 2147483647 c_~max~0)) is different from false [2022-03-15 14:14:48,480 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 172 treesize of output 158 [2022-03-15 14:14:48,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:14:48,526 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:14:48,527 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 207 [2022-03-15 14:14:48,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 14:14:48,538 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 14:14:48,538 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 316 treesize of output 296 [2022-03-15 14:14:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 2 not checked. [2022-03-15 14:14:49,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550433328] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 14:14:49,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 14:14:49,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 22] total 51 [2022-03-15 14:14:49,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301799973] [2022-03-15 14:14:49,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 14:14:49,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 14:14:49,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 14:14:49,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 14:14:49,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2217, Unknown=32, NotChecked=96, Total=2550 [2022-03-15 14:14:49,278 INFO L87 Difference]: Start difference. First operand 67618 states and 291828 transitions. Second operand has 51 states, 51 states have (on average 7.392156862745098) internal successors, (377), 51 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have 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:15:27,604 WARN L228 SmtUtils]: Spent 15.72s on a formula simplification. DAG size of input: 62 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 14:15:37,233 WARN L228 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 64 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)