/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 17:37:34,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 17:37:34,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 17:37:34,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 17:37:34,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 17:37:34,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 17:37:34,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 17:37:34,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 17:37:34,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 17:37:34,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 17:37:34,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 17:37:34,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 17:37:34,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 17:37:34,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 17:37:34,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 17:37:34,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 17:37:34,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 17:37:34,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 17:37:34,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 17:37:34,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 17:37:34,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 17:37:34,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 17:37:34,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 17:37:34,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 17:37:34,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 17:37:34,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 17:37:34,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 17:37:34,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 17:37:34,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 17:37:34,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 17:37:34,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 17:37:34,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 17:37:34,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 17:37:34,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 17:37:34,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 17:37:34,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 17:37:34,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 17:37:34,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 17:37:34,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 17:37:34,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 17:37:34,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 17:37:34,907 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-03 17:37:34,922 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 17:37:34,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 17:37:34,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 17:37:34,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 17:37:34,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 17:37:34,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 17:37:34,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 17:37:34,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 17:37:34,923 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 17:37:34,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 17:37:34,924 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 17:37:34,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 17:37:34,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 17:37:34,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 17:37:34,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 17:37:34,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 17:37:34,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 17:37:34,925 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 17:37:34,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 17:37:34,925 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 17:37:34,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 17:37:34,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 17:37:34,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 17:37:34,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 17:37:34,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 17:37:34,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:37:34,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 17:37:34,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 17:37:34,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 17:37:34,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 17:37:34,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 17:37:34,926 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 17:37:34,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 17:37:34,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-03 17:37:35,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 17:37:35,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 17:37:35,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 17:37:35,102 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 17:37:35,102 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 17:37:35,103 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-03-03 17:37:35,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14ec4bd7/8046d844cd214dbcbd00319917c23f4b/FLAGceee8bbfc [2022-03-03 17:37:35,521 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 17:37:35,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-03-03 17:37:35,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14ec4bd7/8046d844cd214dbcbd00319917c23f4b/FLAGceee8bbfc [2022-03-03 17:37:35,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14ec4bd7/8046d844cd214dbcbd00319917c23f4b [2022-03-03 17:37:35,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 17:37:35,934 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 17:37:35,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 17:37:35,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 17:37:35,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 17:37:35,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:37:35" (1/1) ... [2022-03-03 17:37:35,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c986431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:35, skipping insertion in model container [2022-03-03 17:37:35,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:37:35" (1/1) ... [2022-03-03 17:37:35,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 17:37:35,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 17:37:36,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-03-03 17:37:36,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:37:36,160 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 17:37:36,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-03-03 17:37:36,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:37:36,209 INFO L208 MainTranslator]: Completed translation [2022-03-03 17:37:36,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36 WrapperNode [2022-03-03 17:37:36,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 17:37:36,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 17:37:36,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 17:37:36,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 17:37:36,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36" (1/1) ... [2022-03-03 17:37:36,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36" (1/1) ... [2022-03-03 17:37:36,254 INFO L137 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 166 [2022-03-03 17:37:36,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 17:37:36,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 17:37:36,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 17:37:36,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 17:37:36,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36" (1/1) ... [2022-03-03 17:37:36,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36" (1/1) ... [2022-03-03 17:37:36,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36" (1/1) ... [2022-03-03 17:37:36,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36" (1/1) ... [2022-03-03 17:37:36,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36" (1/1) ... [2022-03-03 17:37:36,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36" (1/1) ... [2022-03-03 17:37:36,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36" (1/1) ... [2022-03-03 17:37:36,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 17:37:36,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 17:37:36,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 17:37:36,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 17:37:36,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36" (1/1) ... [2022-03-03 17:37:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:37:36,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:37:36,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-03 17:37:36,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-03 17:37:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 17:37:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 17:37:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 17:37:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 17:37:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-03 17:37:36,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-03 17:37:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-03 17:37:36,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-03 17:37:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-03 17:37:36,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-03 17:37:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 17:37:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-03 17:37:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-03 17:37:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-03 17:37:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 17:37:36,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 17:37:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 17:37:36,347 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 17:37:36,448 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 17:37:36,449 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 17:37:36,696 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 17:37:36,756 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 17:37:36,757 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-03 17:37:36,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:37:36 BoogieIcfgContainer [2022-03-03 17:37:36,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 17:37:36,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 17:37:36,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 17:37:36,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 17:37:36,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:37:35" (1/3) ... [2022-03-03 17:37:36,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a010e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:37:36, skipping insertion in model container [2022-03-03 17:37:36,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:36" (2/3) ... [2022-03-03 17:37:36,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a010e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:37:36, skipping insertion in model container [2022-03-03 17:37:36,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:37:36" (3/3) ... [2022-03-03 17:37:36,770 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-03-03 17:37:36,775 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 17:37:36,775 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 17:37:36,775 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-03 17:37:36,775 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 17:37:36,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,810 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,810 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,810 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,810 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,810 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,810 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,811 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,811 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,811 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,811 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,811 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,811 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,811 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,811 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,811 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,812 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,813 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,813 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,813 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,813 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,813 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,813 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,813 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,813 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,813 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,813 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,814 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,815 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,815 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,815 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,815 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,817 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,817 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,818 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,818 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,818 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,818 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,818 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,818 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,818 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,818 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,818 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,822 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:37:36,825 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-03 17:37:36,857 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 17:37:36,861 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 17:37:36,861 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-03 17:37:36,871 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 156 transitions, 336 flow [2022-03-03 17:37:36,977 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:37,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-03-03 17:37:37,008 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:37:37,009 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:37:37,010 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:37:37,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:37:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2134475998, now seen corresponding path program 1 times [2022-03-03 17:37:37,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:37:37,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723310888] [2022-03-03 17:37:37,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:37,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:37:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:37:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:37:37,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:37:37,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723310888] [2022-03-03 17:37:37,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723310888] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:37:37,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:37:37,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 17:37:37,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575845283] [2022-03-03 17:37:37,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:37:37,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 17:37:37,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:37:37,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 17:37:37,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:37:37,223 INFO L87 Difference]: Start difference. First operand has 2453 states, 2452 states have (on average 3.480016313213703) internal successors, (8533), 2452 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:37:37,287 INFO L93 Difference]: Finished difference Result 2453 states and 8070 transitions. [2022-03-03 17:37:37,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 17:37:37,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-03-03 17:37:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:37:37,330 INFO L225 Difference]: With dead ends: 2453 [2022-03-03 17:37:37,330 INFO L226 Difference]: Without dead ends: 2449 [2022-03-03 17:37:37,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:37:37,333 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:37:37,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:37:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2022-03-03 17:37:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2449. [2022-03-03 17:37:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 2448 states have (on average 3.2949346405228757) internal successors, (8066), 2448 states have internal predecessors, (8066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 8066 transitions. [2022-03-03 17:37:37,447 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 8066 transitions. Word has length 112 [2022-03-03 17:37:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:37:37,447 INFO L470 AbstractCegarLoop]: Abstraction has 2449 states and 8066 transitions. [2022-03-03 17:37:37,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 8066 transitions. [2022-03-03 17:37:37,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-03-03 17:37:37,455 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:37:37,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:37:37,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 17:37:37,456 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:37:37,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:37:37,457 INFO L85 PathProgramCache]: Analyzing trace with hash -198236285, now seen corresponding path program 1 times [2022-03-03 17:37:37,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:37:37,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187404803] [2022-03-03 17:37:37,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:37,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:37:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:37:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:37:37,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:37:37,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187404803] [2022-03-03 17:37:37,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187404803] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:37:37,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:37:37,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-03 17:37:37,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343370940] [2022-03-03 17:37:37,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:37:37,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 17:37:37,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:37:37,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 17:37:37,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-03 17:37:37,859 INFO L87 Difference]: Start difference. First operand 2449 states and 8066 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:37:38,079 INFO L93 Difference]: Finished difference Result 3433 states and 11469 transitions. [2022-03-03 17:37:38,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-03 17:37:38,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-03-03 17:37:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:37:38,092 INFO L225 Difference]: With dead ends: 3433 [2022-03-03 17:37:38,092 INFO L226 Difference]: Without dead ends: 2164 [2022-03-03 17:37:38,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-03-03 17:37:38,094 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 336 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:37:38,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 475 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:37:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2022-03-03 17:37:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2164. [2022-03-03 17:37:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 2163 states have (on average 3.1673601479426723) internal successors, (6851), 2163 states have internal predecessors, (6851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 6851 transitions. [2022-03-03 17:37:38,150 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 6851 transitions. Word has length 112 [2022-03-03 17:37:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:37:38,151 INFO L470 AbstractCegarLoop]: Abstraction has 2164 states and 6851 transitions. [2022-03-03 17:37:38,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 6851 transitions. [2022-03-03 17:37:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-03 17:37:38,158 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:37:38,159 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:37:38,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 17:37:38,159 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:37:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:37:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash -50241742, now seen corresponding path program 1 times [2022-03-03 17:37:38,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:37:38,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912876535] [2022-03-03 17:37:38,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:38,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:37:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:37:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:37:38,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:37:38,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912876535] [2022-03-03 17:37:38,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912876535] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:37:38,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722646375] [2022-03-03 17:37:38,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:38,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:37:38,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:37:38,290 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:37:38,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-03 17:37:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:37:38,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 17:37:38,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:37:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:37:38,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:37:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:37:38,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722646375] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:37:38,831 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:37:38,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-03-03 17:37:38,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90119218] [2022-03-03 17:37:38,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:37:38,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-03 17:37:38,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:37:38,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-03 17:37:38,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-03 17:37:38,835 INFO L87 Difference]: Start difference. First operand 2164 states and 6851 transitions. Second operand has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:37:38,925 INFO L93 Difference]: Finished difference Result 2869 states and 9286 transitions. [2022-03-03 17:37:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 17:37:38,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-03-03 17:37:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:37:38,936 INFO L225 Difference]: With dead ends: 2869 [2022-03-03 17:37:38,936 INFO L226 Difference]: Without dead ends: 2305 [2022-03-03 17:37:38,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-03 17:37:38,937 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 346 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:37:38,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 446 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:37:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2022-03-03 17:37:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2022-03-03 17:37:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 2304 states have (on average 3.1236979166666665) internal successors, (7197), 2304 states have internal predecessors, (7197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 7197 transitions. [2022-03-03 17:37:38,986 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 7197 transitions. Word has length 116 [2022-03-03 17:37:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:37:38,986 INFO L470 AbstractCegarLoop]: Abstraction has 2305 states and 7197 transitions. [2022-03-03 17:37:38,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:38,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 7197 transitions. [2022-03-03 17:37:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-03 17:37:38,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:37:38,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:37:39,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-03 17:37:39,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:37:39,205 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:37:39,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:37:39,206 INFO L85 PathProgramCache]: Analyzing trace with hash 102358740, now seen corresponding path program 2 times [2022-03-03 17:37:39,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:37:39,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136926297] [2022-03-03 17:37:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:39,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:37:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:37:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:37:39,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:37:39,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136926297] [2022-03-03 17:37:39,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136926297] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:37:39,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:37:39,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 17:37:39,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544826086] [2022-03-03 17:37:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:37:39,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 17:37:39,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:37:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 17:37:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 17:37:39,364 INFO L87 Difference]: Start difference. First operand 2305 states and 7197 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:37:39,389 INFO L93 Difference]: Finished difference Result 2493 states and 7603 transitions. [2022-03-03 17:37:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 17:37:39,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-03-03 17:37:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:37:39,399 INFO L225 Difference]: With dead ends: 2493 [2022-03-03 17:37:39,399 INFO L226 Difference]: Without dead ends: 2343 [2022-03-03 17:37:39,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 17:37:39,400 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:37:39,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 180 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:37:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-03-03 17:37:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-03-03 17:37:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 3.066609735269001) internal successors, (7182), 2342 states have internal predecessors, (7182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 7182 transitions. [2022-03-03 17:37:39,447 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 7182 transitions. Word has length 116 [2022-03-03 17:37:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:37:39,447 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 7182 transitions. [2022-03-03 17:37:39,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 7182 transitions. [2022-03-03 17:37:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-03-03 17:37:39,452 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:37:39,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:37:39,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 17:37:39,453 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:37:39,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:37:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 743330443, now seen corresponding path program 1 times [2022-03-03 17:37:39,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:37:39,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166538107] [2022-03-03 17:37:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:37:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:37:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:37:39,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:37:39,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166538107] [2022-03-03 17:37:39,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166538107] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:37:39,520 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:37:39,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 17:37:39,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719275682] [2022-03-03 17:37:39,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:37:39,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 17:37:39,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:37:39,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 17:37:39,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-03 17:37:39,521 INFO L87 Difference]: Start difference. First operand 2343 states and 7182 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:37:39,578 INFO L93 Difference]: Finished difference Result 2594 states and 7748 transitions. [2022-03-03 17:37:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 17:37:39,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-03-03 17:37:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:37:39,588 INFO L225 Difference]: With dead ends: 2594 [2022-03-03 17:37:39,588 INFO L226 Difference]: Without dead ends: 2349 [2022-03-03 17:37:39,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-03 17:37:39,589 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 334 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:37:39,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 355 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:37:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-03-03 17:37:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2344. [2022-03-03 17:37:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2343 states have (on average 3.0657276995305165) internal successors, (7183), 2343 states have internal predecessors, (7183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 7183 transitions. [2022-03-03 17:37:39,634 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 7183 transitions. Word has length 123 [2022-03-03 17:37:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:37:39,634 INFO L470 AbstractCegarLoop]: Abstraction has 2344 states and 7183 transitions. [2022-03-03 17:37:39,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 7183 transitions. [2022-03-03 17:37:39,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-03-03 17:37:39,639 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:37:39,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:37:39,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 17:37:39,639 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:37:39,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:37:39,640 INFO L85 PathProgramCache]: Analyzing trace with hash -129850157, now seen corresponding path program 1 times [2022-03-03 17:37:39,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:37:39,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807830866] [2022-03-03 17:37:39,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:39,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:37:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:37:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:37:40,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:37:40,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807830866] [2022-03-03 17:37:40,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807830866] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:37:40,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218536726] [2022-03-03 17:37:40,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:40,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:37:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:37:40,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:37:40,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-03 17:37:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:37:40,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-03 17:37:40,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:37:41,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:37:41,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:37:42,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:37:42,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:37:42,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:37:42,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:37:42,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-03 17:37:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:37:42,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:37:42,995 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-03 17:37:43,042 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-03 17:37:44,285 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:37:44,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2022-03-03 17:37:44,294 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:37:44,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 362 treesize of output 354 [2022-03-03 17:37:44,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 266 [2022-03-03 17:37:44,311 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:37:44,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 290 treesize of output 288 [2022-03-03 17:37:44,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 230 [2022-03-03 17:37:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:37:45,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218536726] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:37:45,707 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:37:45,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31, 31] total 81 [2022-03-03 17:37:45,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502738409] [2022-03-03 17:37:45,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:37:45,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-03-03 17:37:45,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:37:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-03-03 17:37:45,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=5660, Unknown=26, NotChecked=310, Total=6480 [2022-03-03 17:37:45,709 INFO L87 Difference]: Start difference. First operand 2344 states and 7183 transitions. Second operand has 81 states, 81 states have (on average 4.049382716049383) internal successors, (328), 81 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:53,359 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~back~0 4))) (let ((.cse1 (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0))) (.cse0 (mod c_~v_assert~0 256)) (.cse2 (not (< c_~back~0 c_~n~0))) (.cse3 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse5)) 1))) (.cse4 (not (<= 0 c_~back~0)))) (and (not (<= .cse0 0)) (= c_~d~0 0) (or .cse1 .cse2 .cse3 .cse4) .cse1 (or (<= 1 c_~back~0) (< c_~back~0 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (* c_~front~0 4) .cse5))) (or (= .cse0 0) .cse2 (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) .cse3 .cse4)))) is different from false [2022-03-03 17:37:56,493 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) (or (<= 1 c_~back~0) (< c_~back~0 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (* c_~front~0 4) (* c_~back~0 4))))) is different from false [2022-03-03 17:37:56,810 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_120 (Array Int Int)) (v_ArrVal_121 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_120) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0))) (.cse1 (* c_~back~0 4))) (and (not (<= (mod c_~v_assert~0 256) 0)) (or .cse0 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1)) (not (<= 0 c_~back~0))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) .cse0 (or (<= 1 c_~back~0) (< c_~back~0 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (* c_~front~0 4) .cse1))))) is different from false [2022-03-03 17:37:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:37:57,392 INFO L93 Difference]: Finished difference Result 20348 states and 64283 transitions. [2022-03-03 17:37:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-03 17:37:57,393 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 4.049382716049383) internal successors, (328), 81 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-03-03 17:37:57,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:37:57,453 INFO L225 Difference]: With dead ends: 20348 [2022-03-03 17:37:57,453 INFO L226 Difference]: Without dead ends: 15059 [2022-03-03 17:37:57,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 217 SyntacticMatches, 27 SemanticMatches, 178 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12092 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=3587, Invalid=26746, Unknown=137, NotChecked=1750, Total=32220 [2022-03-03 17:37:57,461 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 4545 mSDsluCounter, 11211 mSDsCounter, 0 mSdLazyCounter, 4124 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4545 SdHoareTripleChecker+Valid, 9977 SdHoareTripleChecker+Invalid, 8197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 4124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3853 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:37:57,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4545 Valid, 9977 Invalid, 8197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 4124 Invalid, 0 Unknown, 3853 Unchecked, 2.2s Time] [2022-03-03 17:37:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15059 states. [2022-03-03 17:37:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15059 to 3680. [2022-03-03 17:37:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3679 states have (on average 2.9766240826311496) internal successors, (10951), 3679 states have internal predecessors, (10951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 10951 transitions. [2022-03-03 17:37:57,622 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 10951 transitions. Word has length 130 [2022-03-03 17:37:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:37:57,622 INFO L470 AbstractCegarLoop]: Abstraction has 3680 states and 10951 transitions. [2022-03-03 17:37:57,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 4.049382716049383) internal successors, (328), 81 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 10951 transitions. [2022-03-03 17:37:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-03 17:37:57,629 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:37:57,630 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:37:57,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-03 17:37:57,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-03 17:37:57,840 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:37:57,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:37:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 526565270, now seen corresponding path program 2 times [2022-03-03 17:37:57,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:37:57,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613722590] [2022-03-03 17:37:57,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:37:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:37:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:37:58,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:37:58,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613722590] [2022-03-03 17:37:58,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613722590] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:37:58,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231596191] [2022-03-03 17:37:58,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:37:58,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:37:58,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:37:58,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:37:58,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-03 17:37:58,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:37:58,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:37:58,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 17:37:58,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:37:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:37:58,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:37:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:37:58,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231596191] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:37:58,736 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:37:58,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 5] total 16 [2022-03-03 17:37:58,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953525146] [2022-03-03 17:37:58,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:37:58,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:37:58,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:37:58,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:37:58,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:37:58,737 INFO L87 Difference]: Start difference. First operand 3680 states and 10951 transitions. Second operand has 16 states, 16 states have (on average 18.75) internal successors, (300), 16 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:37:59,159 INFO L93 Difference]: Finished difference Result 12206 states and 37480 transitions. [2022-03-03 17:37:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 17:37:59,159 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 18.75) internal successors, (300), 16 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-03 17:37:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:37:59,187 INFO L225 Difference]: With dead ends: 12206 [2022-03-03 17:37:59,187 INFO L226 Difference]: Without dead ends: 11468 [2022-03-03 17:37:59,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2022-03-03 17:37:59,188 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 1263 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:37:59,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1263 Valid, 1134 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:37:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11468 states. [2022-03-03 17:37:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11468 to 7088. [2022-03-03 17:37:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7088 states, 7087 states have (on average 2.995908000564414) internal successors, (21232), 7087 states have internal predecessors, (21232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7088 states to 7088 states and 21232 transitions. [2022-03-03 17:37:59,351 INFO L78 Accepts]: Start accepts. Automaton has 7088 states and 21232 transitions. Word has length 134 [2022-03-03 17:37:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:37:59,351 INFO L470 AbstractCegarLoop]: Abstraction has 7088 states and 21232 transitions. [2022-03-03 17:37:59,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.75) internal successors, (300), 16 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 7088 states and 21232 transitions. [2022-03-03 17:37:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-03-03 17:37:59,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:37:59,365 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:37:59,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-03 17:37:59,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:37:59,582 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:37:59,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:37:59,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2146157939, now seen corresponding path program 3 times [2022-03-03 17:37:59,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:37:59,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979331160] [2022-03-03 17:37:59,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:59,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:37:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:38:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:38:00,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:38:00,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979331160] [2022-03-03 17:38:00,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979331160] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:38:00,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934691148] [2022-03-03 17:38:00,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:38:00,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:38:00,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:38:00,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:38:00,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-03 17:38:00,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:38:00,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:38:00,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-03 17:38:00,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:38:01,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:38:01,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:38:01,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:38:01,959 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:38:02,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-03 17:38:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:38:02,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:38:02,304 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_191) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-03 17:38:02,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_190 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_191) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) c_~W~0)) is different from false [2022-03-03 17:38:02,373 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:38:02,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 166 [2022-03-03 17:38:02,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 122 [2022-03-03 17:38:02,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-03-03 17:38:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-03-03 17:38:03,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934691148] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:38:03,585 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:38:03,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 66 [2022-03-03 17:38:03,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562416738] [2022-03-03 17:38:03,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:38:03,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-03 17:38:03,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:38:03,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-03 17:38:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=3701, Unknown=2, NotChecked=250, Total=4290 [2022-03-03 17:38:03,587 INFO L87 Difference]: Start difference. First operand 7088 states and 21232 transitions. Second operand has 66 states, 66 states have (on average 5.0606060606060606) internal successors, (334), 66 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:38:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:38:11,630 INFO L93 Difference]: Finished difference Result 12250 states and 36989 transitions. [2022-03-03 17:38:11,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-03 17:38:11,631 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 5.0606060606060606) internal successors, (334), 66 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-03-03 17:38:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:38:11,652 INFO L225 Difference]: With dead ends: 12250 [2022-03-03 17:38:11,653 INFO L226 Difference]: Without dead ends: 10747 [2022-03-03 17:38:11,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 238 SyntacticMatches, 7 SemanticMatches, 122 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4316 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2558, Invalid=12210, Unknown=2, NotChecked=482, Total=15252 [2022-03-03 17:38:11,655 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 2980 mSDsluCounter, 6545 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2980 SdHoareTripleChecker+Valid, 6053 SdHoareTripleChecker+Invalid, 4030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1476 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:38:11,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2980 Valid, 6053 Invalid, 4030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2453 Invalid, 0 Unknown, 1476 Unchecked, 1.2s Time] [2022-03-03 17:38:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10747 states. [2022-03-03 17:38:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10747 to 6736. [2022-03-03 17:38:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6736 states, 6735 states have (on average 3.0157386785449147) internal successors, (20311), 6735 states have internal predecessors, (20311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:38:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6736 states to 6736 states and 20311 transitions. [2022-03-03 17:38:11,787 INFO L78 Accepts]: Start accepts. Automaton has 6736 states and 20311 transitions. Word has length 137 [2022-03-03 17:38:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:38:11,787 INFO L470 AbstractCegarLoop]: Abstraction has 6736 states and 20311 transitions. [2022-03-03 17:38:11,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 5.0606060606060606) internal successors, (334), 66 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:38:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 6736 states and 20311 transitions. [2022-03-03 17:38:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-03-03 17:38:11,800 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:38:11,800 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:38:11,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-03 17:38:12,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:38:12,017 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:38:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:38:12,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1470367235, now seen corresponding path program 4 times [2022-03-03 17:38:12,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:38:12,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945794898] [2022-03-03 17:38:12,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:38:12,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:38:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:38:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:38:12,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:38:12,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945794898] [2022-03-03 17:38:12,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945794898] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:38:12,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219811427] [2022-03-03 17:38:12,088 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:38:12,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:38:12,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:38:12,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:38:12,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-03 17:38:12,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:38:12,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:38:12,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-03 17:38:12,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:38:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:38:12,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:38:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:38:12,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219811427] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:38:12,790 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:38:12,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-03 17:38:12,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433260672] [2022-03-03 17:38:12,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:38:12,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-03 17:38:12,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:38:12,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-03 17:38:12,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-03-03 17:38:12,792 INFO L87 Difference]: Start difference. First operand 6736 states and 20311 transitions. Second operand has 19 states, 19 states have (on average 12.368421052631579) internal successors, (235), 19 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:38:12,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:38:12,966 INFO L93 Difference]: Finished difference Result 5761 states and 16994 transitions. [2022-03-03 17:38:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 17:38:12,966 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.368421052631579) internal successors, (235), 19 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2022-03-03 17:38:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:38:12,975 INFO L225 Difference]: With dead ends: 5761 [2022-03-03 17:38:12,975 INFO L226 Difference]: Without dead ends: 4914 [2022-03-03 17:38:12,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-03-03 17:38:12,976 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 676 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:38:12,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 972 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:38:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4914 states. [2022-03-03 17:38:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4914 to 4909. [2022-03-03 17:38:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4909 states, 4908 states have (on average 3.021801140994295) internal successors, (14831), 4908 states have internal predecessors, (14831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:38:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 14831 transitions. [2022-03-03 17:38:13,047 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 14831 transitions. Word has length 141 [2022-03-03 17:38:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:38:13,048 INFO L470 AbstractCegarLoop]: Abstraction has 4909 states and 14831 transitions. [2022-03-03 17:38:13,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.368421052631579) internal successors, (235), 19 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:38:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 14831 transitions. [2022-03-03 17:38:13,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-03 17:38:13,056 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:38:13,056 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:38:13,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-03 17:38:13,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:38:13,269 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:38:13,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:38:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1959922121, now seen corresponding path program 5 times [2022-03-03 17:38:13,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:38:13,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720423513] [2022-03-03 17:38:13,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:38:13,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:38:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:38:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:38:14,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:38:14,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720423513] [2022-03-03 17:38:14,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720423513] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:38:14,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192811351] [2022-03-03 17:38:14,521 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:38:14,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:38:14,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:38:14,522 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:38:14,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-03 17:38:14,615 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-03 17:38:14,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:38:14,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-03 17:38:14,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:38:14,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:38:14,696 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 17:38:14,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-03 17:38:15,088 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-03 17:38:15,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 17:38:16,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-03 17:38:16,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-03 17:38:17,398 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-03 17:38:17,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-03-03 17:38:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:38:17,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:38:17,938 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_263 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-03-03 17:38:17,967 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-03-03 17:38:18,448 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-03 17:38:18,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 153 [2022-03-03 17:38:18,457 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-03 17:38:18,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 67 [2022-03-03 17:38:18,466 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-03 17:38:18,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-03 17:38:22,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-03-03 17:38:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-03-03 17:38:22,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192811351] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:38:22,330 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:38:22,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 36] total 97 [2022-03-03 17:38:22,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409329192] [2022-03-03 17:38:22,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:38:22,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-03-03 17:38:22,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:38:22,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-03-03 17:38:22,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=8299, Unknown=2, NotChecked=374, Total=9312 [2022-03-03 17:38:22,332 INFO L87 Difference]: Start difference. First operand 4909 states and 14831 transitions. Second operand has 97 states, 97 states have (on average 3.9278350515463916) internal successors, (381), 97 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:39:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:39:09,295 INFO L93 Difference]: Finished difference Result 62321 states and 195898 transitions. [2022-03-03 17:39:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 273 states. [2022-03-03 17:39:09,295 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.9278350515463916) internal successors, (381), 97 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-03-03 17:39:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:39:09,464 INFO L225 Difference]: With dead ends: 62321 [2022-03-03 17:39:09,464 INFO L226 Difference]: Without dead ends: 56090 [2022-03-03 17:39:09,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 326 SyntacticMatches, 106 SemanticMatches, 360 ConstructedPredicates, 2 IntricatePredicates, 7 DeprecatedPredicates, 62514 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=17220, Invalid=112026, Unknown=2, NotChecked=1434, Total=130682 [2022-03-03 17:39:09,472 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 7877 mSDsluCounter, 32900 mSDsCounter, 0 mSdLazyCounter, 11563 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7877 SdHoareTripleChecker+Valid, 28138 SdHoareTripleChecker+Invalid, 27887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 11563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15600 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:39:09,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7877 Valid, 28138 Invalid, 27887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [724 Valid, 11563 Invalid, 0 Unknown, 15600 Unchecked, 5.6s Time] [2022-03-03 17:39:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56090 states. [2022-03-03 17:39:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56090 to 18837. [2022-03-03 17:39:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18837 states, 18836 states have (on average 3.2380016988744957) internal successors, (60991), 18836 states have internal predecessors, (60991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:39:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18837 states to 18837 states and 60991 transitions. [2022-03-03 17:39:10,289 INFO L78 Accepts]: Start accepts. Automaton has 18837 states and 60991 transitions. Word has length 148 [2022-03-03 17:39:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:39:10,289 INFO L470 AbstractCegarLoop]: Abstraction has 18837 states and 60991 transitions. [2022-03-03 17:39:10,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.9278350515463916) internal successors, (381), 97 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:39:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 18837 states and 60991 transitions. [2022-03-03 17:39:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-03 17:39:10,325 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:39:10,325 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:39:10,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-03 17:39:10,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:39:10,542 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:39:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:39:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash -864539759, now seen corresponding path program 6 times [2022-03-03 17:39:10,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:39:10,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246481920] [2022-03-03 17:39:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:39:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:39:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:39:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:39:12,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:39:12,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246481920] [2022-03-03 17:39:12,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246481920] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:39:12,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102116705] [2022-03-03 17:39:12,036 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:39:12,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:39:12,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:39:12,037 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:39:12,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-03 17:39:12,179 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 17:39:12,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:39:12,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-03 17:39:12,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:39:14,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:39:14,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-03 17:39:14,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:39:14,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-03 17:39:14,949 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-03 17:39:14,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-03-03 17:39:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:39:15,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:39:15,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-03 17:39:15,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-03 17:39:15,921 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-03 17:39:15,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 153 [2022-03-03 17:39:15,929 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-03 17:39:15,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 67 [2022-03-03 17:39:15,936 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-03 17:39:15,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-03 17:39:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-03-03 17:39:19,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102116705] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:39:19,683 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:39:19,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36, 36] total 98 [2022-03-03 17:39:19,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920292672] [2022-03-03 17:39:19,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:39:19,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-03-03 17:39:19,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:39:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-03-03 17:39:19,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=8460, Unknown=2, NotChecked=378, Total=9506 [2022-03-03 17:39:19,691 INFO L87 Difference]: Start difference. First operand 18837 states and 60991 transitions. Second operand has 98 states, 98 states have (on average 3.8877551020408165) internal successors, (381), 98 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:39:53,748 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~back~0 4))) (let ((.cse15 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse12 (= (* c_~front~0 4) .cse10))) (let ((.cse1 (or .cse2 .cse12)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse15 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse14 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse8 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse19 (* c_~front~0 4))) (+ c_~d~0 (select .cse18 (+ c_~queue~0.offset .cse19)) (select .cse18 (+ c_~queue~0.offset .cse19 4)))) c_~W~0))) (.cse6 (and .cse1 (or .cse2 .cse13) .cse3 .cse4 (or .cse14 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse9 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (.cse16 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse17 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= |c_thread2Thread1of1ForFork2_~temp~0#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (or .cse0 .cse8 .cse9 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)) 1)) (not (<= 0 c_~back~0))) (<= c_~d~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse8 (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse11 (<= 1 c_~back~0))) (and (or .cse11 .cse12) (or .cse11 .cse13) (or .cse14 .cse11) (or .cse11 .cse15)))) (= |c_thread2Thread1of1ForFork2_~temp~0#1| 1) (or (and .cse16 .cse1 .cse17 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 .cse9 (and .cse16 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse17 .cse4)) (< 1 c_~W~0) (<= (+ c_~d~0 1) c_~W~0)))))) is different from false [2022-03-03 17:39:54,302 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse11 (= (* c_~front~0 4) (* c_~back~0 4)))) (let ((.cse1 (or .cse2 .cse11)) (.cse12 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse14 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse6 (and .cse1 (or .cse2 .cse12) .cse3 .cse4 (or .cse13 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse15 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse16 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse9 (* c_~front~0 4))) (+ c_~d~0 (select .cse8 (+ c_~queue~0.offset .cse9)) (select .cse8 (+ c_~queue~0.offset .cse9 4)))) c_~W~0)) (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse10 (<= 1 c_~back~0))) (and (or .cse10 .cse11) (or .cse10 .cse12) (or .cse13 .cse10) (or .cse10 .cse14)))) (or (and .cse15 .cse1 .cse16 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1) (and .cse15 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse16 .cse4)))))) is different from false [2022-03-03 17:39:54,654 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ c_~d~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))) c_~W~0)))) (and (or (= (mod c_~v_assert~0 256) 0) .cse0 (not (< c_~back~0 c_~n~0)) (<= |c_thread1Thread1of1ForFork1_#t~post1#1| 1) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0)) is different from false [2022-03-03 17:39:55,623 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (+ c_~d~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))) c_~W~0)))) (and (or (= (mod c_~v_assert~0 256) 0) .cse0 (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0)) is different from false [2022-03-03 17:39:56,272 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~back~0 4))) (let ((.cse15 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse12 (= (* c_~front~0 4) .cse10))) (let ((.cse1 (or .cse2 .cse12)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse15 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse14 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse8 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse19 (* c_~front~0 4))) (+ c_~d~0 (select .cse18 (+ c_~queue~0.offset .cse19)) (select .cse18 (+ c_~queue~0.offset .cse19 4)))) c_~W~0))) (.cse6 (and .cse1 (or .cse2 .cse13) .cse3 .cse4 (or .cse14 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse9 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (.cse16 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse17 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (or .cse0 .cse8 .cse9 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)) 1)) (not (<= 0 c_~back~0))) (<= c_~d~0 2) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse8 (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse11 (<= 1 c_~back~0))) (and (or .cse11 .cse12) (or .cse11 .cse13) (or .cse14 .cse11) (or .cse11 .cse15)))) (or (and .cse16 .cse1 .cse17 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 .cse9 (and .cse16 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse17 .cse4)) (< 1 c_~W~0)))))) is different from false [2022-03-03 17:39:59,027 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) (or (< c_~back~0 0) (let ((.cse2 (<= 1 c_~back~0))) (and (or .cse2 (= (* c_~front~0 4) (* c_~back~0 4))) (or .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or .cse2 (<= c_~d~0 0)))))) is different from false [2022-03-03 17:40:00,292 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (< c_~back~0 0) (let ((.cse2 (<= 1 c_~back~0))) (and (or .cse2 (= (* c_~front~0 4) (* c_~back~0 4))) (or .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or .cse2 (<= c_~d~0 0)))))) is different from false [2022-03-03 17:40:00,482 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~back~0 4))) (let ((.cse15 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse12 (= (* c_~front~0 4) .cse10))) (let ((.cse1 (or .cse2 .cse12)) (.cse13 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse3 (or .cse15 .cse2)) (.cse4 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse14 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse7 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse8 (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~queue~0.base)) (.cse19 (* c_~front~0 4))) (+ c_~d~0 (select .cse18 (+ c_~queue~0.offset .cse19)) (select .cse18 (+ c_~queue~0.offset .cse19 4)))) c_~W~0))) (.cse6 (and .cse1 (or .cse2 .cse13) .cse3 .cse4 (or .cse14 .cse2))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< c_~back~0 0)) (.cse9 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (.cse16 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse17 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (+ (* (- 1) c_~v_assert~0) |c_thread2Thread1of1ForFork2_~cond~1#1|) 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 (and .cse1 (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3 (or .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse4) .cse5) (or .cse0 (and .cse1 (or (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 (or (not (<= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse4) .cse5) (or .cse0 .cse6 .cse7 .cse5) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse5 (and (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) .cse1 .cse3 (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse4)) (or .cse0 .cse7 .cse5 (and .cse1 .cse3 .cse4 (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2))) (or .cse0 .cse8 .cse9 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)) 1)) (not (<= 0 c_~back~0))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1|) c_~W~0) (<= c_~d~0 2) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse8 (<= 1 c_~v_assert~0) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse5) (or .cse5 (let ((.cse11 (<= 1 c_~back~0))) (and (or .cse11 .cse12) (or .cse11 .cse13) (or .cse14 .cse11) (or .cse11 .cse15)))) (or (and .cse16 .cse1 .cse17 .cse3 .cse4) .cse0 .cse5) (or .cse0 .cse5 .cse9 (and .cse16 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse1 .cse17 .cse4)) (< 1 c_~W~0)))))) is different from false [2022-03-03 17:40:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:40:01,985 INFO L93 Difference]: Finished difference Result 96174 states and 313453 transitions. [2022-03-03 17:40:01,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-03-03 17:40:01,986 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 3.8877551020408165) internal successors, (381), 98 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-03-03 17:40:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:40:02,281 INFO L225 Difference]: With dead ends: 96174 [2022-03-03 17:40:02,281 INFO L226 Difference]: Without dead ends: 92664 [2022-03-03 17:40:02,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 259 SyntacticMatches, 87 SemanticMatches, 281 ConstructedPredicates, 10 IntricatePredicates, 11 DeprecatedPredicates, 34578 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=11246, Invalid=62909, Unknown=141, NotChecked=5510, Total=79806 [2022-03-03 17:40:02,290 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 8202 mSDsluCounter, 20678 mSDsCounter, 0 mSdLazyCounter, 7914 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8202 SdHoareTripleChecker+Valid, 18199 SdHoareTripleChecker+Invalid, 21615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 7914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12727 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:40:02,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8202 Valid, 18199 Invalid, 21615 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [974 Valid, 7914 Invalid, 0 Unknown, 12727 Unchecked, 4.0s Time] [2022-03-03 17:40:02,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92664 states. [2022-03-03 17:40:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92664 to 24955. [2022-03-03 17:40:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24955 states, 24954 states have (on average 3.2728620662018115) internal successors, (81671), 24954 states have internal predecessors, (81671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24955 states to 24955 states and 81671 transitions. [2022-03-03 17:40:03,622 INFO L78 Accepts]: Start accepts. Automaton has 24955 states and 81671 transitions. Word has length 148 [2022-03-03 17:40:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:40:03,622 INFO L470 AbstractCegarLoop]: Abstraction has 24955 states and 81671 transitions. [2022-03-03 17:40:03,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 3.8877551020408165) internal successors, (381), 98 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 24955 states and 81671 transitions. [2022-03-03 17:40:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-03 17:40:03,790 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:40:03,790 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:40:03,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-03 17:40:03,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:40:03,991 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:40:03,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:40:03,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1443540091, now seen corresponding path program 7 times [2022-03-03 17:40:03,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:40:03,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616694308] [2022-03-03 17:40:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:40:03,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:40:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:40:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:40:05,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:40:05,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616694308] [2022-03-03 17:40:05,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616694308] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:40:05,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451281163] [2022-03-03 17:40:05,084 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 17:40:05,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:40:05,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:40:05,085 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:40:05,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-03 17:40:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:40:05,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-03 17:40:05,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:40:05,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:40:05,233 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 17:40:05,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 17:40:05,678 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-03 17:40:05,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 17:40:07,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-03 17:40:07,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-03 17:40:07,705 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-03 17:40:07,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-03-03 17:40:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:40:07,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:40:08,072 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-03 17:40:08,097 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_340 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_341) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0)) c_~W~0)) is different from false [2022-03-03 17:40:08,439 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-03 17:40:08,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 153 [2022-03-03 17:40:08,447 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-03 17:40:08,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 67 [2022-03-03 17:40:08,453 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-03 17:40:08,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-03-03 17:40:12,226 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-03 17:40:12,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-03-03 17:40:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-03 17:40:12,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451281163] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:40:12,249 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:40:12,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 36] total 97 [2022-03-03 17:40:12,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255018359] [2022-03-03 17:40:12,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:40:12,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-03-03 17:40:12,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:40:12,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-03-03 17:40:12,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=8262, Unknown=2, NotChecked=374, Total=9312 [2022-03-03 17:40:12,250 INFO L87 Difference]: Start difference. First operand 24955 states and 81671 transitions. Second operand has 97 states, 97 states have (on average 3.865979381443299) internal successors, (375), 97 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:40:32,632 INFO L93 Difference]: Finished difference Result 48303 states and 153878 transitions. [2022-03-03 17:40:32,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-03 17:40:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.865979381443299) internal successors, (375), 97 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-03-03 17:40:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:40:32,736 INFO L225 Difference]: With dead ends: 48303 [2022-03-03 17:40:32,736 INFO L226 Difference]: Without dead ends: 47394 [2022-03-03 17:40:32,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 260 SyntacticMatches, 38 SemanticMatches, 200 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 14892 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=5252, Invalid=34508, Unknown=48, NotChecked=794, Total=40602 [2022-03-03 17:40:32,738 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 4772 mSDsluCounter, 16829 mSDsCounter, 0 mSdLazyCounter, 6181 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 14801 SdHoareTripleChecker+Invalid, 13272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 6181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6753 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-03 17:40:32,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4772 Valid, 14801 Invalid, 13272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 6181 Invalid, 0 Unknown, 6753 Unchecked, 2.7s Time] [2022-03-03 17:40:32,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47394 states. [2022-03-03 17:40:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47394 to 24347. [2022-03-03 17:40:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24347 states, 24346 states have (on average 3.266696787973384) internal successors, (79531), 24346 states have internal predecessors, (79531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24347 states to 24347 states and 79531 transitions. [2022-03-03 17:40:33,555 INFO L78 Accepts]: Start accepts. Automaton has 24347 states and 79531 transitions. Word has length 148 [2022-03-03 17:40:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:40:33,556 INFO L470 AbstractCegarLoop]: Abstraction has 24347 states and 79531 transitions. [2022-03-03 17:40:33,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.865979381443299) internal successors, (375), 97 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 24347 states and 79531 transitions. [2022-03-03 17:40:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-03 17:40:33,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:40:33,596 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:40:33,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-03 17:40:33,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-03 17:40:33,811 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:40:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:40:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1715784193, now seen corresponding path program 8 times [2022-03-03 17:40:33,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:40:33,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959734785] [2022-03-03 17:40:33,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:40:33,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:40:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:40:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:40:34,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:40:34,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959734785] [2022-03-03 17:40:34,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959734785] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:40:34,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604328538] [2022-03-03 17:40:34,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:40:34,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:40:34,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:40:34,959 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:40:34,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-03 17:40:35,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:40:35,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:40:35,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-03 17:40:35,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:40:35,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:40:35,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:40:36,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:40:37,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:40:37,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-03 17:40:37,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:40:37,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-03 17:40:37,643 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-03 17:40:37,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-03-03 17:40:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:40:37,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:40:38,050 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_384) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-03 17:40:38,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_384) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-03 17:40:40,811 INFO L353 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-03-03 17:40:40,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 97 [2022-03-03 17:40:40,846 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-03 17:40:40,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 998 treesize of output 966 [2022-03-03 17:40:40,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:40:40,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 433 treesize of output 329 [2022-03-03 17:40:40,891 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-03 17:40:40,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 810 treesize of output 798 [2022-03-03 17:40:40,909 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-03 17:40:40,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 710 treesize of output 502 [2022-03-03 17:40:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-03 17:40:43,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604328538] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:40:43,625 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:40:43,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 38, 39] total 102 [2022-03-03 17:40:43,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504264965] [2022-03-03 17:40:43,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:40:43,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-03-03 17:40:43,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:40:43,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-03-03 17:40:43,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=9126, Unknown=22, NotChecked=394, Total=10302 [2022-03-03 17:40:43,627 INFO L87 Difference]: Start difference. First operand 24347 states and 79531 transitions. Second operand has 102 states, 102 states have (on average 3.6862745098039214) internal successors, (376), 102 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:40:58,846 INFO L93 Difference]: Finished difference Result 63720 states and 208353 transitions. [2022-03-03 17:40:58,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-03-03 17:40:58,847 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.6862745098039214) internal successors, (376), 102 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-03-03 17:40:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:40:59,003 INFO L225 Difference]: With dead ends: 63720 [2022-03-03 17:40:59,003 INFO L226 Difference]: Without dead ends: 60948 [2022-03-03 17:40:59,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 249 SyntacticMatches, 28 SemanticMatches, 204 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 15418 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=4627, Invalid=36771, Unknown=22, NotChecked=810, Total=42230 [2022-03-03 17:40:59,005 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 4558 mSDsluCounter, 17472 mSDsCounter, 0 mSdLazyCounter, 7146 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4558 SdHoareTripleChecker+Valid, 15631 SdHoareTripleChecker+Invalid, 12855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 7146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5369 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:40:59,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4558 Valid, 15631 Invalid, 12855 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [340 Valid, 7146 Invalid, 0 Unknown, 5369 Unchecked, 3.0s Time] [2022-03-03 17:40:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60948 states. [2022-03-03 17:40:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60948 to 27280. [2022-03-03 17:40:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27280 states, 27279 states have (on average 3.2549213680853404) internal successors, (88791), 27279 states have internal predecessors, (88791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27280 states to 27280 states and 88791 transitions. [2022-03-03 17:40:59,831 INFO L78 Accepts]: Start accepts. Automaton has 27280 states and 88791 transitions. Word has length 148 [2022-03-03 17:40:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:40:59,831 INFO L470 AbstractCegarLoop]: Abstraction has 27280 states and 88791 transitions. [2022-03-03 17:40:59,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.6862745098039214) internal successors, (376), 102 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:59,831 INFO L276 IsEmpty]: Start isEmpty. Operand 27280 states and 88791 transitions. [2022-03-03 17:40:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-03 17:40:59,880 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:40:59,880 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:40:59,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-03 17:41:00,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-03 17:41:00,088 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:41:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:41:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1475957881, now seen corresponding path program 9 times [2022-03-03 17:41:00,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:41:00,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534507649] [2022-03-03 17:41:00,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:41:00,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:41:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:41:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:41:01,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:41:01,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534507649] [2022-03-03 17:41:01,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534507649] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:41:01,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52770046] [2022-03-03 17:41:01,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:41:01,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:41:01,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:41:01,912 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:41:01,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-03 17:41:02,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-03 17:41:02,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:41:02,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-03 17:41:02,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:41:02,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:41:02,115 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 17:41:02,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 17:41:02,408 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:41:02,408 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-03 17:41:03,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-03 17:41:03,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:41:03,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-03 17:41:03,835 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-03 17:41:03,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 13 [2022-03-03 17:41:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:41:04,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:41:04,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1|) c_~W~0)) is different from false [2022-03-03 17:41:04,187 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) is different from false [2022-03-03 17:41:04,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_423)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-03 17:41:04,548 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-03 17:41:04,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 244 [2022-03-03 17:41:04,556 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-03 17:41:04,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 146 [2022-03-03 17:41:04,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 118 [2022-03-03 17:41:06,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:41:06,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:41:06,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-03 17:41:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 8 not checked. [2022-03-03 17:41:06,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52770046] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:41:06,114 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:41:06,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 27, 25] total 81 [2022-03-03 17:41:06,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662322183] [2022-03-03 17:41:06,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:41:06,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-03-03 17:41:06,115 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:41:06,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-03-03 17:41:06,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=5671, Unknown=3, NotChecked=462, Total=6480 [2022-03-03 17:41:06,116 INFO L87 Difference]: Start difference. First operand 27280 states and 88791 transitions. Second operand has 81 states, 81 states have (on average 4.432098765432099) internal successors, (359), 81 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:41:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:41:46,132 INFO L93 Difference]: Finished difference Result 122600 states and 396247 transitions. [2022-03-03 17:41:46,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2022-03-03 17:41:46,133 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 4.432098765432099) internal successors, (359), 81 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-03-03 17:41:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:41:46,799 INFO L225 Difference]: With dead ends: 122600 [2022-03-03 17:41:46,799 INFO L226 Difference]: Without dead ends: 103211 [2022-03-03 17:41:46,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 294 SyntacticMatches, 30 SemanticMatches, 324 ConstructedPredicates, 3 IntricatePredicates, 4 DeprecatedPredicates, 42530 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=10946, Invalid=93069, Unknown=3, NotChecked=1932, Total=105950 [2022-03-03 17:41:46,805 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 7271 mSDsluCounter, 25581 mSDsCounter, 0 mSdLazyCounter, 14146 mSolverCounterSat, 795 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7271 SdHoareTripleChecker+Valid, 22608 SdHoareTripleChecker+Invalid, 23153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 795 IncrementalHoareTripleChecker+Valid, 14146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8212 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:41:46,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7271 Valid, 22608 Invalid, 23153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [795 Valid, 14146 Invalid, 0 Unknown, 8212 Unchecked, 7.4s Time] [2022-03-03 17:41:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103211 states. [2022-03-03 17:41:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103211 to 35997. [2022-03-03 17:41:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35997 states, 35996 states have (on average 3.2472774752750304) internal successors, (116889), 35996 states have internal predecessors, (116889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:41:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35997 states to 35997 states and 116889 transitions. [2022-03-03 17:41:48,396 INFO L78 Accepts]: Start accepts. Automaton has 35997 states and 116889 transitions. Word has length 148 [2022-03-03 17:41:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:41:48,396 INFO L470 AbstractCegarLoop]: Abstraction has 35997 states and 116889 transitions. [2022-03-03 17:41:48,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 4.432098765432099) internal successors, (359), 81 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:41:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 35997 states and 116889 transitions. [2022-03-03 17:41:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-03 17:41:48,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:41:48,456 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:41:48,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-03 17:41:48,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-03 17:41:48,657 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:41:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:41:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash -790466885, now seen corresponding path program 10 times [2022-03-03 17:41:48,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:41:48,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087656879] [2022-03-03 17:41:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:41:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:41:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:41:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:41:49,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:41:49,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087656879] [2022-03-03 17:41:49,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087656879] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:41:49,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578162368] [2022-03-03 17:41:49,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:41:49,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:41:49,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:41:49,724 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:41:49,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-03 17:41:49,820 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:41:49,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:41:49,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-03 17:41:49,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:41:49,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:41:49,890 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:41:49,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-03 17:41:50,365 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:41:50,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-03 17:41:51,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-03 17:41:52,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:41:52,218 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-03 17:41:52,324 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-03 17:41:52,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-03-03 17:41:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:41:52,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:41:52,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-03 17:41:52,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-03 17:41:52,675 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) is different from false [2022-03-03 17:41:52,702 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-03 17:41:53,032 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-03 17:41:53,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 244 [2022-03-03 17:41:53,041 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-03 17:41:53,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 146 [2022-03-03 17:41:53,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 118 [2022-03-03 17:42:00,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:42:00,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-03 17:42:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-03-03 17:42:00,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578162368] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:42:00,360 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:42:00,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 36] total 97 [2022-03-03 17:42:00,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733466233] [2022-03-03 17:42:00,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:42:00,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-03-03 17:42:00,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:42:00,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-03-03 17:42:00,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=7917, Unknown=5, NotChecked=740, Total=9312 [2022-03-03 17:42:00,362 INFO L87 Difference]: Start difference. First operand 35997 states and 116889 transitions. Second operand has 97 states, 97 states have (on average 3.7938144329896906) internal successors, (368), 97 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:42:25,055 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (<= c_~d~0 0)) (.cse6 (<= c_~n~0 (+ c_~back~0 1)))) (let ((.cse1 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_33| |c_#StackHeapBarrier|)) (let ((.cse15 (<= c_~n~0 (+ c_~back~0 1)))) (and (or .cse15 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_33|))) (or (<= c_~front~0 c_~back~0) .cse15) (or (<= c_~d~0 0) .cse15) (or (<= c_~n~0 (+ 2 c_~front~0)) .cse15) (or (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_33|)) .cse15))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_33|) 0))))) (.cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse5 (or .cse9 .cse6)) (.cse10 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse6)) (.cse11 (or .cse6 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (.cse4 (or (<= c_~front~0 c_~back~0) .cse6)) (.cse7 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse6)) (.cse3 (< c_~back~0 0)) (.cse8 (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse14 (* c_~front~0 4))) (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse14 4)) c_~d~0 (select (select .cse13 c_~queue~0.base) (+ c_~queue~0.offset .cse14)))) c_~W~0))) (.cse12 (+ |c_#StackHeapBarrier| 1))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 .cse1 .cse2 .cse3) (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1 .cse3) (or (and .cse4 .cse5 (or .cse6 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) .cse7 (or (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse6)) .cse0 .cse3) (= c_~d~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or .cse8 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) (<= c_~v_assert~0 1) (or .cse0 (and (or (not (= |c_ULTIMATE.start_main_#t~ret9#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse6) .cse4 .cse5 .cse7 (or .cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)))) .cse3) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (or .cse6 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse4 .cse5 (or .cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|))) .cse7) .cse0 .cse2 .cse3) .cse9 (or (and .cse10 .cse11 .cse4 .cse5 .cse7) .cse0 .cse3) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0) (or .cse0 (and (or .cse6 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse4 (or .cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse5 .cse7) .cse3) (or (and .cse10 (or .cse6 (<= (+ c_~d~0 2) c_~W~0)) .cse11 .cse4 .cse7) .cse3 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) .cse8 (<= .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base|)))) is different from false [2022-03-03 17:42:26,005 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (<= c_~d~0 0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1)))) (let ((.cse4 (= (mod c_~v_assert~0 256) 0)) (.cse1 (or .cse6 .cse2)) (.cse7 (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2)) (.cse8 (or .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (.cse0 (or (<= c_~front~0 c_~back~0) .cse2)) (.cse3 (or (<= c_~n~0 (+ 2 c_~front~0)) .cse2)) (.cse5 (< c_~back~0 0)) (.cse11 (+ |c_#StackHeapBarrier| 1))) (and (or (and .cse0 .cse1 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) .cse3 (or (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2)) .cse4 .cse5) (= c_~d~0 0) (<= c_~v_assert~0 1) (or .cse4 (and (or (not (= |c_ULTIMATE.start_main_#t~ret9#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse2) .cse0 .cse1 .cse3 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)))) .cse5) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (or .cse2 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse0 .cse1 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|))) .cse3) .cse4 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) .cse6 (or (and .cse7 .cse8 .cse0 .cse1 .cse3) .cse4 .cse5) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0) (or .cse4 (and (or .cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse0 (or .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse1 .cse3) .cse5) (or (and .cse7 (or .cse2 (<= (+ c_~d~0 2) c_~W~0)) .cse8 .cse0 .cse3) .cse5 (<= |c_thread1Thread1of1ForFork1_~w~0#1| 1)) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse10 (* c_~front~0 4))) (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse10 4)) c_~d~0 (select (select .cse9 c_~queue~0.base) (+ c_~queue~0.offset .cse10)))) c_~W~0)) (<= .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base|)))) is different from false [2022-03-03 17:42:26,038 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse2 (* c_~front~0 4))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) c_~d~0 (select (select .cse1 c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) c_~W~0)))) (and (or (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) .cse0 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0)) is different from false [2022-03-03 17:42:31,727 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) c_~W~0))) is different from false [2022-03-03 17:42:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:42:32,532 INFO L93 Difference]: Finished difference Result 96923 states and 308898 transitions. [2022-03-03 17:42:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2022-03-03 17:42:32,533 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.7938144329896906) internal successors, (368), 97 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-03-03 17:42:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:42:32,821 INFO L225 Difference]: With dead ends: 96923 [2022-03-03 17:42:32,821 INFO L226 Difference]: Without dead ends: 95843 [2022-03-03 17:42:32,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 261 SyntacticMatches, 63 SemanticMatches, 244 ConstructedPredicates, 8 IntricatePredicates, 7 DeprecatedPredicates, 24331 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=7853, Invalid=48567, Unknown=18, NotChecked=3832, Total=60270 [2022-03-03 17:42:32,824 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 4377 mSDsluCounter, 22303 mSDsCounter, 0 mSdLazyCounter, 8143 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4377 SdHoareTripleChecker+Valid, 18981 SdHoareTripleChecker+Invalid, 23522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 8143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15056 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-03-03 17:42:32,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4377 Valid, 18981 Invalid, 23522 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [323 Valid, 8143 Invalid, 0 Unknown, 15056 Unchecked, 3.8s Time] [2022-03-03 17:42:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95843 states. [2022-03-03 17:42:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95843 to 39510. [2022-03-03 17:42:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39510 states, 39509 states have (on average 3.2510820319420892) internal successors, (128447), 39509 states have internal predecessors, (128447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:42:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39510 states to 39510 states and 128447 transitions. [2022-03-03 17:42:34,097 INFO L78 Accepts]: Start accepts. Automaton has 39510 states and 128447 transitions. Word has length 148 [2022-03-03 17:42:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:42:34,098 INFO L470 AbstractCegarLoop]: Abstraction has 39510 states and 128447 transitions. [2022-03-03 17:42:34,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.7938144329896906) internal successors, (368), 97 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:42:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 39510 states and 128447 transitions. [2022-03-03 17:42:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-03 17:42:34,164 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:42:34,165 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:42:34,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-03 17:42:34,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-03 17:42:34,377 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:42:34,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:42:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash 606033631, now seen corresponding path program 11 times [2022-03-03 17:42:34,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:42:34,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563634301] [2022-03-03 17:42:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:42:34,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:42:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:42:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:42:35,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:42:35,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563634301] [2022-03-03 17:42:35,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563634301] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:42:35,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164905691] [2022-03-03 17:42:35,559 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:42:35,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:42:35,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:42:35,560 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:42:35,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-03 17:42:35,650 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-03 17:42:35,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:42:35,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-03 17:42:35,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:42:36,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:42:37,130 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:42:38,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:42:38,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-03 17:42:38,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:42:38,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-03 17:42:39,107 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-03 17:42:39,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-03-03 17:42:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:42:39,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:42:39,525 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_505 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-03-03 17:42:39,535 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_505 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0))) is different from false [2022-03-03 17:42:39,542 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_505 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-03-03 17:42:39,583 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_504)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_505) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-03-03 17:42:41,622 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:42:41,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-03-03 17:42:41,662 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-03 17:42:41,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1958 treesize of output 1794 [2022-03-03 17:42:41,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:42:41,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1694 treesize of output 1390 [2022-03-03 17:42:41,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1390 treesize of output 1166 [2022-03-03 17:42:41,731 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-03 17:42:41,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1214 treesize of output 1102 [2022-03-03 17:45:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-03-03 17:45:02,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164905691] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:45:02,869 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:45:02,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 38, 38] total 102 [2022-03-03 17:45:02,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324146721] [2022-03-03 17:45:02,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:45:02,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-03-03 17:45:02,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:45:02,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-03-03 17:45:02,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=735, Invalid=8776, Unknown=11, NotChecked=780, Total=10302 [2022-03-03 17:45:02,871 INFO L87 Difference]: Start difference. First operand 39510 states and 128447 transitions. Second operand has 102 states, 102 states have (on average 3.6176470588235294) internal successors, (369), 102 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:45:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:45:52,608 INFO L93 Difference]: Finished difference Result 171136 states and 546553 transitions. [2022-03-03 17:45:52,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 269 states. [2022-03-03 17:45:52,609 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.6176470588235294) internal successors, (369), 102 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-03-03 17:45:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:45:53,525 INFO L225 Difference]: With dead ends: 171136 [2022-03-03 17:45:53,526 INFO L226 Difference]: Without dead ends: 169438 [2022-03-03 17:45:53,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 295 SyntacticMatches, 70 SemanticMatches, 357 ConstructedPredicates, 4 IntricatePredicates, 6 DeprecatedPredicates, 58377 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=18449, Invalid=107226, Unknown=11, NotChecked=2836, Total=128522 [2022-03-03 17:45:53,530 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 8283 mSDsluCounter, 21761 mSDsCounter, 0 mSdLazyCounter, 9412 mSolverCounterSat, 760 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8283 SdHoareTripleChecker+Valid, 17392 SdHoareTripleChecker+Invalid, 24952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 760 IncrementalHoareTripleChecker+Valid, 9412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14780 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:45:53,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8283 Valid, 17392 Invalid, 24952 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [760 Valid, 9412 Invalid, 0 Unknown, 14780 Unchecked, 5.0s Time] [2022-03-03 17:45:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169438 states. [2022-03-03 17:45:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169438 to 54740. [2022-03-03 17:45:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54740 states, 54739 states have (on average 3.2928990299420886) internal successors, (180250), 54739 states have internal predecessors, (180250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:45:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54740 states to 54740 states and 180250 transitions. [2022-03-03 17:45:55,381 INFO L78 Accepts]: Start accepts. Automaton has 54740 states and 180250 transitions. Word has length 148 [2022-03-03 17:45:55,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:45:55,381 INFO L470 AbstractCegarLoop]: Abstraction has 54740 states and 180250 transitions. [2022-03-03 17:45:55,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.6176470588235294) internal successors, (369), 102 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:45:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 54740 states and 180250 transitions. [2022-03-03 17:45:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-03 17:45:55,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:45:55,461 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:45:55,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-03 17:45:55,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-03 17:45:55,661 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:45:55,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:45:55,662 INFO L85 PathProgramCache]: Analyzing trace with hash -555131201, now seen corresponding path program 12 times [2022-03-03 17:45:55,662 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:45:55,662 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626801362] [2022-03-03 17:45:55,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:45:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:45:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:45:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:45:57,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:45:57,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626801362] [2022-03-03 17:45:57,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626801362] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:45:57,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928340052] [2022-03-03 17:45:57,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:45:57,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:45:57,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:45:57,472 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:45:57,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-03 17:45:57,562 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 17:45:57,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:45:57,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-03 17:45:57,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:45:57,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:45:57,686 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 17:45:57,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 17:45:58,222 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:45:58,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-03 17:45:58,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:45:59,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:46:00,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-03 17:46:00,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:46:00,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-03 17:46:00,469 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-03 17:46:00,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 13 [2022-03-03 17:46:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:46:00,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:46:00,822 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-03 17:46:00,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-03 17:46:00,832 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) c_~W~0)) is different from false [2022-03-03 17:46:00,854 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_547)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_548) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-03 17:46:02,498 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:46:02,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2022-03-03 17:46:02,536 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-03 17:46:02,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 15288 treesize of output 13723 [2022-03-03 17:46:02,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:46:02,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13622 treesize of output 11190 [2022-03-03 17:46:02,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11190 treesize of output 9398 [2022-03-03 17:46:02,691 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-03 17:46:02,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9447 treesize of output 8270 Received shutdown request... [2022-03-03 17:50:37,959 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-03 17:50:37,961 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-03 17:50:37,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-03 17:50:37,979 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 17:50:37,979 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 17:50:38,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-03 17:50:38,162 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 4ms.. [2022-03-03 17:50:38,163 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-03 17:50:38,163 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-03 17:50:38,163 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-03 17:50:38,165 INFO L732 BasicCegarLoop]: Path program histogram: [12, 2, 1, 1, 1] [2022-03-03 17:50:38,166 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 17:50:38,166 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 17:50:38,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:50:38 BasicIcfg [2022-03-03 17:50:38,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 17:50:38,168 INFO L158 Benchmark]: Toolchain (without parser) took 782233.85ms. Allocated memory was 229.6MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 171.3MB in the beginning and 679.8MB in the end (delta: -508.5MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-03-03 17:50:38,168 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 229.6MB. Free memory is still 187.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 17:50:38,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.67ms. Allocated memory was 229.6MB in the beginning and 314.6MB in the end (delta: 84.9MB). Free memory was 171.0MB in the beginning and 282.7MB in the end (delta: -111.6MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-03-03 17:50:38,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.54ms. Allocated memory is still 314.6MB. Free memory was 282.7MB in the beginning and 280.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 17:50:38,169 INFO L158 Benchmark]: Boogie Preprocessor took 28.66ms. Allocated memory is still 314.6MB. Free memory was 280.6MB in the beginning and 279.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 17:50:38,169 INFO L158 Benchmark]: RCFGBuilder took 474.12ms. Allocated memory is still 314.6MB. Free memory was 279.0MB in the beginning and 259.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-03-03 17:50:38,169 INFO L158 Benchmark]: TraceAbstraction took 781407.06ms. Allocated memory was 314.6MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 258.5MB in the beginning and 679.8MB in the end (delta: -421.2MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-03-03 17:50:38,170 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 229.6MB. Free memory is still 187.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.67ms. Allocated memory was 229.6MB in the beginning and 314.6MB in the end (delta: 84.9MB). Free memory was 171.0MB in the beginning and 282.7MB in the end (delta: -111.6MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.54ms. Allocated memory is still 314.6MB. Free memory was 282.7MB in the beginning and 280.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.66ms. Allocated memory is still 314.6MB. Free memory was 280.6MB in the beginning and 279.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 474.12ms. Allocated memory is still 314.6MB. Free memory was 279.0MB in the beginning and 259.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 781407.06ms. Allocated memory was 314.6MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 258.5MB in the beginning and 679.8MB in the end (delta: -421.2MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 4ms.. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 4ms.. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 4ms.. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 4ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 781.3s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.6s, AutomataDifference: 270.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55845 SdHoareTripleChecker+Valid, 35.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55845 mSDsluCounter, 155469 SdHoareTripleChecker+Invalid, 29.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 83826 IncrementalHoareTripleChecker+Unchecked, 178208 mSDsCounter, 4653 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71731 IncrementalHoareTripleChecker+Invalid, 160210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4653 mSolverCounterUnsat, 4648 mSDtfsCounter, 71731 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5977 GetRequests, 3170 SyntacticMatches, 457 SemanticMatches, 2350 ConstructedPredicates, 38 IntricatePredicates, 41 DeprecatedPredicates, 269362 ImplicationChecksByTransitivity, 245.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54740occurred in iteration=16, InterpolantAutomatonStates: 1619, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 419702 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 213.8s InterpolantComputationTime, 3851 NumberOfCodeBlocks, 3828 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 5505 ConstructedInterpolants, 633 QuantifiedInterpolants, 109437 SizeOfPredicates, 350 NumberOfNonLiveVariables, 4061 ConjunctsInSsa, 580 ConjunctsInUnsatCore, 40 InterpolantComputations, 4 PerfectInterpolantSequences, 94/624 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown