/usr/bin/java -Xmx16000000000 -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-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 11:56:18,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 11:56:18,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 11:56:18,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 11:56:18,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 11:56:18,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 11:56:18,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 11:56:18,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 11:56:18,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 11:56:18,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 11:56:18,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 11:56:18,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 11:56:18,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 11:56:18,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 11:56:18,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 11:56:18,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 11:56:18,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 11:56:18,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 11:56:18,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 11:56:18,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 11:56:18,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 11:56:18,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 11:56:18,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 11:56:18,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 11:56:18,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 11:56:18,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 11:56:18,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 11:56:18,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 11:56:18,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 11:56:18,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 11:56:18,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 11:56:18,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 11:56:18,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 11:56:18,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 11:56:18,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 11:56:18,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 11:56:18,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 11:56:18,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 11:56:18,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 11:56:18,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 11:56:18,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 11:56:18,281 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-Separate.epf [2022-01-18 11:56:18,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 11:56:18,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 11:56:18,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 11:56:18,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 11:56:18,340 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 11:56:18,340 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 11:56:18,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 11:56:18,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 11:56:18,341 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 11:56:18,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 11:56:18,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 11:56:18,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 11:56:18,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 11:56:18,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 11:56:18,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 11:56:18,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 11:56:18,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 11:56:18,342 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 11:56:18,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 11:56:18,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 11:56:18,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 11:56:18,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 11:56:18,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 11:56:18,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 11:56:18,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 11:56:18,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 11:56:18,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 11:56:18,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 11:56:18,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 11:56:18,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 11:56:18,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 11:56:18,343 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 11:56:18,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 11:56:18,343 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 11:56:18,343 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-01-18 11:56:18,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 11:56:18,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 11:56:18,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 11:56:18,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 11:56:18,526 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 11:56:18,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2022-01-18 11:56:18,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c16140e/60af532e7d364fb8bc6ea5c699749bfc/FLAGfcbd4e2f5 [2022-01-18 11:56:18,894 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 11:56:18,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2022-01-18 11:56:18,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c16140e/60af532e7d364fb8bc6ea5c699749bfc/FLAGfcbd4e2f5 [2022-01-18 11:56:19,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c16140e/60af532e7d364fb8bc6ea5c699749bfc [2022-01-18 11:56:19,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 11:56:19,314 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 11:56:19,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 11:56:19,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 11:56:19,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 11:56:19,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@83f280d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19, skipping insertion in model container [2022-01-18 11:56:19,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 11:56:19,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 11:56:19,496 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-bad-dot-product.wvr.c[2865,2878] [2022-01-18 11:56:19,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 11:56:19,515 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 11:56:19,543 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-bad-dot-product.wvr.c[2865,2878] [2022-01-18 11:56:19,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 11:56:19,555 INFO L208 MainTranslator]: Completed translation [2022-01-18 11:56:19,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19 WrapperNode [2022-01-18 11:56:19,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 11:56:19,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 11:56:19,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 11:56:19,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 11:56:19,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,609 INFO L137 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 16, calls inlined = 22, statements flattened = 275 [2022-01-18 11:56:19,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 11:56:19,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 11:56:19,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 11:56:19,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 11:56:19,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 11:56:19,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 11:56:19,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 11:56:19,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 11:56:19,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19" (1/1) ... [2022-01-18 11:56:19,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 11:56:19,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:56:19,677 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-01-18 11:56:19,683 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-01-18 11:56:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 11:56:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 11:56:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 11:56:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 11:56:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 11:56:19,707 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 11:56:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 11:56:19,707 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 11:56:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 11:56:19,708 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 11:56:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 11:56:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 11:56:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 11:56:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 11:56:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 11:56:19,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 11:56:19,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 11:56:19,709 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 11:56:19,775 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 11:56:19,776 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 11:56:20,020 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 11:56:20,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 11:56:20,107 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-18 11:56:20,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 11:56:20 BoogieIcfgContainer [2022-01-18 11:56:20,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 11:56:20,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 11:56:20,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 11:56:20,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 11:56:20,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 11:56:19" (1/3) ... [2022-01-18 11:56:20,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53287357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 11:56:20, skipping insertion in model container [2022-01-18 11:56:20,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:56:19" (2/3) ... [2022-01-18 11:56:20,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53287357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 11:56:20, skipping insertion in model container [2022-01-18 11:56:20,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 11:56:20" (3/3) ... [2022-01-18 11:56:20,114 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product.wvr.c [2022-01-18 11:56:20,117 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 11:56:20,117 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 11:56:20,117 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 11:56:20,117 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 11:56:20,152 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,152 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,152 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,159 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,160 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,161 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,163 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,163 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,165 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,173 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,173 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,173 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,173 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,177 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,177 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,177 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,177 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,177 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,177 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,177 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,177 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,177 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,180 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,180 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,180 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,180 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,180 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,180 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,180 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,181 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,181 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,181 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,181 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,181 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,181 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,181 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,181 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,181 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,181 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,182 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,182 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,182 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,182 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,182 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,182 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,182 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,182 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,183 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,183 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,183 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,183 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,185 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,187 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,187 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,187 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,188 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,189 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,189 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,189 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,189 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,189 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,189 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,190 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,190 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,190 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,190 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,190 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,190 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,190 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,190 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,190 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,190 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,191 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,191 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 11:56:20,193 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-18 11:56:20,221 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 11:56:20,227 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, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 11:56:20,227 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 11:56:20,239 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 242 places, 257 transitions, 538 flow [2022-01-18 11:56:22,373 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 76744 states, 76743 states have (on average 4.128689261561315) internal successors, (316848), 76743 states have internal predecessors, (316848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 76744 states, 76743 states have (on average 4.128689261561315) internal successors, (316848), 76743 states have internal predecessors, (316848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-18 11:56:22,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:56:22,924 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] [2022-01-18 11:56:22,924 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:56:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:56:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash 258024802, now seen corresponding path program 1 times [2022-01-18 11:56:22,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:56:22,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104092738] [2022-01-18 11:56:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:56:22,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:56:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:56:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 11:56:23,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:56:23,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104092738] [2022-01-18 11:56:23,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104092738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:56:23,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:56:23,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 11:56:23,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42777378] [2022-01-18 11:56:23,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:56:23,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 11:56:23,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:56:23,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 11:56:23,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 11:56:23,378 INFO L87 Difference]: Start difference. First operand has 76744 states, 76743 states have (on average 4.128689261561315) internal successors, (316848), 76743 states have internal predecessors, (316848), 0 states have call successors, (0), 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 68.5) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:56:24,455 INFO L93 Difference]: Finished difference Result 76744 states and 291073 transitions. [2022-01-18 11:56:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 11:56:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-01-18 11:56:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:56:24,897 INFO L225 Difference]: With dead ends: 76744 [2022-01-18 11:56:24,897 INFO L226 Difference]: Without dead ends: 68466 [2022-01-18 11:56:24,898 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-01-18 11:56:24,903 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 11:56:24,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 11:56:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68466 states. [2022-01-18 11:56:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68466 to 68466. [2022-01-18 11:56:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68466 states, 68465 states have (on average 3.794303658803768) internal successors, (259777), 68465 states have internal predecessors, (259777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68466 states to 68466 states and 259777 transitions. [2022-01-18 11:56:27,933 INFO L78 Accepts]: Start accepts. Automaton has 68466 states and 259777 transitions. Word has length 137 [2022-01-18 11:56:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:56:27,934 INFO L470 AbstractCegarLoop]: Abstraction has 68466 states and 259777 transitions. [2022-01-18 11:56:27,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 68466 states and 259777 transitions. [2022-01-18 11:56:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-18 11:56:28,078 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:56:28,079 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] [2022-01-18 11:56:28,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 11:56:28,079 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:56:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:56:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash -171729596, now seen corresponding path program 1 times [2022-01-18 11:56:28,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:56:28,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894007109] [2022-01-18 11:56:28,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:56:28,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:56:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:56:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 11:56:28,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:56:28,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894007109] [2022-01-18 11:56:28,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894007109] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:56:28,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:56:28,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 11:56:28,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350897897] [2022-01-18 11:56:28,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:56:28,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 11:56:28,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:56:28,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 11:56:28,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-18 11:56:28,288 INFO L87 Difference]: Start difference. First operand 68466 states and 259777 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:56:28,880 INFO L93 Difference]: Finished difference Result 71044 states and 269586 transitions. [2022-01-18 11:56:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 11:56:28,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-01-18 11:56:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:56:29,436 INFO L225 Difference]: With dead ends: 71044 [2022-01-18 11:56:29,436 INFO L226 Difference]: Without dead ends: 71044 [2022-01-18 11:56:29,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-18 11:56:29,438 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 232 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 691 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-01-18 11:56:29,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 691 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 11:56:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71044 states. [2022-01-18 11:56:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71044 to 71044. [2022-01-18 11:56:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71044 states, 71043 states have (on average 3.7946877243359656) internal successors, (269586), 71043 states have internal predecessors, (269586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71044 states to 71044 states and 269586 transitions. [2022-01-18 11:56:31,743 INFO L78 Accepts]: Start accepts. Automaton has 71044 states and 269586 transitions. Word has length 137 [2022-01-18 11:56:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:56:31,746 INFO L470 AbstractCegarLoop]: Abstraction has 71044 states and 269586 transitions. [2022-01-18 11:56:31,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 71044 states and 269586 transitions. [2022-01-18 11:56:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-18 11:56:31,914 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:56:31,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:56:31,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 11:56:31,915 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:56:31,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:56:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash -21740498, now seen corresponding path program 1 times [2022-01-18 11:56:31,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:56:31,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382579207] [2022-01-18 11:56:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:56:31,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:56:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:56:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 11:56:32,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:56:32,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382579207] [2022-01-18 11:56:32,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382579207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:56:32,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:56:32,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 11:56:32,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436028506] [2022-01-18 11:56:32,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:56:32,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 11:56:32,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:56:32,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 11:56:32,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-18 11:56:32,166 INFO L87 Difference]: Start difference. First operand 71044 states and 269586 transitions. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:56:33,141 INFO L93 Difference]: Finished difference Result 71093 states and 269636 transitions. [2022-01-18 11:56:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 11:56:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2022-01-18 11:56:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:56:33,486 INFO L225 Difference]: With dead ends: 71093 [2022-01-18 11:56:33,486 INFO L226 Difference]: Without dead ends: 71050 [2022-01-18 11:56:33,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2022-01-18 11:56:33,492 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 260 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 11:56:33,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 967 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 11:56:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71050 states. [2022-01-18 11:56:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71050 to 71045. [2022-01-18 11:56:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71045 states, 71044 states have (on average 3.794648386915151) internal successors, (269587), 71044 states have internal predecessors, (269587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71045 states to 71045 states and 269587 transitions. [2022-01-18 11:56:35,976 INFO L78 Accepts]: Start accepts. Automaton has 71045 states and 269587 transitions. Word has length 153 [2022-01-18 11:56:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:56:35,977 INFO L470 AbstractCegarLoop]: Abstraction has 71045 states and 269587 transitions. [2022-01-18 11:56:35,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 71045 states and 269587 transitions. [2022-01-18 11:56:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-18 11:56:36,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:56:36,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 11:56:36,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 11:56:36,157 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:56:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:56:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash -279770929, now seen corresponding path program 1 times [2022-01-18 11:56:36,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:56:36,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098240211] [2022-01-18 11:56:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:56:36,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:56:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:56:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 11:56:36,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:56:36,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098240211] [2022-01-18 11:56:36,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098240211] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:56:36,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374141187] [2022-01-18 11:56:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:56:36,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:56:36,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:56:36,241 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-01-18 11:56:36,243 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-01-18 11:56:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:56:36,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 11:56:36,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:56:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 11:56:36,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:56:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 11:56:36,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374141187] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 11:56:36,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 11:56:36,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 11:56:36,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124634733] [2022-01-18 11:56:36,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:56:36,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 11:56:36,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:56:36,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 11:56:36,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 11:56:36,906 INFO L87 Difference]: Start difference. First operand 71045 states and 269587 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:56:37,737 INFO L93 Difference]: Finished difference Result 73801 states and 280009 transitions. [2022-01-18 11:56:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 11:56:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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-01-18 11:56:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:56:38,152 INFO L225 Difference]: With dead ends: 73801 [2022-01-18 11:56:38,152 INFO L226 Difference]: Without dead ends: 73801 [2022-01-18 11:56:38,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 312 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-01-18 11:56:38,153 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 719 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 11:56:38,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [719 Valid, 538 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 11:56:38,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73801 states. [2022-01-18 11:56:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73801 to 73801. [2022-01-18 11:56:39,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73801 states, 73800 states have (on average 3.794159891598916) internal successors, (280009), 73800 states have internal predecessors, (280009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73801 states to 73801 states and 280009 transitions. [2022-01-18 11:56:40,608 INFO L78 Accepts]: Start accepts. Automaton has 73801 states and 280009 transitions. Word has length 160 [2022-01-18 11:56:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:56:40,609 INFO L470 AbstractCegarLoop]: Abstraction has 73801 states and 280009 transitions. [2022-01-18 11:56:40,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 73801 states and 280009 transitions. [2022-01-18 11:56:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-18 11:56:40,808 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:56:40,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 11:56:40,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-18 11:56:41,025 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-01-18 11:56:41,025 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:56:41,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:56:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1351331201, now seen corresponding path program 1 times [2022-01-18 11:56:41,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:56:41,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614420459] [2022-01-18 11:56:41,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:56:41,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:56:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:56:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 11:56:41,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:56:41,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614420459] [2022-01-18 11:56:41,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614420459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:56:41,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:56:41,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 11:56:41,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646233156] [2022-01-18 11:56:41,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:56:41,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 11:56:41,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:56:41,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 11:56:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 11:56:41,151 INFO L87 Difference]: Start difference. First operand 73801 states and 280009 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:56:42,741 INFO L93 Difference]: Finished difference Result 184567 states and 701610 transitions. [2022-01-18 11:56:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 11:56:42,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2022-01-18 11:56:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:56:43,536 INFO L225 Difference]: With dead ends: 184567 [2022-01-18 11:56:43,537 INFO L226 Difference]: Without dead ends: 184417 [2022-01-18 11:56:43,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-18 11:56:43,537 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 322 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 11:56:43,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 856 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 11:56:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184417 states. [2022-01-18 11:56:47,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184417 to 112782. [2022-01-18 11:56:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112782 states, 112781 states have (on average 3.8007554463961126) internal successors, (428653), 112781 states have internal predecessors, (428653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112782 states to 112782 states and 428653 transitions. [2022-01-18 11:56:48,370 INFO L78 Accepts]: Start accepts. Automaton has 112782 states and 428653 transitions. Word has length 176 [2022-01-18 11:56:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:56:48,370 INFO L470 AbstractCegarLoop]: Abstraction has 112782 states and 428653 transitions. [2022-01-18 11:56:48,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 112782 states and 428653 transitions. [2022-01-18 11:56:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-18 11:56:49,248 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:56:49,249 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 11:56:49,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 11:56:49,249 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:56:49,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:56:49,249 INFO L85 PathProgramCache]: Analyzing trace with hash 293597412, now seen corresponding path program 1 times [2022-01-18 11:56:49,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:56:49,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409570564] [2022-01-18 11:56:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:56:49,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:56:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:56:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:56:49,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:56:49,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409570564] [2022-01-18 11:56:49,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409570564] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:56:49,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:56:49,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 11:56:49,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178827251] [2022-01-18 11:56:49,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:56:49,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 11:56:49,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:56:49,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 11:56:49,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-18 11:56:49,428 INFO L87 Difference]: Start difference. First operand 112782 states and 428653 transitions. Second operand has 12 states, 12 states have (on average 15.25) internal successors, (183), 12 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:56:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:56:51,797 INFO L93 Difference]: Finished difference Result 211935 states and 801287 transitions. [2022-01-18 11:56:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-18 11:56:51,799 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.25) internal successors, (183), 12 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2022-01-18 11:56:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:56:53,307 INFO L225 Difference]: With dead ends: 211935 [2022-01-18 11:56:53,307 INFO L226 Difference]: Without dead ends: 211065 [2022-01-18 11:56:53,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-01-18 11:56:53,309 INFO L933 BasicCegarLoop]: 480 mSDtfsCounter, 1112 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 11:56:53,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1112 Valid, 2288 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-18 11:56:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211065 states. [2022-01-18 11:56:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211065 to 197758. [2022-01-18 11:56:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197758 states, 197757 states have (on average 3.802530378191417) internal successors, (751977), 197757 states have internal predecessors, (751977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:57:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197758 states to 197758 states and 751977 transitions. [2022-01-18 11:57:00,155 INFO L78 Accepts]: Start accepts. Automaton has 197758 states and 751977 transitions. Word has length 183 [2022-01-18 11:57:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:57:00,156 INFO L470 AbstractCegarLoop]: Abstraction has 197758 states and 751977 transitions. [2022-01-18 11:57:00,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.25) internal successors, (183), 12 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:57:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 197758 states and 751977 transitions. [2022-01-18 11:57:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-18 11:57:00,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:57:00,726 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 11:57:00,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 11:57:00,726 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:57:00,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:57:00,726 INFO L85 PathProgramCache]: Analyzing trace with hash -645814564, now seen corresponding path program 1 times [2022-01-18 11:57:00,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:57:00,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220220327] [2022-01-18 11:57:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:57:00,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:57:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:57:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:57:00,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:57:00,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220220327] [2022-01-18 11:57:00,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220220327] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:57:00,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:57:00,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-18 11:57:00,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134748606] [2022-01-18 11:57:00,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:57:00,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-18 11:57:00,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:57:00,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-18 11:57:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2022-01-18 11:57:00,972 INFO L87 Difference]: Start difference. First operand 197758 states and 751977 transitions. Second operand has 19 states, 19 states have (on average 9.631578947368421) internal successors, (183), 19 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:57:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:57:04,485 INFO L93 Difference]: Finished difference Result 266492 states and 1008754 transitions. [2022-01-18 11:57:04,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 11:57:04,486 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.631578947368421) internal successors, (183), 19 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2022-01-18 11:57:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:57:06,254 INFO L225 Difference]: With dead ends: 266492 [2022-01-18 11:57:06,254 INFO L226 Difference]: Without dead ends: 260882 [2022-01-18 11:57:06,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2022-01-18 11:57:06,255 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 2140 mSDsluCounter, 3099 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 3478 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-18 11:57:06,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2140 Valid, 3478 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-18 11:57:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260882 states. [2022-01-18 11:57:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260882 to 241289. [2022-01-18 11:57:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241289 states, 241288 states have (on average 3.7905697755379464) internal successors, (914619), 241288 states have internal predecessors, (914619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:57:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241289 states to 241289 states and 914619 transitions. [2022-01-18 11:57:15,037 INFO L78 Accepts]: Start accepts. Automaton has 241289 states and 914619 transitions. Word has length 183 [2022-01-18 11:57:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:57:15,037 INFO L470 AbstractCegarLoop]: Abstraction has 241289 states and 914619 transitions. [2022-01-18 11:57:15,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.631578947368421) internal successors, (183), 19 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:57:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 241289 states and 914619 transitions. [2022-01-18 11:57:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-18 11:57:16,369 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:57:16,369 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 11:57:16,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 11:57:16,369 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:57:16,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:57:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash -934923376, now seen corresponding path program 2 times [2022-01-18 11:57:16,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:57:16,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119787320] [2022-01-18 11:57:16,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:57:16,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:57:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:57:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:57:16,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:57:16,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119787320] [2022-01-18 11:57:16,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119787320] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 11:57:16,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 11:57:16,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-18 11:57:16,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340218973] [2022-01-18 11:57:16,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 11:57:16,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-18 11:57:16,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:57:16,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-18 11:57:16,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-01-18 11:57:16,680 INFO L87 Difference]: Start difference. First operand 241289 states and 914619 transitions. Second operand has 20 states, 20 states have (on average 9.15) internal successors, (183), 20 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:57:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:57:19,682 INFO L93 Difference]: Finished difference Result 230729 states and 869541 transitions. [2022-01-18 11:57:19,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 11:57:19,682 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.15) internal successors, (183), 20 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2022-01-18 11:57:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:57:21,270 INFO L225 Difference]: With dead ends: 230729 [2022-01-18 11:57:21,271 INFO L226 Difference]: Without dead ends: 227924 [2022-01-18 11:57:21,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=446, Invalid=1534, Unknown=0, NotChecked=0, Total=1980 [2022-01-18 11:57:21,272 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 2187 mSDsluCounter, 3721 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 4049 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 11:57:21,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2187 Valid, 4049 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 11:57:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227924 states. [2022-01-18 11:57:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227924 to 191206. [2022-01-18 11:57:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191206 states, 191205 states have (on average 3.7748803640072173) internal successors, (721776), 191205 states have internal predecessors, (721776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:57:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191206 states to 191206 states and 721776 transitions. [2022-01-18 11:57:29,374 INFO L78 Accepts]: Start accepts. Automaton has 191206 states and 721776 transitions. Word has length 183 [2022-01-18 11:57:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:57:29,375 INFO L470 AbstractCegarLoop]: Abstraction has 191206 states and 721776 transitions. [2022-01-18 11:57:29,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.15) internal successors, (183), 20 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:57:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 191206 states and 721776 transitions. [2022-01-18 11:57:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-18 11:57:30,067 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:57:30,074 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 11:57:30,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 11:57:30,074 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:57:30,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:57:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1573235213, now seen corresponding path program 1 times [2022-01-18 11:57:30,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:57:30,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810742309] [2022-01-18 11:57:30,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:57:30,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:57:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:57:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:57:30,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:57:30,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810742309] [2022-01-18 11:57:30,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810742309] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:57:30,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064799900] [2022-01-18 11:57:30,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:57:30,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:57:30,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:57:30,348 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-01-18 11:57:30,348 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-01-18 11:57:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:57:30,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-18 11:57:30,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:57:31,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 11:57:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:57:31,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:57:31,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 11:57:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:57:31,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064799900] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 11:57:31,510 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 11:57:31,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2022-01-18 11:57:31,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207089788] [2022-01-18 11:57:31,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 11:57:31,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-18 11:57:31,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:57:31,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-18 11:57:31,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2022-01-18 11:57:31,511 INFO L87 Difference]: Start difference. First operand 191206 states and 721776 transitions. Second operand has 30 states, 30 states have (on average 8.066666666666666) internal successors, (242), 30 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-01-18 11:57:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:57:35,682 INFO L93 Difference]: Finished difference Result 292228 states and 1100065 transitions. [2022-01-18 11:57:35,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-18 11:57:35,683 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.066666666666666) internal successors, (242), 30 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 190 [2022-01-18 11:57:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:57:37,547 INFO L225 Difference]: With dead ends: 292228 [2022-01-18 11:57:37,563 INFO L226 Difference]: Without dead ends: 291358 [2022-01-18 11:57:37,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=632, Invalid=2124, Unknown=0, NotChecked=0, Total=2756 [2022-01-18 11:57:37,564 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 3336 mSDsluCounter, 5842 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3336 SdHoareTripleChecker+Valid, 6075 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 11:57:37,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3336 Valid, 6075 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-18 11:57:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291358 states. [2022-01-18 11:57:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291358 to 264308. [2022-01-18 11:57:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264308 states, 264307 states have (on average 3.802040808605145) internal successors, (1004906), 264307 states have internal predecessors, (1004906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:57:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264308 states to 264308 states and 1004906 transitions. [2022-01-18 11:57:47,346 INFO L78 Accepts]: Start accepts. Automaton has 264308 states and 1004906 transitions. Word has length 190 [2022-01-18 11:57:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:57:47,346 INFO L470 AbstractCegarLoop]: Abstraction has 264308 states and 1004906 transitions. [2022-01-18 11:57:47,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.066666666666666) internal successors, (242), 30 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-01-18 11:57:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 264308 states and 1004906 transitions. [2022-01-18 11:57:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-18 11:57:48,121 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:57:48,121 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 11:57:48,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 11:57:48,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-01-18 11:57:48,322 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:57:48,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:57:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash 633823237, now seen corresponding path program 1 times [2022-01-18 11:57:48,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:57:48,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759303307] [2022-01-18 11:57:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:57:48,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:57:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:57:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:57:48,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:57:48,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759303307] [2022-01-18 11:57:48,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759303307] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:57:48,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085783327] [2022-01-18 11:57:48,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:57:48,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:57:48,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:57:48,966 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-01-18 11:57:48,967 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-01-18 11:57:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:57:49,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-18 11:57:49,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:57:49,093 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-01-18 11:57:49,115 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 11:57:49,115 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-01-18 11:57:49,238 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 11:57:49,238 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-01-18 11:57:50,011 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 26 treesize of output 28 [2022-01-18 11:57:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:57:50,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:57:50,855 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_239 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0)) (= |c_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0)) is different from false [2022-01-18 11:57:50,903 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (forall ((v_ArrVal_239 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0))) is different from false [2022-01-18 11:57:50,931 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_239 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0)) (<= c_~size~0 |c_thread1Thread1of1ForFork2_#t~mem2#1|)) is different from false [2022-01-18 11:57:50,941 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 41 treesize of output 25 [2022-01-18 11:57:50,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 11:57:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:57:51,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085783327] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 11:57:51,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 11:57:51,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22, 21] total 68 [2022-01-18 11:57:51,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984681247] [2022-01-18 11:57:51,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 11:57:51,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-18 11:57:51,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:57:51,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-18 11:57:51,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3925, Unknown=3, NotChecked=384, Total=4556 [2022-01-18 11:57:51,657 INFO L87 Difference]: Start difference. First operand 264308 states and 1004906 transitions. Second operand has 68 states, 68 states have (on average 6.779411764705882) internal successors, (461), 68 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:58:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:58:16,050 INFO L93 Difference]: Finished difference Result 713968 states and 2710809 transitions. [2022-01-18 11:58:16,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2022-01-18 11:58:16,051 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 6.779411764705882) internal successors, (461), 68 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2022-01-18 11:58:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:58:21,056 INFO L225 Difference]: With dead ends: 713968 [2022-01-18 11:58:21,056 INFO L226 Difference]: Without dead ends: 713968 [2022-01-18 11:58:21,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 349 SyntacticMatches, 25 SemanticMatches, 253 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 21334 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=6003, Invalid=57258, Unknown=3, NotChecked=1506, Total=64770 [2022-01-18 11:58:21,066 INFO L933 BasicCegarLoop]: 1475 mSDtfsCounter, 8782 mSDsluCounter, 43911 mSDsCounter, 0 mSdLazyCounter, 18176 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8782 SdHoareTripleChecker+Valid, 43637 SdHoareTripleChecker+Invalid, 24254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 18176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5944 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-01-18 11:58:21,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8782 Valid, 43637 Invalid, 24254 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [134 Valid, 18176 Invalid, 0 Unknown, 5944 Unchecked, 6.7s Time] [2022-01-18 11:58:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713968 states. [2022-01-18 11:58:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713968 to 329980. [2022-01-18 11:58:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329980 states, 329979 states have (on average 3.78560150797475) internal successors, (1249169), 329979 states have internal predecessors, (1249169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:58:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329980 states to 329980 states and 1249169 transitions. [2022-01-18 11:58:38,963 INFO L78 Accepts]: Start accepts. Automaton has 329980 states and 1249169 transitions. Word has length 190 [2022-01-18 11:58:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:58:38,963 INFO L470 AbstractCegarLoop]: Abstraction has 329980 states and 1249169 transitions. [2022-01-18 11:58:38,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 6.779411764705882) internal successors, (461), 68 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:58:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 329980 states and 1249169 transitions. [2022-01-18 11:58:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-18 11:58:40,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:58:40,592 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 11:58:40,613 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-01-18 11:58:40,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:58:40,808 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:58:40,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:58:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1055223219, now seen corresponding path program 2 times [2022-01-18 11:58:40,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:58:40,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272033553] [2022-01-18 11:58:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:58:40,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:58:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:58:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:58:41,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:58:41,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272033553] [2022-01-18 11:58:41,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272033553] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:58:41,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838010496] [2022-01-18 11:58:41,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 11:58:41,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:58:41,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:58:41,308 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-01-18 11:58:41,347 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-01-18 11:58:41,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 11:58:41,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 11:58:41,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-18 11:58:41,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:58:41,520 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-01-18 11:58:41,549 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 11:58:41,549 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-01-18 11:58:41,679 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 11:58:41,679 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-01-18 11:58:42,440 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 26 treesize of output 28 [2022-01-18 11:58:42,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 11:58:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:58:42,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:58:43,023 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_283 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_283) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0)) (= |c_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0)) is different from false [2022-01-18 11:58:43,039 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_283 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_283) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0)) (= |c_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-01-18 11:58:43,062 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_283 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_283) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0)) (<= c_~size~0 |c_thread1Thread1of1ForFork2_#t~mem2#1|)) is different from false [2022-01-18 11:58:43,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-01-18 11:58:43,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 11:58:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:58:43,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838010496] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 11:58:43,600 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 11:58:43,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 21] total 54 [2022-01-18 11:58:43,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80295822] [2022-01-18 11:58:43,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 11:58:43,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-18 11:58:43,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:58:43,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-18 11:58:43,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2332, Unknown=3, NotChecked=300, Total=2862 [2022-01-18 11:58:43,602 INFO L87 Difference]: Start difference. First operand 329980 states and 1249169 transitions. Second operand has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:58:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:58:52,638 INFO L93 Difference]: Finished difference Result 493806 states and 1876354 transitions. [2022-01-18 11:58:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-18 11:58:52,638 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 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 190 [2022-01-18 11:58:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:58:55,817 INFO L225 Difference]: With dead ends: 493806 [2022-01-18 11:58:55,817 INFO L226 Difference]: Without dead ends: 493806 [2022-01-18 11:58:55,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 346 SyntacticMatches, 8 SemanticMatches, 95 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1724, Invalid=7027, Unknown=3, NotChecked=558, Total=9312 [2022-01-18 11:58:55,818 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 6393 mSDsluCounter, 9826 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6393 SdHoareTripleChecker+Valid, 9911 SdHoareTripleChecker+Invalid, 5480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2971 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-18 11:58:55,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6393 Valid, 9911 Invalid, 5480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2373 Invalid, 0 Unknown, 2971 Unchecked, 1.0s Time] [2022-01-18 11:58:56,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493806 states. [2022-01-18 11:59:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493806 to 314582. [2022-01-18 11:59:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314582 states, 314581 states have (on average 3.7860646383602314) internal successors, (1191024), 314581 states have internal predecessors, (1191024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:59:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314582 states to 314582 states and 1191024 transitions. [2022-01-18 11:59:08,068 INFO L78 Accepts]: Start accepts. Automaton has 314582 states and 1191024 transitions. Word has length 190 [2022-01-18 11:59:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:59:08,069 INFO L470 AbstractCegarLoop]: Abstraction has 314582 states and 1191024 transitions. [2022-01-18 11:59:08,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:59:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 314582 states and 1191024 transitions. [2022-01-18 11:59:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-18 11:59:09,454 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:59:09,454 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 11:59:09,472 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-01-18 11:59:09,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:59:09,664 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:59:09,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:59:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1544756951, now seen corresponding path program 3 times [2022-01-18 11:59:09,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:59:09,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336588765] [2022-01-18 11:59:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:59:09,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:59:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:59:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:59:09,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:59:09,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336588765] [2022-01-18 11:59:09,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336588765] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:59:09,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14751807] [2022-01-18 11:59:09,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 11:59:09,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:59:09,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:59:09,817 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-01-18 11:59:09,819 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-01-18 11:59:09,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-18 11:59:09,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 11:59:09,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-18 11:59:09,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:59:10,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 11:59:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:59:10,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:59:10,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 11:59:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 11:59:10,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14751807] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 11:59:10,743 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 11:59:10,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2022-01-18 11:59:10,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625195625] [2022-01-18 11:59:10,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 11:59:10,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-18 11:59:10,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:59:10,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-18 11:59:10,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2022-01-18 11:59:10,748 INFO L87 Difference]: Start difference. First operand 314582 states and 1191024 transitions. Second operand has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:59:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 11:59:17,357 INFO L93 Difference]: Finished difference Result 499693 states and 1875937 transitions. [2022-01-18 11:59:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-18 11:59:17,362 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 0 states have call successors, (0), 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 190 [2022-01-18 11:59:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 11:59:20,963 INFO L225 Difference]: With dead ends: 499693 [2022-01-18 11:59:20,963 INFO L226 Difference]: Without dead ends: 488218 [2022-01-18 11:59:20,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=720, Invalid=2472, Unknown=0, NotChecked=0, Total=3192 [2022-01-18 11:59:20,964 INFO L933 BasicCegarLoop]: 578 mSDtfsCounter, 3929 mSDsluCounter, 5675 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3929 SdHoareTripleChecker+Valid, 6019 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 11:59:20,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3929 Valid, 6019 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-18 11:59:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488218 states. [2022-01-18 11:59:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488218 to 256388. [2022-01-18 11:59:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256388 states, 256387 states have (on average 3.7571483733574635) internal successors, (963284), 256387 states have internal predecessors, (963284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:59:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256388 states to 256388 states and 963284 transitions. [2022-01-18 11:59:32,379 INFO L78 Accepts]: Start accepts. Automaton has 256388 states and 963284 transitions. Word has length 190 [2022-01-18 11:59:32,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 11:59:32,379 INFO L470 AbstractCegarLoop]: Abstraction has 256388 states and 963284 transitions. [2022-01-18 11:59:32,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:59:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 256388 states and 963284 transitions. [2022-01-18 11:59:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-18 11:59:33,093 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 11:59:33,093 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-18 11:59:33,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-18 11:59:33,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-18 11:59:33,307 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 11:59:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 11:59:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 106823876, now seen corresponding path program 2 times [2022-01-18 11:59:33,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 11:59:33,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105739479] [2022-01-18 11:59:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 11:59:33,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 11:59:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 11:59:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 11:59:34,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 11:59:34,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105739479] [2022-01-18 11:59:34,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105739479] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 11:59:34,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015530180] [2022-01-18 11:59:34,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 11:59:34,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 11:59:34,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 11:59:34,394 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-01-18 11:59:34,395 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-01-18 11:59:34,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 11:59:34,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 11:59:34,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-18 11:59:34,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 11:59:35,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 11:59:35,444 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-01-18 11:59:35,676 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 11:59:35,677 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 19 treesize of output 19 [2022-01-18 11:59:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 11:59:36,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 11:59:36,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 11:59:36,922 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 11:59:36,922 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 41 treesize of output 41 [2022-01-18 11:59:36,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 11:59:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 11:59:37,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015530180] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 11:59:37,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 11:59:37,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 26, 27] total 82 [2022-01-18 11:59:37,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407516530] [2022-01-18 11:59:37,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 11:59:37,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-01-18 11:59:37,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 11:59:37,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-01-18 11:59:37,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=6184, Unknown=1, NotChecked=158, Total=6642 [2022-01-18 11:59:37,994 INFO L87 Difference]: Start difference. First operand 256388 states and 963284 transitions. Second operand has 82 states, 82 states have (on average 6.121951219512195) internal successors, (502), 82 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 11:59:54,335 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) .cse0)) is different from false [2022-01-18 12:00:14,157 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) .cse0)) is different from false [2022-01-18 12:00:28,331 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~N~0)) (.cse1 (< 1 c_~N~0)) (.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or .cse1 (and .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2) .cse1) .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-01-18 12:00:38,762 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (not (< |c_thread3Thread1of1ForFork1_~j~2#1| |c_thread3Thread1of1ForFork1_#t~mem16#1|)) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) .cse0)) is different from false [2022-01-18 12:00:38,866 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (not (< |c_thread3Thread1of1ForFork1_~j~2#1| |c_thread3Thread1of1ForFork1_#t~mem16#1|)) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) .cse0)) is different from false [2022-01-18 12:00:39,267 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse0 (< 1 c_~N~0)) (.cse1 (and (<= 1 c_~N~0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) (and (or .cse0 .cse1 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse2) (or (not (< |c_thread3Thread1of1ForFork1_~j~2#1| |c_thread3Thread1of1ForFork1_#t~mem16#1|)) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) .cse2 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (not (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse0 .cse1))) is different from false [2022-01-18 12:00:50,718 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse0 (< 1 c_~N~0)) (.cse1 (and (<= 1 c_~N~0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) (and (or .cse0 .cse1 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse2) .cse2 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (not (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse0 .cse1))) is different from false [2022-01-18 12:01:02,195 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) 0) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0) (not (< |c_thread3Thread1of1ForFork1_~i~2#1| c_~N~0))) .cse0)) is different from false [2022-01-18 12:01:22,135 WARN L228 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 94 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 12:01:27,221 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~N~0)) (.cse1 (< 1 c_~N~0)) (.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (not (< |c_thread3Thread1of1ForFork1_~j~2#1| |c_thread3Thread1of1ForFork1_#t~mem16#1|)) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (or .cse1 (and .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2) .cse1) .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-01-18 12:01:42,033 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~N~0)) (.cse1 (< 1 c_~N~0)) (.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or .cse1 (and .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2) .cse1) .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-01-18 12:01:54,520 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~N~0)) (.cse1 (< 1 c_~N~0)) (.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) 0) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0) (not (< |c_thread3Thread1of1ForFork1_~i~2#1| c_~N~0))) (or .cse1 (and .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2) .cse1) .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-01-18 12:02:16,991 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) .cse0 (or (<= (+ |c_thread3Thread1of1ForFork1_~j~2#1| 1) |c_thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)))) is different from false [2022-01-18 12:02:17,002 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~N~0)) (.cse1 (< 1 c_~N~0)) (.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or .cse1 (and .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2) .cse1) .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (<= (+ |c_thread3Thread1of1ForFork1_~j~2#1| 1) |c_thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)))) is different from false [2022-01-18 12:02:17,369 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (<= 1 c_~N~0))) (let ((.cse1 (and .cse3 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse0 (<= (+ c_~M~0 1) 0)) (.cse2 (< 1 c_~N~0)) (.cse4 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or .cse0 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse1 .cse2) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse1 .cse2 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse0) .cse3) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse4) (or .cse2 (and .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse3) .cse2) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse4 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (<= (+ |c_thread3Thread1of1ForFork1_~j~2#1| 1) |c_thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0))))) is different from false [2022-01-18 12:02:23,457 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (<= 1 c_~N~0))) (let ((.cse1 (and .cse3 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse0 (<= (+ c_~M~0 1) 0)) (.cse2 (< 1 c_~N~0)) (.cse4 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or .cse0 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse1 .cse2) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse1 .cse2 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse0) .cse3) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse4) (or .cse2 (and .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse3) .cse2) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse4 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2022-01-18 12:02:27,667 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_~A~0.base)) (.cse11 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4)))) (let ((.cse10 (select .cse9 .cse11)) (.cse7 (<= 1 c_~N~0))) (let ((.cse5 (and .cse7 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse6 (< 1 c_~N~0)) (.cse8 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse3 (<= (+ c_~M~0 1) 0)) (.cse4 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (.cse0 (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (.cse1 (= 0 .cse11)) (.cse2 (<= 2 .cse10))) (and (or .cse0 (and (= |c_thread3Thread1of1ForFork1_~j~2#1| 0) .cse1 .cse2)) (or .cse3 .cse4) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse5 .cse6) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse5 .cse6 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse3) .cse7) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse8) .cse0 (or .cse6 (and .cse7 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse7) .cse6) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse8 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse3 (and (not (= (select .cse9 0) 1)) (<= c_~M~0 0) .cse4)) (or .cse0 (and (not (= |c_thread3Thread1of1ForFork1_#t~mem14#1| 1)) .cse1 (= |c_thread3Thread1of1ForFork1_#t~mem14#1| .cse10))) (or .cse0 (and (= |c_thread3Thread1of1ForFork1_#t~post15#1| 0) .cse1 .cse2)))))) is different from false [2022-01-18 12:02:56,778 WARN L228 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 12:03:59,005 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_~A~0.base)) (.cse11 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4)))) (let ((.cse10 (select .cse9 .cse11)) (.cse7 (<= 1 c_~N~0))) (let ((.cse5 (and .cse7 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse6 (< 1 c_~N~0)) (.cse8 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse3 (<= (+ c_~M~0 1) 0)) (.cse4 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (.cse0 (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (.cse1 (= 0 .cse11)) (.cse2 (<= 2 .cse10))) (and (or .cse0 (and (= |c_thread3Thread1of1ForFork1_~j~2#1| 0) .cse1 .cse2)) (or .cse3 .cse4) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse5 .cse6) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse5 .cse6 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse3) .cse7) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse8) .cse0 (or .cse6 (and .cse7 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_#t~post13#1| 2) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse7) .cse6) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse8 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse3 (and (not (= (select .cse9 0) 1)) (<= c_~M~0 0) .cse4)) (or .cse0 (and (not (= |c_thread3Thread1of1ForFork1_#t~mem14#1| 1)) .cse1 (= |c_thread3Thread1of1ForFork1_#t~mem14#1| .cse10))) (or .cse0 (and (= |c_thread3Thread1of1ForFork1_#t~post15#1| 0) .cse1 .cse2)))))) is different from false [2022-01-18 12:04:10,548 WARN L228 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 102 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 12:04:15,470 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (<= 1 c_~N~0))) (let ((.cse2 (and .cse4 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse3 (< 1 c_~N~0)) (.cse5 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse0 (<= (+ c_~M~0 1) 0)) (.cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)))) (and (or .cse0 .cse1) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse2 .cse3) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse2 .cse3 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse0) .cse4) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse5) (or .cse3 (and .cse4 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_#t~post13#1| 2) c_~N~0) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse4) .cse3) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse5 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse0 (and (not (= (select (select |c_#memory_int| c_~A~0.base) 0) 1)) (<= c_~M~0 0) .cse1))))) is different from false [2022-01-18 12:04:40,775 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (<= 1 c_~N~0))) (let ((.cse2 (and .cse4 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse3 (< 1 c_~N~0)) (.cse5 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse0 (<= (+ c_~M~0 1) 0)) (.cse6 (select |c_#memory_int| c_~A~0.base)) (.cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)))) (and (or .cse0 .cse1) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse2 .cse3) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse2 .cse3 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse0) .cse4) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse5) (or (<= (select .cse6 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) 0) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0) (not (< |c_thread3Thread1of1ForFork1_~i~2#1| c_~N~0))) (or .cse3 (and .cse4 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse4) .cse3) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse5 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse0 (and (not (= (select .cse6 0) 1)) (<= c_~M~0 0) .cse1))))) is different from false [2022-01-18 12:07:19,368 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) 0) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0) (not (< |c_thread3Thread1of1ForFork1_~i~2#1| c_~N~0))) (or (< 1 c_~N~0) (and (<= 1 c_~N~0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-01-18 12:07:19,377 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (< 1 c_~N~0) (and (<= 1 c_~N~0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-01-18 12:07:31,340 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (<= 1 c_~N~0))) (let ((.cse1 (and .cse3 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse0 (<= (+ c_~M~0 1) 0)) (.cse2 (< 1 c_~N~0)) (.cse4 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or .cse0 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse1 .cse2) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse1 .cse2 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse0) .cse3) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse4) (or .cse2 (and .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse4 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2022-01-18 12:08:02,734 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse2 (<= 1 c_~N~0)) (.cse1 (< 1 c_~N~0))) (and (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< (+ |c_thread1Thread1of1ForFork2_#t~post1#1| 1) c_~N~0) .cse0) (or (not (< |c_thread3Thread1of1ForFork1_~j~2#1| |c_thread3Thread1of1ForFork1_#t~mem16#1|)) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (or .cse1 (and .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0))) .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (< (+ |c_thread1Thread1of1ForFork2_~i~0#1| 1) c_~N~0) .cse0) (or (and .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) .cse1))) is different from false [2022-01-18 12:08:04,881 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (.cse1 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse3 (<= 1 c_~N~0)) (.cse2 (< 1 c_~N~0))) (and (or (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) 0) .cse0) (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< (+ |c_thread1Thread1of1ForFork2_#t~post1#1| 1) c_~N~0) .cse1) (or .cse2 (and .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0))) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (<= (+ |c_thread3Thread1of1ForFork1_~j~2#1| 1) |c_thread3Thread1of1ForFork1_#t~mem16#1|) .cse0) (or (< (+ |c_thread1Thread1of1ForFork2_~i~0#1| 1) c_~N~0) .cse1) (or (and .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) .cse2))) is different from false Received shutdown request... [2022-01-18 12:08:17,064 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 12:08:17,065 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 12:08:17,125 WARN L244 SmtUtils]: Removed 11 from assertion stack [2022-01-18 12:08:17,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1138 states. [2022-01-18 12:08:17,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1808 GetRequests, 434 SyntacticMatches, 169 SemanticMatches, 1204 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 770382 ImplicationChecksByTransitivity, 451.4s TimeCoverageRelationStatistics Valid=129489, Invalid=1263813, Unknown=378, NotChecked=59550, Total=1453230 [2022-01-18 12:08:17,218 INFO L933 BasicCegarLoop]: 3198 mSDtfsCounter, 19400 mSDsluCounter, 176220 mSDsCounter, 0 mSdLazyCounter, 55422 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19400 SdHoareTripleChecker+Valid, 172607 SdHoareTripleChecker+Invalid, 136929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 55422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81298 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2022-01-18 12:08:17,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19400 Valid, 172607 Invalid, 136929 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [209 Valid, 55422 Invalid, 0 Unknown, 81298 Unchecked, 22.3s Time] [2022-01-18 12:08:17,219 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-18 12:08:17,235 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-01-18 12:08:17,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:08:17,420 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (256388states) and FLOYD_HOARE automaton (currently 1138 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 75 for 1573ms.. [2022-01-18 12:08:17,421 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-18 12:08:17,421 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-18 12:08:17,421 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-18 12:08:17,423 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-01-18 12:08:17,425 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 12:08:17,425 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 12:08:17,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 12:08:17 BasicIcfg [2022-01-18 12:08:17,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 12:08:17,427 INFO L158 Benchmark]: Toolchain (without parser) took 718113.76ms. Allocated memory was 383.8MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 333.5MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 7.3GB. Max. memory is 16.0GB. [2022-01-18 12:08:17,427 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 383.8MB. Free memory is still 349.8MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 12:08:17,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.82ms. Allocated memory is still 383.8MB. Free memory was 333.4MB in the beginning and 353.1MB in the end (delta: -19.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2022-01-18 12:08:17,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.09ms. Allocated memory is still 383.8MB. Free memory was 353.1MB in the beginning and 350.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 12:08:17,428 INFO L158 Benchmark]: Boogie Preprocessor took 38.91ms. Allocated memory is still 383.8MB. Free memory was 350.0MB in the beginning and 347.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 12:08:17,428 INFO L158 Benchmark]: RCFGBuilder took 459.70ms. Allocated memory is still 383.8MB. Free memory was 347.9MB in the beginning and 315.4MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2022-01-18 12:08:17,428 INFO L158 Benchmark]: TraceAbstraction took 717317.38ms. Allocated memory was 383.8MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 315.4MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 7.3GB. Max. memory is 16.0GB. [2022-01-18 12:08:17,429 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 383.8MB. Free memory is still 349.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 240.82ms. Allocated memory is still 383.8MB. Free memory was 333.4MB in the beginning and 353.1MB in the end (delta: -19.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.09ms. Allocated memory is still 383.8MB. Free memory was 353.1MB in the beginning and 350.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.91ms. Allocated memory is still 383.8MB. Free memory was 350.0MB in the beginning and 347.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 459.70ms. Allocated memory is still 383.8MB. Free memory was 347.9MB in the beginning and 315.4MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 717317.38ms. Allocated memory was 383.8MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 315.4MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 7.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (256388states) and FLOYD_HOARE automaton (currently 1138 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 75 for 1573ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (256388states) and FLOYD_HOARE automaton (currently 1138 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 75 for 1573ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (256388states) and FLOYD_HOARE automaton (currently 1138 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 75 for 1573ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (256388states) and FLOYD_HOARE automaton (currently 1138 states, 82 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 75 for 1573ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 314 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 717.2s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 9.2s, AutomataDifference: 598.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48812 SdHoareTripleChecker+Valid, 33.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48812 mSDsluCounter, 251333 SdHoareTripleChecker+Invalid, 27.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 90213 IncrementalHoareTripleChecker+Unchecked, 252329 mSDsCounter, 561 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81816 IncrementalHoareTripleChecker+Invalid, 172590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 561 mSolverCounterUnsat, 8903 mSDtfsCounter, 81816 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4197 GetRequests, 2188 SyntacticMatches, 206 SemanticMatches, 1802 ConstructedPredicates, 31 IntricatePredicates, 2 DeprecatedPredicates, 795753 ImplicationChecksByTransitivity, 470.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329980occurred in iteration=10, InterpolantAutomatonStates: 407, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 90.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 963350 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 3386 NumberOfCodeBlocks, 3386 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 4478 ConstructedInterpolants, 49 QuantifiedInterpolants, 26901 SizeOfPredicates, 122 NumberOfNonLiveVariables, 2504 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 110/139 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown