/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-15 11:47:43,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 11:47:43,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 11:47:43,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 11:47:43,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 11:47:43,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 11:47:43,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 11:47:43,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 11:47:43,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 11:47:43,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 11:47:43,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 11:47:43,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 11:47:43,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 11:47:43,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 11:47:43,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 11:47:43,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 11:47:43,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 11:47:43,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 11:47:43,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 11:47:43,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 11:47:43,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 11:47:43,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 11:47:43,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 11:47:43,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 11:47:43,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 11:47:43,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 11:47:43,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 11:47:43,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 11:47:43,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 11:47:43,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 11:47:43,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 11:47:43,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 11:47:43,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 11:47:43,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 11:47:43,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 11:47:43,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 11:47:43,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 11:47:43,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 11:47:43,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 11:47:43,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 11:47:43,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 11:47:43,462 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-15 11:47:43,482 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 11:47:43,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 11:47:43,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-15 11:47:43,483 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-15 11:47:43,483 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-15 11:47:43,483 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-15 11:47:43,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-15 11:47:43,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-15 11:47:43,484 INFO L138 SettingsManager]: * Use SBE=true [2022-02-15 11:47:43,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 11:47:43,484 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 11:47:43,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 11:47:43,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 11:47:43,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 11:47:43,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 11:47:43,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 11:47:43,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 11:47:43,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 11:47:43,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 11:47:43,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 11:47:43,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 11:47:43,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 11:47:43,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 11:47:43,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 11:47:43,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 11:47:43,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 11:47:43,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 11:47:43,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-15 11:47:43,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-15 11:47:43,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 11:47:43,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-15 11:47:43,486 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-15 11:47:43,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 11:47:43,486 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-02-15 11:47:43,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 11:47:43,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 11:47:43,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 11:47:43,704 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 11:47:43,718 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 11:47:43,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-02-15 11:47:43,771 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5645342d/1a55118767d4408ab9930c83bef0436b/FLAG91d2c2c60 [2022-02-15 11:47:44,098 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 11:47:44,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-02-15 11:47:44,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5645342d/1a55118767d4408ab9930c83bef0436b/FLAG91d2c2c60 [2022-02-15 11:47:44,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5645342d/1a55118767d4408ab9930c83bef0436b [2022-02-15 11:47:44,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 11:47:44,523 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 11:47:44,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 11:47:44,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 11:47:44,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 11:47:44,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e869eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44, skipping insertion in model container [2022-02-15 11:47:44,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 11:47:44,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 11:47:44,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-02-15 11:47:44,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 11:47:44,768 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 11:47:44,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-02-15 11:47:44,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 11:47:44,816 INFO L208 MainTranslator]: Completed translation [2022-02-15 11:47:44,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44 WrapperNode [2022-02-15 11:47:44,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 11:47:44,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-15 11:47:44,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-15 11:47:44,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-15 11:47:44,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,849 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-02-15 11:47:44,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-15 11:47:44,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 11:47:44,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 11:47:44,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 11:47:44,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 11:47:44,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 11:47:44,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 11:47:44,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 11:47:44,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44" (1/1) ... [2022-02-15 11:47:44,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 11:47:44,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:47:44,924 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-02-15 11:47:44,927 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-02-15 11:47:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 11:47:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-15 11:47:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 11:47:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 11:47:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-15 11:47:44,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-15 11:47:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-15 11:47:44,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-15 11:47:44,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-15 11:47:44,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-15 11:47:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-02-15 11:47:44,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-02-15 11:47:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 11:47:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-15 11:47:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-15 11:47:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-15 11:47:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 11:47:44,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 11:47:44,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 11:47:44,977 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-15 11:47:45,035 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 11:47:45,036 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 11:47:45,313 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 11:47:45,378 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 11:47:45,378 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-15 11:47:45,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:47:45 BoogieIcfgContainer [2022-02-15 11:47:45,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 11:47:45,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 11:47:45,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 11:47:45,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 11:47:45,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 11:47:44" (1/3) ... [2022-02-15 11:47:45,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475aeb44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:47:45, skipping insertion in model container [2022-02-15 11:47:45,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:47:44" (2/3) ... [2022-02-15 11:47:45,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475aeb44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:47:45, skipping insertion in model container [2022-02-15 11:47:45,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:47:45" (3/3) ... [2022-02-15 11:47:45,390 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2022-02-15 11:47:45,398 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-15 11:47:45,398 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-15 11:47:45,398 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 11:47:45,399 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-15 11:47:45,432 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,432 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,432 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,433 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,433 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,433 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,433 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,433 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,433 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,433 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,434 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,434 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,434 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,434 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,434 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,434 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,434 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,435 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,435 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,435 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,435 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,435 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,436 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,436 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,436 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,436 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,436 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,436 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,437 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,437 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,437 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,437 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,437 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,437 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,437 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,438 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,438 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,438 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,438 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,438 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,438 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,438 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,438 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,439 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,439 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,440 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,441 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,441 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,441 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,441 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,441 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,441 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,441 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,441 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,441 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,446 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,446 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,446 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,447 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,447 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,447 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,449 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,450 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,450 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,450 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,450 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,450 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,450 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,450 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,451 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,451 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,452 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,452 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,452 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,452 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,452 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,452 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,452 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,453 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,453 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,453 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,453 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,453 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,453 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:47:45,457 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-02-15 11:47:45,489 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 11:47:45,494 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-15 11:47:45,494 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-15 11:47:45,504 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 172 transitions, 376 flow [2022-02-15 11:47:46,372 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-15 11:47:46,712 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:47:46,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:47:46,714 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:47:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:47:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1420994164, now seen corresponding path program 1 times [2022-02-15 11:47:46,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:47:46,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715625352] [2022-02-15 11:47:46,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:47:46,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:47:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:47:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:47:46,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:47:46,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715625352] [2022-02-15 11:47:46,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715625352] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:47:46,960 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:47:46,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-15 11:47:46,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336416630] [2022-02-15 11:47:46,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:47:46,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-15 11:47:46,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:47:46,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-15 11:47:46,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-15 11:47:47,047 INFO L87 Difference]: Start difference. First operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:47:47,566 INFO L93 Difference]: Finished difference Result 26140 states and 111710 transitions. [2022-02-15 11:47:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-15 11:47:47,569 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-02-15 11:47:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:47:47,885 INFO L225 Difference]: With dead ends: 26140 [2022-02-15 11:47:47,886 INFO L226 Difference]: Without dead ends: 26136 [2022-02-15 11:47:47,887 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-02-15 11:47:47,889 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:47:47,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 11:47:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26136 states. [2022-02-15 11:47:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26136 to 26136. [2022-02-15 11:47:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26136 states, 26135 states have (on average 4.274191696958102) internal successors, (111706), 26135 states have internal predecessors, (111706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26136 states to 26136 states and 111706 transitions. [2022-02-15 11:47:49,262 INFO L78 Accepts]: Start accepts. Automaton has 26136 states and 111706 transitions. Word has length 121 [2022-02-15 11:47:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:47:49,262 INFO L470 AbstractCegarLoop]: Abstraction has 26136 states and 111706 transitions. [2022-02-15 11:47:49,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 26136 states and 111706 transitions. [2022-02-15 11:47:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-15 11:47:49,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:47:49,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:47:49,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 11:47:49,380 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:47:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:47:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -507464182, now seen corresponding path program 1 times [2022-02-15 11:47:49,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:47:49,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336137649] [2022-02-15 11:47:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:47:49,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:47:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:47:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:47:49,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:47:49,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336137649] [2022-02-15 11:47:49,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336137649] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:47:49,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:47:49,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 11:47:49,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963536734] [2022-02-15 11:47:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:47:49,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 11:47:49,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:47:49,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 11:47:49,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-15 11:47:49,608 INFO L87 Difference]: Start difference. First operand 26136 states and 111706 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:50,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:47:50,098 INFO L93 Difference]: Finished difference Result 35136 states and 150562 transitions. [2022-02-15 11:47:50,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 11:47:50,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-02-15 11:47:50,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:47:50,414 INFO L225 Difference]: With dead ends: 35136 [2022-02-15 11:47:50,414 INFO L226 Difference]: Without dead ends: 35136 [2022-02-15 11:47:50,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-02-15 11:47:50,416 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 352 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:47:50,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 319 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 11:47:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35136 states. [2022-02-15 11:47:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35136 to 28386. [2022-02-15 11:47:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28386 states, 28385 states have (on average 4.277611414479479) internal successors, (121420), 28385 states have internal predecessors, (121420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28386 states to 28386 states and 121420 transitions. [2022-02-15 11:47:51,671 INFO L78 Accepts]: Start accepts. Automaton has 28386 states and 121420 transitions. Word has length 121 [2022-02-15 11:47:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:47:51,671 INFO L470 AbstractCegarLoop]: Abstraction has 28386 states and 121420 transitions. [2022-02-15 11:47:51,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 28386 states and 121420 transitions. [2022-02-15 11:47:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-15 11:47:51,761 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:47:51,761 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:47:51,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 11:47:51,761 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:47:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:47:51,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1313580435, now seen corresponding path program 1 times [2022-02-15 11:47:51,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:47:51,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230068807] [2022-02-15 11:47:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:47:51,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:47:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:47:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:47:51,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:47:51,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230068807] [2022-02-15 11:47:51,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230068807] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:47:51,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:47:51,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 11:47:51,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110875128] [2022-02-15 11:47:51,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:47:51,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 11:47:51,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:47:51,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 11:47:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-15 11:47:51,849 INFO L87 Difference]: Start difference. First operand 28386 states and 121420 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:47:52,426 INFO L93 Difference]: Finished difference Result 37401 states and 158042 transitions. [2022-02-15 11:47:52,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 11:47:52,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-02-15 11:47:52,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:47:52,700 INFO L225 Difference]: With dead ends: 37401 [2022-02-15 11:47:52,700 INFO L226 Difference]: Without dead ends: 28392 [2022-02-15 11:47:52,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-15 11:47:52,705 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 425 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:47:52,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 475 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 11:47:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28392 states. [2022-02-15 11:47:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28392 to 28387. [2022-02-15 11:47:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28387 states, 28386 states have (on average 4.277495948707109) internal successors, (121421), 28386 states have internal predecessors, (121421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28387 states to 28387 states and 121421 transitions. [2022-02-15 11:47:53,762 INFO L78 Accepts]: Start accepts. Automaton has 28387 states and 121421 transitions. Word has length 126 [2022-02-15 11:47:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:47:53,762 INFO L470 AbstractCegarLoop]: Abstraction has 28387 states and 121421 transitions. [2022-02-15 11:47:53,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 28387 states and 121421 transitions. [2022-02-15 11:47:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-02-15 11:47:53,861 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:47:53,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:47:53,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 11:47:53,861 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:47:53,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:47:53,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1766570838, now seen corresponding path program 1 times [2022-02-15 11:47:53,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:47:53,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344910202] [2022-02-15 11:47:53,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:47:53,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:47:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:47:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:47:53,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:47:53,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344910202] [2022-02-15 11:47:53,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344910202] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:47:53,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897072608] [2022-02-15 11:47:53,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:47:53,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:47:53,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:47:54,001 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-02-15 11:47:54,002 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-02-15 11:47:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:47:54,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-15 11:47:54,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:47:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:47:54,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:47:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:47:54,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897072608] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 11:47:54,619 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 11:47:54,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-02-15 11:47:54,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603599125] [2022-02-15 11:47:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:47:54,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 11:47:54,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:47:54,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 11:47:54,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-02-15 11:47:54,620 INFO L87 Difference]: Start difference. First operand 28387 states and 121421 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:47:55,097 INFO L93 Difference]: Finished difference Result 30943 states and 132410 transitions. [2022-02-15 11:47:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 11:47:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-02-15 11:47:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:47:55,239 INFO L225 Difference]: With dead ends: 30943 [2022-02-15 11:47:55,239 INFO L226 Difference]: Without dead ends: 30943 [2022-02-15 11:47:55,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-02-15 11:47:55,240 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 280 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:47:55,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 368 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 11:47:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2022-02-15 11:47:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 30943. [2022-02-15 11:47:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30943 states, 30942 states have (on average 4.279296748755737) internal successors, (132410), 30942 states have internal predecessors, (132410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30943 states to 30943 states and 132410 transitions. [2022-02-15 11:47:56,338 INFO L78 Accepts]: Start accepts. Automaton has 30943 states and 132410 transitions. Word has length 133 [2022-02-15 11:47:56,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:47:56,339 INFO L470 AbstractCegarLoop]: Abstraction has 30943 states and 132410 transitions. [2022-02-15 11:47:56,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 30943 states and 132410 transitions. [2022-02-15 11:47:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-02-15 11:47:56,422 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:47:56,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:47:56,444 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-02-15 11:47:56,643 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-02-15 11:47:56,643 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:47:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:47:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1027911653, now seen corresponding path program 1 times [2022-02-15 11:47:56,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:47:56,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561140006] [2022-02-15 11:47:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:47:56,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:47:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:47:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:47:56,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:47:56,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561140006] [2022-02-15 11:47:56,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561140006] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:47:56,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968132605] [2022-02-15 11:47:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:47:56,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:47:56,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:47:56,750 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-02-15 11:47:56,763 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-02-15 11:47:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:47:56,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-15 11:47:56,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:47:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:47:57,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:47:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:47:57,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968132605] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 11:47:57,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 11:47:57,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-02-15 11:47:57,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546373276] [2022-02-15 11:47:57,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:47:57,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 11:47:57,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:47:57,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 11:47:57,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-02-15 11:47:57,541 INFO L87 Difference]: Start difference. First operand 30943 states and 132410 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:47:57,850 INFO L93 Difference]: Finished difference Result 34267 states and 146807 transitions. [2022-02-15 11:47:57,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 11:47:57,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-02-15 11:47:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:47:57,992 INFO L225 Difference]: With dead ends: 34267 [2022-02-15 11:47:57,992 INFO L226 Difference]: Without dead ends: 34267 [2022-02-15 11:47:57,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 268 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-02-15 11:47:57,993 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 240 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:47:57,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 410 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 11:47:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34267 states. [2022-02-15 11:47:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34267 to 34267. [2022-02-15 11:47:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34267 states, 34266 states have (on average 4.284334325570536) internal successors, (146807), 34266 states have internal predecessors, (146807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34267 states to 34267 states and 146807 transitions. [2022-02-15 11:47:59,102 INFO L78 Accepts]: Start accepts. Automaton has 34267 states and 146807 transitions. Word has length 138 [2022-02-15 11:47:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:47:59,103 INFO L470 AbstractCegarLoop]: Abstraction has 34267 states and 146807 transitions. [2022-02-15 11:47:59,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:47:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 34267 states and 146807 transitions. [2022-02-15 11:47:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-15 11:47:59,438 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:47:59,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:47:59,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-15 11:47:59,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:47:59,656 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:47:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:47:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash 334563494, now seen corresponding path program 1 times [2022-02-15 11:47:59,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:47:59,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095742263] [2022-02-15 11:47:59,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:47:59,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:47:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:48:00,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:00,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095742263] [2022-02-15 11:48:00,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095742263] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:00,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503040700] [2022-02-15 11:48:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:00,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:00,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:00,038 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-02-15 11:48:00,039 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-02-15 11:48:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:00,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-15 11:48:00,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:48:00,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-15 11:48:00,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-15 11:48:00,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:48:00,643 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-02-15 11:48:00,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-15 11:48:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:00,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:48:01,037 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-02-15 11:48:01,139 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse2)) (.cse3 (+ .cse0 1))) (and (or .cse1 (<= .cse2 .cse3)) (or (not .cse1) (<= c_~min~0 .cse3)))))))) is different from false [2022-02-15 11:48:01,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (+ .cse0 1)) (.cse2 (< c_~min~0 .cse3))) (and (or (<= c_~min~0 .cse1) (not .cse2)) (or (<= .cse3 .cse1) .cse2))))))) is different from false [2022-02-15 11:48:01,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-02-15 11:48:01,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-02-15 11:48:01,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (or (<= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-02-15 11:48:01,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= 2147483647 .cse0) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ .cse0 1)))))) is different from false [2022-02-15 11:48:01,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= 2147483647 .cse0) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse0 1)))))) is different from false [2022-02-15 11:48:01,315 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:48:01,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 48 [2022-02-15 11:48:01,320 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 383 treesize of output 343 [2022-02-15 11:48:01,327 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 86 treesize of output 80 [2022-02-15 11:48:01,330 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 77 treesize of output 65 [2022-02-15 11:48:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-02-15 11:48:01,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503040700] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:48:01,646 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:48:01,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 45 [2022-02-15 11:48:01,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430921971] [2022-02-15 11:48:01,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:48:01,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-02-15 11:48:01,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:01,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-02-15 11:48:01,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1225, Unknown=8, NotChecked=616, Total=1980 [2022-02-15 11:48:01,648 INFO L87 Difference]: Start difference. First operand 34267 states and 146807 transitions. Second operand has 45 states, 45 states have (on average 8.444444444444445) internal successors, (380), 45 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:48:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:08,939 INFO L93 Difference]: Finished difference Result 342390 states and 1478395 transitions. [2022-02-15 11:48:08,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-15 11:48:08,939 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 8.444444444444445) internal successors, (380), 45 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-02-15 11:48:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:10,275 INFO L225 Difference]: With dead ends: 342390 [2022-02-15 11:48:10,275 INFO L226 Difference]: Without dead ends: 194157 [2022-02-15 11:48:10,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 259 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1208, Invalid=4366, Unknown=8, NotChecked=1224, Total=6806 [2022-02-15 11:48:10,277 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1962 mSDsluCounter, 5657 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 5862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3847 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 11:48:10,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1962 Valid, 5481 Invalid, 5862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1938 Invalid, 0 Unknown, 3847 Unchecked, 0.9s Time] [2022-02-15 11:48:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194157 states. [2022-02-15 11:48:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194157 to 35973. [2022-02-15 11:48:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35973 states, 35972 states have (on average 4.2384910485933505) internal successors, (152467), 35972 states have internal predecessors, (152467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:48:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35973 states to 35973 states and 152467 transitions. [2022-02-15 11:48:14,907 INFO L78 Accepts]: Start accepts. Automaton has 35973 states and 152467 transitions. Word has length 143 [2022-02-15 11:48:14,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:14,907 INFO L470 AbstractCegarLoop]: Abstraction has 35973 states and 152467 transitions. [2022-02-15 11:48:14,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 8.444444444444445) internal successors, (380), 45 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:48:14,907 INFO L276 IsEmpty]: Start isEmpty. Operand 35973 states and 152467 transitions. [2022-02-15 11:48:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-15 11:48:15,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:15,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:48:15,021 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-02-15 11:48:15,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:15,219 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:48:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash 940179670, now seen corresponding path program 2 times [2022-02-15 11:48:15,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:15,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429921564] [2022-02-15 11:48:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:15,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:48:15,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:15,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429921564] [2022-02-15 11:48:15,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429921564] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:15,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164610827] [2022-02-15 11:48:15,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:48:15,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:15,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:15,700 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-02-15 11:48:15,702 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-02-15 11:48:15,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:48:15,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:48:15,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-15 11:48:15,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:48:15,835 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-02-15 11:48:15,870 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-15 11:48:15,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-15 11:48:16,042 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:48:16,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-15 11:48:16,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:48:16,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-15 11:48:16,819 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-02-15 11:48:16,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-15 11:48:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:48:16,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:48:17,167 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-02-15 11:48:17,198 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-02-15 11:48:17,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse2)) (.cse3 (+ .cse0 1))) (and (or .cse1 (<= .cse2 .cse3)) (or (not .cse1) (<= c_~min~0 .cse3)))))))) is different from false [2022-02-15 11:48:17,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (+ .cse3 1)) (.cse0 (< c_~min~0 .cse1))) (and (or .cse0 (<= .cse1 .cse2)) (or (<= c_~min~0 .cse2) (not .cse0))))) (<= 2147483647 .cse3)))) is different from false [2022-02-15 11:48:17,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 215 [2022-02-15 11:48:17,365 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 207 treesize of output 199 [2022-02-15 11:48:17,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 183 [2022-02-15 11:48:17,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-15 11:48:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-02-15 11:48:17,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164610827] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:48:17,955 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:48:17,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 48 [2022-02-15 11:48:17,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599101237] [2022-02-15 11:48:17,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:48:17,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-02-15 11:48:17,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:17,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-02-15 11:48:17,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1711, Unknown=4, NotChecked=348, Total=2256 [2022-02-15 11:48:17,957 INFO L87 Difference]: Start difference. First operand 35973 states and 152467 transitions. Second operand has 48 states, 48 states have (on average 7.25) internal successors, (348), 48 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:48:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:34,758 INFO L93 Difference]: Finished difference Result 498918 states and 2148451 transitions. [2022-02-15 11:48:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-02-15 11:48:34,759 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 7.25) internal successors, (348), 48 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-02-15 11:48:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:48:36,978 INFO L225 Difference]: With dead ends: 498918 [2022-02-15 11:48:36,978 INFO L226 Difference]: Without dead ends: 302240 [2022-02-15 11:48:36,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 263 SyntacticMatches, 7 SemanticMatches, 170 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8592 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=6074, Invalid=21994, Unknown=4, NotChecked=1340, Total=29412 [2022-02-15 11:48:36,984 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 2755 mSDsluCounter, 4763 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2755 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 5812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2985 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:48:36,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2755 Valid, 4573 Invalid, 5812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 2644 Invalid, 0 Unknown, 2985 Unchecked, 1.4s Time] [2022-02-15 11:48:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302240 states. [2022-02-15 11:48:42,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302240 to 36184. [2022-02-15 11:48:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36184 states, 36183 states have (on average 4.237625404195341) internal successors, (153330), 36183 states have internal predecessors, (153330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:48:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36184 states to 36184 states and 153330 transitions. [2022-02-15 11:48:43,478 INFO L78 Accepts]: Start accepts. Automaton has 36184 states and 153330 transitions. Word has length 143 [2022-02-15 11:48:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:48:43,478 INFO L470 AbstractCegarLoop]: Abstraction has 36184 states and 153330 transitions. [2022-02-15 11:48:43,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 7.25) internal successors, (348), 48 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:48:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 36184 states and 153330 transitions. [2022-02-15 11:48:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-15 11:48:43,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:48:43,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:48:43,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-15 11:48:43,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:43,779 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:48:43,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:48:43,780 INFO L85 PathProgramCache]: Analyzing trace with hash -263687870, now seen corresponding path program 3 times [2022-02-15 11:48:43,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:48:43,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611401735] [2022-02-15 11:48:43,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:48:43,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:48:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:48:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:44,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:48:44,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611401735] [2022-02-15 11:48:44,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611401735] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:48:44,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018190926] [2022-02-15 11:48:44,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 11:48:44,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:48:44,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:48:44,235 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-02-15 11:48:44,235 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-02-15 11:48:44,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-15 11:48:44,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:48:44,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-15 11:48:44,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:48:45,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:48:45,016 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-02-15 11:48:45,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:48:45,068 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-02-15 11:48:45,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-15 11:48:45,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:48:45,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-15 11:48:45,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-15 11:48:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:48:45,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:48:46,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-02-15 11:48:46,130 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_279 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 .cse2 v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 .cse2) (+ v_ArrVal_278 1))))))) is different from false [2022-02-15 11:48:46,174 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_279 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1))) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2022-02-15 11:48:46,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-02-15 11:48:46,310 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-02-15 11:48:46,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse4 (select .cse5 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse3)) (.cse2 (+ .cse0 1))) (and (or (not .cse1) (<= c_~min~0 .cse2)) (or .cse1 (<= .cse3 .cse2))))) (not (<= (select .cse4 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-02-15 11:48:46,735 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse5 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse5 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (+ .cse0 1)) (.cse2 (< c_~min~0 .cse3))) (and (or .cse2 (<= .cse3 .cse4)) (or (<= c_~min~0 .cse4) (not .cse2)))))))))) is different from false [2022-02-15 11:48:46,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 279 [2022-02-15 11:48:46,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 203 [2022-02-15 11:48:46,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-02-15 11:48:46,837 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 58 treesize of output 54 [2022-02-15 11:48:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-02-15 11:48:47,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018190926] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:48:47,641 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:48:47,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 55 [2022-02-15 11:48:47,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818675658] [2022-02-15 11:48:47,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:48:47,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-02-15 11:48:47,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:48:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-02-15 11:48:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2058, Unknown=7, NotChecked=686, Total=2970 [2022-02-15 11:48:47,643 INFO L87 Difference]: Start difference. First operand 36184 states and 153330 transitions. Second operand has 55 states, 55 states have (on average 6.363636363636363) internal successors, (350), 55 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:48:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:48:58,052 INFO L93 Difference]: Finished difference Result 401922 states and 1744153 transitions. [2022-02-15 11:48:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-15 11:48:58,053 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 6.363636363636363) internal successors, (350), 55 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-02-15 11:48:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:00,025 INFO L225 Difference]: With dead ends: 401922 [2022-02-15 11:49:00,026 INFO L226 Difference]: Without dead ends: 274414 [2022-02-15 11:49:00,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 253 SyntacticMatches, 12 SemanticMatches, 116 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2625, Invalid=9606, Unknown=7, NotChecked=1568, Total=13806 [2022-02-15 11:49:00,028 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 4056 mSDsluCounter, 6138 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4056 SdHoareTripleChecker+Valid, 6113 SdHoareTripleChecker+Invalid, 7407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4873 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-15 11:49:00,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4056 Valid, 6113 Invalid, 7407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2264 Invalid, 0 Unknown, 4873 Unchecked, 1.3s Time] [2022-02-15 11:49:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274414 states. [2022-02-15 11:49:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274414 to 35948. [2022-02-15 11:49:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35948 states, 35947 states have (on average 4.235346482321195) internal successors, (152248), 35947 states have internal predecessors, (152248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35948 states to 35948 states and 152248 transitions. [2022-02-15 11:49:05,368 INFO L78 Accepts]: Start accepts. Automaton has 35948 states and 152248 transitions. Word has length 143 [2022-02-15 11:49:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:05,369 INFO L470 AbstractCegarLoop]: Abstraction has 35948 states and 152248 transitions. [2022-02-15 11:49:05,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.363636363636363) internal successors, (350), 55 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 35948 states and 152248 transitions. [2022-02-15 11:49:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-15 11:49:06,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:06,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:49:06,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-15 11:49:06,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:06,217 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:49:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:06,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1870998198, now seen corresponding path program 4 times [2022-02-15 11:49:06,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:06,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433799415] [2022-02-15 11:49:06,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:06,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 11:49:06,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:06,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433799415] [2022-02-15 11:49:06,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433799415] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:49:06,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:49:06,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 11:49:06,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813534440] [2022-02-15 11:49:06,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:49:06,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 11:49:06,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:06,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 11:49:06,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 11:49:06,319 INFO L87 Difference]: Start difference. First operand 35948 states and 152248 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:06,749 INFO L93 Difference]: Finished difference Result 51353 states and 219409 transitions. [2022-02-15 11:49:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 11:49:06,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-02-15 11:49:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:06,886 INFO L225 Difference]: With dead ends: 51353 [2022-02-15 11:49:06,886 INFO L226 Difference]: Without dead ends: 32549 [2022-02-15 11:49:06,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-15 11:49:06,887 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:49:06,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 698 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 11:49:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32549 states. [2022-02-15 11:49:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32549 to 32426. [2022-02-15 11:49:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32426 states, 32425 states have (on average 4.1830377794911335) internal successors, (135635), 32425 states have internal predecessors, (135635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32426 states to 32426 states and 135635 transitions. [2022-02-15 11:49:08,273 INFO L78 Accepts]: Start accepts. Automaton has 32426 states and 135635 transitions. Word has length 143 [2022-02-15 11:49:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:08,274 INFO L470 AbstractCegarLoop]: Abstraction has 32426 states and 135635 transitions. [2022-02-15 11:49:08,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32426 states and 135635 transitions. [2022-02-15 11:49:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-15 11:49:08,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:08,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:49:08,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 11:49:08,358 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:49:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash -342153556, now seen corresponding path program 5 times [2022-02-15 11:49:08,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:08,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25257987] [2022-02-15 11:49:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:08,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:49:08,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:08,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25257987] [2022-02-15 11:49:08,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25257987] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:08,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899476439] [2022-02-15 11:49:08,466 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-15 11:49:08,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:08,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:08,480 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-02-15 11:49:08,481 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-02-15 11:49:08,585 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-15 11:49:08,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:49:08,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-15 11:49:08,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:08,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-15 11:49:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:49:08,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:49:09,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899476439] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:09,259 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:09,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 9] total 23 [2022-02-15 11:49:09,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228956261] [2022-02-15 11:49:09,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:09,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-15 11:49:09,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:09,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-15 11:49:09,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-02-15 11:49:09,260 INFO L87 Difference]: Start difference. First operand 32426 states and 135635 transitions. Second operand has 23 states, 23 states have (on average 11.73913043478261) internal successors, (270), 23 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:13,243 INFO L93 Difference]: Finished difference Result 268223 states and 1151796 transitions. [2022-02-15 11:49:13,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-02-15 11:49:13,243 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.73913043478261) internal successors, (270), 23 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-02-15 11:49:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:14,204 INFO L225 Difference]: With dead ends: 268223 [2022-02-15 11:49:14,204 INFO L226 Difference]: Without dead ends: 119321 [2022-02-15 11:49:14,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1185, Invalid=3927, Unknown=0, NotChecked=0, Total=5112 [2022-02-15 11:49:14,207 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 1601 mSDsluCounter, 3858 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 3900 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 11:49:14,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1601 Valid, 3900 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 11:49:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119321 states. [2022-02-15 11:49:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119321 to 36452. [2022-02-15 11:49:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36452 states, 36451 states have (on average 4.1564017448080985) internal successors, (151505), 36451 states have internal predecessors, (151505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36452 states to 36452 states and 151505 transitions. [2022-02-15 11:49:16,661 INFO L78 Accepts]: Start accepts. Automaton has 36452 states and 151505 transitions. Word has length 143 [2022-02-15 11:49:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:16,661 INFO L470 AbstractCegarLoop]: Abstraction has 36452 states and 151505 transitions. [2022-02-15 11:49:16,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.73913043478261) internal successors, (270), 23 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 36452 states and 151505 transitions. [2022-02-15 11:49:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-15 11:49:16,757 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:16,757 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:49:16,775 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-02-15 11:49:16,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:16,975 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:49:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:16,976 INFO L85 PathProgramCache]: Analyzing trace with hash 627705186, now seen corresponding path program 6 times [2022-02-15 11:49:16,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:16,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839286908] [2022-02-15 11:49:16,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:16,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:17,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:17,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839286908] [2022-02-15 11:49:17,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839286908] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:17,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184906290] [2022-02-15 11:49:17,685 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-15 11:49:17,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:17,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:17,700 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:49:17,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-15 11:49:17,828 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-15 11:49:17,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:49:17,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-15 11:49:17,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:17,860 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-02-15 11:49:17,893 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-15 11:49:17,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-15 11:49:17,940 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:49:17,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-15 11:49:18,159 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-02-15 11:49:18,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-15 11:49:18,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-15 11:49:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:18,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:18,818 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_392 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_392) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 2))) (<= 2147483647 c_~max~0)) is different from false [2022-02-15 11:49:18,846 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 27 treesize of output 19 [2022-02-15 11:49:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-02-15 11:49:18,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184906290] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:18,991 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:18,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 39 [2022-02-15 11:49:18,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515520327] [2022-02-15 11:49:18,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:18,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-15 11:49:18,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:18,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-15 11:49:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1254, Unknown=1, NotChecked=72, Total=1482 [2022-02-15 11:49:18,993 INFO L87 Difference]: Start difference. First operand 36452 states and 151505 transitions. Second operand has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:23,922 INFO L93 Difference]: Finished difference Result 234838 states and 1000648 transitions. [2022-02-15 11:49:23,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-15 11:49:23,922 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-02-15 11:49:23,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:24,771 INFO L225 Difference]: With dead ends: 234838 [2022-02-15 11:49:24,771 INFO L226 Difference]: Without dead ends: 165746 [2022-02-15 11:49:24,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 278 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1713 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1443, Invalid=5532, Unknown=1, NotChecked=164, Total=7140 [2022-02-15 11:49:24,772 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 2567 mSDsluCounter, 5725 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 5652 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 11:49:24,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2567 Valid, 5652 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1676 Invalid, 0 Unknown, 559 Unchecked, 0.8s Time] [2022-02-15 11:49:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165746 states. [2022-02-15 11:49:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165746 to 36165. [2022-02-15 11:49:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36165 states, 36164 states have (on average 4.155375511558456) internal successors, (150275), 36164 states have internal predecessors, (150275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36165 states to 36165 states and 150275 transitions. [2022-02-15 11:49:28,127 INFO L78 Accepts]: Start accepts. Automaton has 36165 states and 150275 transitions. Word has length 143 [2022-02-15 11:49:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:28,127 INFO L470 AbstractCegarLoop]: Abstraction has 36165 states and 150275 transitions. [2022-02-15 11:49:28,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 36165 states and 150275 transitions. [2022-02-15 11:49:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-15 11:49:28,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:28,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:49:28,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-15 11:49:28,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:28,841 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:49:28,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash 296544674, now seen corresponding path program 7 times [2022-02-15 11:49:28,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:28,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753945118] [2022-02-15 11:49:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:28,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:29,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:29,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753945118] [2022-02-15 11:49:29,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753945118] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:29,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940128000] [2022-02-15 11:49:29,074 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-15 11:49:29,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:29,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:29,079 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:49:29,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-15 11:49:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:29,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-15 11:49:29,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:29,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:49:29,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-15 11:49:29,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-15 11:49:29,510 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:29,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-02-15 11:49:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:29,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:32,568 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_441 Int) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_439 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_439) c_~A~0.base))) (let ((.cse0 (select (store .cse1 c_~A~0.offset v_ArrVal_441) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< v_ArrVal_441 .cse0) (<= .cse0 (+ c_~max~0 1)) (not (<= (+ v_ArrVal_441 1) (select .cse1 c_~A~0.offset))))))) (<= 2147483647 c_~max~0)) is different from false [2022-02-15 11:49:32,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2022-02-15 11:49:32,671 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:32,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 88 [2022-02-15 11:49:32,679 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:49:32,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 119 [2022-02-15 11:49:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-02-15 11:49:32,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940128000] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:32,932 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:32,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2022-02-15 11:49:32,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405595879] [2022-02-15 11:49:32,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:32,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-15 11:49:32,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:32,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-15 11:49:32,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1261, Unknown=5, NotChecked=72, Total=1482 [2022-02-15 11:49:32,935 INFO L87 Difference]: Start difference. First operand 36165 states and 150275 transitions. Second operand has 39 states, 39 states have (on average 8.333333333333334) internal successors, (325), 39 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:34,371 INFO L93 Difference]: Finished difference Result 63383 states and 265670 transitions. [2022-02-15 11:49:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-15 11:49:34,372 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 8.333333333333334) internal successors, (325), 39 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-02-15 11:49:34,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:34,541 INFO L225 Difference]: With dead ends: 63383 [2022-02-15 11:49:34,542 INFO L226 Difference]: Without dead ends: 36325 [2022-02-15 11:49:34,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=478, Invalid=2713, Unknown=5, NotChecked=110, Total=3306 [2022-02-15 11:49:34,543 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 1183 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 524 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 11:49:34,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1183 Valid, 3574 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 745 Invalid, 0 Unknown, 524 Unchecked, 0.3s Time] [2022-02-15 11:49:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36325 states. [2022-02-15 11:49:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36325 to 35765. [2022-02-15 11:49:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35765 states, 35764 states have (on average 4.158231741415949) internal successors, (148715), 35764 states have internal predecessors, (148715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35765 states to 35765 states and 148715 transitions. [2022-02-15 11:49:36,196 INFO L78 Accepts]: Start accepts. Automaton has 35765 states and 148715 transitions. Word has length 143 [2022-02-15 11:49:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:36,196 INFO L470 AbstractCegarLoop]: Abstraction has 35765 states and 148715 transitions. [2022-02-15 11:49:36,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.333333333333334) internal successors, (325), 39 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 35765 states and 148715 transitions. [2022-02-15 11:49:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-15 11:49:36,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:36,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:49:36,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-15 11:49:36,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-15 11:49:36,532 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:49:36,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:36,533 INFO L85 PathProgramCache]: Analyzing trace with hash 929095160, now seen corresponding path program 8 times [2022-02-15 11:49:36,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:36,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485181884] [2022-02-15 11:49:36,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:36,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:36,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:36,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485181884] [2022-02-15 11:49:36,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485181884] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:36,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190807604] [2022-02-15 11:49:36,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:49:36,873 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:36,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:36,874 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:49:36,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-15 11:49:36,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:49:36,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:49:36,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-15 11:49:36,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:37,014 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-02-15 11:49:37,042 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-15 11:49:37,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-15 11:49:37,241 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-15 11:49:37,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-02-15 11:49:37,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-15 11:49:37,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-15 11:49:38,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-15 11:49:38,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-15 11:49:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:49:38,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:38,609 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)))) is different from false [2022-02-15 11:49:38,660 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (or (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 .cse1 v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (not (<= (+ v_ArrVal_489 1) (select .cse0 .cse1))))))) is different from false [2022-02-15 11:49:38,679 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (or (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (not (<= (+ v_ArrVal_489 1) (select .cse0 c_~A~0.offset))))))) is different from false [2022-02-15 11:49:38,726 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_488))) (let ((.cse0 (select .cse1 c_~A~0.base))) (or (not (<= (+ v_ArrVal_489 1) (select .cse0 c_~A~0.offset))) (<= (select (select (store (store .cse1 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))))))) is different from false [2022-02-15 11:49:38,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 81 [2022-02-15 11:49:38,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-02-15 11:49:38,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-02-15 11:49:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-02-15 11:49:39,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190807604] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:39,051 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:39,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 45 [2022-02-15 11:49:39,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557934171] [2022-02-15 11:49:39,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:39,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-02-15 11:49:39,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:39,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-02-15 11:49:39,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1498, Unknown=4, NotChecked=324, Total=1980 [2022-02-15 11:49:39,053 INFO L87 Difference]: Start difference. First operand 35765 states and 148715 transitions. Second operand has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:44,517 INFO L93 Difference]: Finished difference Result 210264 states and 905061 transitions. [2022-02-15 11:49:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-02-15 11:49:44,517 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-02-15 11:49:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:45,167 INFO L225 Difference]: With dead ends: 210264 [2022-02-15 11:49:45,169 INFO L226 Difference]: Without dead ends: 107328 [2022-02-15 11:49:45,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 263 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1826, Invalid=6196, Unknown=4, NotChecked=716, Total=8742 [2022-02-15 11:49:45,170 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 2789 mSDsluCounter, 5579 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2789 SdHoareTripleChecker+Valid, 5619 SdHoareTripleChecker+Invalid, 4155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2043 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 11:49:45,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2789 Valid, 5619 Invalid, 4155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1967 Invalid, 0 Unknown, 2043 Unchecked, 0.8s Time] [2022-02-15 11:49:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107328 states. [2022-02-15 11:49:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107328 to 30968. [2022-02-15 11:49:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30968 states, 30967 states have (on average 4.143798236832757) internal successors, (128321), 30967 states have internal predecessors, (128321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30968 states to 30968 states and 128321 transitions. [2022-02-15 11:49:47,399 INFO L78 Accepts]: Start accepts. Automaton has 30968 states and 128321 transitions. Word has length 143 [2022-02-15 11:49:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:47,400 INFO L470 AbstractCegarLoop]: Abstraction has 30968 states and 128321 transitions. [2022-02-15 11:49:47,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 30968 states and 128321 transitions. [2022-02-15 11:49:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-15 11:49:47,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:47,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:49:47,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-15 11:49:48,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-15 11:49:48,071 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:49:48,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:48,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1049396362, now seen corresponding path program 9 times [2022-02-15 11:49:48,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:48,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996677472] [2022-02-15 11:49:48,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:48,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 11:49:48,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:48,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996677472] [2022-02-15 11:49:48,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996677472] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:48,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919013004] [2022-02-15 11:49:48,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 11:49:48,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:48,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:48,172 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:49:48,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-15 11:49:48,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-15 11:49:48,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:49:48,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-15 11:49:48,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 11:49:48,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 11:49:48,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919013004] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:48,774 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:48,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-02-15 11:49:48,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841791791] [2022-02-15 11:49:48,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:48,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 11:49:48,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 11:49:48,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-15 11:49:48,775 INFO L87 Difference]: Start difference. First operand 30968 states and 128321 transitions. Second operand has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:49,132 INFO L93 Difference]: Finished difference Result 41375 states and 173574 transitions. [2022-02-15 11:49:49,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 11:49:49,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-02-15 11:49:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:49,236 INFO L225 Difference]: With dead ends: 41375 [2022-02-15 11:49:49,236 INFO L226 Difference]: Without dead ends: 24774 [2022-02-15 11:49:49,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-15 11:49:49,237 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 54 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:49:49,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 799 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 11:49:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24774 states. [2022-02-15 11:49:50,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24774 to 24764. [2022-02-15 11:49:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24764 states, 24763 states have (on average 4.126277106974115) internal successors, (102179), 24763 states have internal predecessors, (102179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24764 states to 24764 states and 102179 transitions. [2022-02-15 11:49:50,571 INFO L78 Accepts]: Start accepts. Automaton has 24764 states and 102179 transitions. Word has length 143 [2022-02-15 11:49:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:50,571 INFO L470 AbstractCegarLoop]: Abstraction has 24764 states and 102179 transitions. [2022-02-15 11:49:50,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 24764 states and 102179 transitions. [2022-02-15 11:49:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-15 11:49:50,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:50,647 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:49:50,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-15 11:49:50,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-15 11:49:50,864 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:49:50,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash 225436057, now seen corresponding path program 10 times [2022-02-15 11:49:50,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:50,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039733903] [2022-02-15 11:49:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:50,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:49:50,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:50,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039733903] [2022-02-15 11:49:50,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039733903] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:50,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395215710] [2022-02-15 11:49:50,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-15 11:49:50,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:50,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:50,987 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:49:50,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-15 11:49:51,086 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-15 11:49:51,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:49:51,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-15 11:49:51,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:49:51,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:49:51,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395215710] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:51,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:51,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-02-15 11:49:51,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977506936] [2022-02-15 11:49:51,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:51,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-15 11:49:51,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:51,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-15 11:49:51,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-02-15 11:49:51,642 INFO L87 Difference]: Start difference. First operand 24764 states and 102179 transitions. Second operand has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:52,116 INFO L93 Difference]: Finished difference Result 26364 states and 106354 transitions. [2022-02-15 11:49:52,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-15 11:49:52,116 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-02-15 11:49:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:52,198 INFO L225 Difference]: With dead ends: 26364 [2022-02-15 11:49:52,198 INFO L226 Difference]: Without dead ends: 24776 [2022-02-15 11:49:52,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=955, Unknown=0, NotChecked=0, Total=1260 [2022-02-15 11:49:52,201 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 1074 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:49:52,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1074 Valid, 1520 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 11:49:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24776 states. [2022-02-15 11:49:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24776 to 24771. [2022-02-15 11:49:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24771 states, 24770 states have (on average 4.125393621316108) internal successors, (102186), 24770 states have internal predecessors, (102186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24771 states to 24771 states and 102186 transitions. [2022-02-15 11:49:52,890 INFO L78 Accepts]: Start accepts. Automaton has 24771 states and 102186 transitions. Word has length 148 [2022-02-15 11:49:52,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:52,891 INFO L470 AbstractCegarLoop]: Abstraction has 24771 states and 102186 transitions. [2022-02-15 11:49:52,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 24771 states and 102186 transitions. [2022-02-15 11:49:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-02-15 11:49:53,127 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:53,127 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:49:53,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-15 11:49:53,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-15 11:49:53,343 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:49:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash 174308802, now seen corresponding path program 11 times [2022-02-15 11:49:53,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:53,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786169143] [2022-02-15 11:49:53,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:53,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:53,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-15 11:49:53,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:53,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786169143] [2022-02-15 11:49:53,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786169143] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:53,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035967417] [2022-02-15 11:49:53,458 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-15 11:49:53,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:53,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:53,460 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:49:53,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-15 11:49:53,565 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-15 11:49:53,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:49:53,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-15 11:49:53,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-15 11:49:53,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-15 11:49:53,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035967417] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:53,992 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:53,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-02-15 11:49:53,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55215288] [2022-02-15 11:49:53,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:53,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-15 11:49:53,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:53,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-15 11:49:53,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-02-15 11:49:53,993 INFO L87 Difference]: Start difference. First operand 24771 states and 102186 transitions. Second operand has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:54,788 INFO L93 Difference]: Finished difference Result 40910 states and 170712 transitions. [2022-02-15 11:49:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-15 11:49:54,789 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-02-15 11:49:54,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:55,145 INFO L225 Difference]: With dead ends: 40910 [2022-02-15 11:49:55,146 INFO L226 Difference]: Without dead ends: 40910 [2022-02-15 11:49:55,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2022-02-15 11:49:55,146 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 1009 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 2549 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 11:49:55,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1009 Valid, 2549 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 11:49:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40910 states. [2022-02-15 11:49:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40910 to 34779. [2022-02-15 11:49:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34779 states, 34778 states have (on average 4.162574041060441) internal successors, (144766), 34778 states have internal predecessors, (144766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34779 states to 34779 states and 144766 transitions. [2022-02-15 11:49:56,303 INFO L78 Accepts]: Start accepts. Automaton has 34779 states and 144766 transitions. Word has length 155 [2022-02-15 11:49:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:49:56,303 INFO L470 AbstractCegarLoop]: Abstraction has 34779 states and 144766 transitions. [2022-02-15 11:49:56,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 34779 states and 144766 transitions. [2022-02-15 11:49:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-02-15 11:49:56,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:49:56,407 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:49:56,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-15 11:49:56,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-15 11:49:56,624 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:49:56,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:49:56,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1506013595, now seen corresponding path program 12 times [2022-02-15 11:49:56,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:49:56,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92061487] [2022-02-15 11:49:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:49:56,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:49:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:49:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-15 11:49:56,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:49:56,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92061487] [2022-02-15 11:49:56,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92061487] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:49:56,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406379977] [2022-02-15 11:49:56,764 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-15 11:49:56,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:49:56,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:49:56,776 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:49:56,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-15 11:49:56,977 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-15 11:49:56,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:49:56,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-15 11:49:56,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:49:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-15 11:49:57,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:49:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-15 11:49:57,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406379977] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:49:57,675 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:49:57,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-02-15 11:49:57,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304455222] [2022-02-15 11:49:57,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:49:57,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-15 11:49:57,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:49:57,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-15 11:49:57,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-02-15 11:49:57,676 INFO L87 Difference]: Start difference. First operand 34779 states and 144766 transitions. Second operand has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:49:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:49:58,657 INFO L93 Difference]: Finished difference Result 59610 states and 250107 transitions. [2022-02-15 11:49:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-15 11:49:58,657 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-02-15 11:49:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:49:59,224 INFO L225 Difference]: With dead ends: 59610 [2022-02-15 11:49:59,224 INFO L226 Difference]: Without dead ends: 59610 [2022-02-15 11:49:59,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-02-15 11:49:59,225 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 939 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 11:49:59,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [939 Valid, 1927 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 11:49:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59610 states. [2022-02-15 11:50:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59610 to 49659. [2022-02-15 11:50:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49659 states, 49658 states have (on average 4.2040758790124455) internal successors, (208766), 49658 states have internal predecessors, (208766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:50:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49659 states to 49659 states and 208766 transitions. [2022-02-15 11:50:01,265 INFO L78 Accepts]: Start accepts. Automaton has 49659 states and 208766 transitions. Word has length 160 [2022-02-15 11:50:01,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:50:01,265 INFO L470 AbstractCegarLoop]: Abstraction has 49659 states and 208766 transitions. [2022-02-15 11:50:01,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:50:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 49659 states and 208766 transitions. [2022-02-15 11:50:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-02-15 11:50:01,428 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:50:01,428 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:50:01,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-02-15 11:50:01,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-15 11:50:01,641 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-15 11:50:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:50:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1462933140, now seen corresponding path program 13 times [2022-02-15 11:50:01,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:50:01,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361448247] [2022-02-15 11:50:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:50:01,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:50:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:50:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-15 11:50:01,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:50:01,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361448247] [2022-02-15 11:50:01,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361448247] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:50:01,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934462854] [2022-02-15 11:50:01,960 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-15 11:50:01,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:50:01,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:50:01,961 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:50:01,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-15 11:50:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:50:02,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-15 11:50:02,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:50:02,109 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-02-15 11:50:02,136 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-15 11:50:02,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-15 11:50:02,169 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-15 11:50:02,169 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 16 treesize of output 22 [2022-02-15 11:50:02,693 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-02-15 11:50:02,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-02-15 11:50:03,274 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 34 treesize of output 32 [2022-02-15 11:50:03,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:50:03,359 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 34 treesize of output 32 [2022-02-15 11:50:03,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-15 11:50:03,475 INFO L353 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2022-02-15 11:50:03,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 65 [2022-02-15 11:50:03,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:50:03,609 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 25 treesize of output 24 [2022-02-15 11:50:03,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-15 11:50:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-15 11:50:03,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:50:05,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))))) is different from false [2022-02-15 11:50:18,560 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_746 1))) (<= c_~min~0 (+ .cse0 1)) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1))))) is different from false [2022-02-15 11:50:18,777 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_746 1))) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2022-02-15 11:50:19,820 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse2 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 (+ .cse0 1)))) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse2 c_~A~0.offset) (+ v_ArrVal_746 1))))))) is different from false [2022-02-15 11:50:24,934 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse8 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse6 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse2 (+ .cse0 1)) (.cse3 (< c_~min~0 .cse6))) (and (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 .cse2))) (not .cse3)) (or (and (forall ((v_subst_2 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse5 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (< (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) .cse5) (<= .cse5 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1)))))) (or (<= .cse6 .cse2) (forall ((v_subst_1 Int)) (not (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (< (select .cse7 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) (select .cse7 (+ c_~A~0.offset (* 4 v_subst_1))))))))) .cse3)))) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse8 c_~A~0.offset) (+ v_ArrVal_746 1))))))) is different from false [2022-02-15 11:50:28,771 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse8 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (+ .cse0 1)) (.cse3 (< c_~min~0 .cse4))) (and (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 .cse2))) (not .cse3)) (or (and (or (<= .cse4 .cse2) (forall ((v_subst_1 Int)) (not (let ((.cse5 (select |c_#memory_int| c_~A~0.base))) (< (select .cse5 c_~A~0.offset) (select .cse5 (+ c_~A~0.offset (* 4 v_subst_1)))))))) (forall ((v_subst_2 Int)) (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (let ((.cse6 (select .cse7 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (<= .cse6 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1)) (< (select .cse7 c_~A~0.offset) .cse6)))))) .cse3)))) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse8 c_~A~0.offset) (+ v_ArrVal_746 1))))))) is different from false [2022-02-15 11:50:31,457 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 880 treesize of output 824 [2022-02-15 11:50:31,481 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 980 treesize of output 972 [2022-02-15 11:50:31,488 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 1050 treesize of output 1046 [2022-02-15 11:50:31,506 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:50:31,506 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 1124 treesize of output 1016 [2022-02-15 11:50:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 8 not checked. [2022-02-15 11:50:32,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934462854] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:50:32,621 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:50:32,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 24] total 56 [2022-02-15 11:50:32,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649501006] [2022-02-15 11:50:32,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:50:32,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-02-15 11:50:32,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:50:32,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-02-15 11:50:32,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2229, Unknown=20, NotChecked=606, Total=3080 [2022-02-15 11:50:32,623 INFO L87 Difference]: Start difference. First operand 49659 states and 208766 transitions. Second operand has 56 states, 56 states have (on average 6.642857142857143) internal successors, (372), 56 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:50:36,031 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse2 (select .cse0 c_~A~0.offset)) (.cse3 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) .cse1 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ .cse2 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse1 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= .cse2 c_~min~0) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse4 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse4) (<= c_~min~0 (+ .cse4 1)))))))))) is different from false [2022-02-15 11:50:38,253 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse2 (select .cse0 c_~A~0.offset)) (.cse3 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) .cse1 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ .cse2 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse1 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= .cse2 c_~min~0) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse4 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse4) (<= c_~min~0 (+ .cse4 1)))))))))) is different from false [2022-02-15 11:50:40,394 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and .cse0 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ .cse1 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse0 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= .cse1 c_~min~0) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~A~0.offset 0) (= .cse1 c_~min~0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (exists ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (not (< (select .cse3 c_~A~0.offset) .cse4)) (= .cse4 c_~min~0))))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse5 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse5) (<= c_~min~0 (+ .cse5 1))))))))) is different from false [2022-02-15 11:50:40,875 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| (+ |c_thread3Thread1of1ForFork3_~i~2#1| 1)) (<= c_~min~0 (+ .cse0 1))))) (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (= c_~A~0.offset 0)) is different from false [2022-02-15 11:50:43,113 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and .cse0 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ .cse1 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse0 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (= .cse1 c_~min~0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (exists ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (not (< (select .cse3 c_~A~0.offset) .cse4)) (= .cse4 c_~min~0))))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse5 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse5) (<= c_~min~0 (+ .cse5 1))))))))) is different from false [2022-02-15 11:50:47,592 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) .cse1 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse1 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse3 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse3) (<= c_~min~0 (+ .cse3 1))))))))) is different from false [2022-02-15 11:50:49,597 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse1 (+ |c_#StackHeapBarrier| 1))) (and .cse0 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse0 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (exists ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse2 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (not (< (select .cse2 c_~A~0.offset) .cse3)) (= .cse3 c_~min~0))))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse4 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse4) (<= c_~min~0 (+ .cse4 1))))))))) is different from false [2022-02-15 11:50:51,994 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse1 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1))))))))) is different from false [2022-02-15 11:50:54,002 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse1 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1))))))))) is different from false [2022-02-15 11:50:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:50:58,455 INFO L93 Difference]: Finished difference Result 521734 states and 2232409 transitions. [2022-02-15 11:50:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-02-15 11:50:58,455 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 6.642857142857143) internal successors, (372), 56 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-02-15 11:50:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:51:00,825 INFO L225 Difference]: With dead ends: 521734 [2022-02-15 11:51:00,825 INFO L226 Difference]: Without dead ends: 452620 [2022-02-15 11:51:00,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 307 SyntacticMatches, 23 SemanticMatches, 101 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 2527 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=1050, Invalid=6637, Unknown=29, NotChecked=2790, Total=10506 [2022-02-15 11:51:00,827 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 3417 mSDsluCounter, 9491 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3417 SdHoareTripleChecker+Valid, 8809 SdHoareTripleChecker+Invalid, 8324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5482 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:51:00,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3417 Valid, 8809 Invalid, 8324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 2652 Invalid, 0 Unknown, 5482 Unchecked, 1.2s Time]