/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-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 16:12:39,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 16:12:39,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 16:12:39,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 16:12:39,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 16:12:39,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 16:12:39,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 16:12:39,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 16:12:39,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 16:12:39,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 16:12:39,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 16:12:39,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 16:12:39,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 16:12:39,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 16:12:39,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 16:12:39,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 16:12:39,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 16:12:39,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 16:12:39,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 16:12:39,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 16:12:39,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 16:12:39,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 16:12:39,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 16:12:39,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 16:12:39,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 16:12:39,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 16:12:39,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 16:12:39,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 16:12:39,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 16:12:39,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 16:12:39,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 16:12:39,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 16:12:39,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 16:12:39,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 16:12:39,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 16:12:39,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 16:12:39,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 16:12:39,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 16:12:39,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 16:12:39,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 16:12:39,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 16:12:39,332 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-01 16:12:39,357 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 16:12:39,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 16:12:39,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 16:12:39,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 16:12:39,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 16:12:39,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 16:12:39,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 16:12:39,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 16:12:39,359 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 16:12:39,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 16:12:39,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 16:12:39,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 16:12:39,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 16:12:39,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 16:12:39,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 16:12:39,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 16:12:39,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 16:12:39,361 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 16:12:39,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 16:12:39,361 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 16:12:39,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 16:12:39,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 16:12:39,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 16:12:39,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 16:12:39,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 16:12:39,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:12:39,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 16:12:39,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 16:12:39,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 16:12:39,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 16:12:39,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 16:12:39,365 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 16:12:39,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 16:12:39,365 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-01 16:12:39,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 16:12:39,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 16:12:39,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 16:12:39,538 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 16:12:39,538 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 16:12:39,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-03-01 16:12:39,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab0299a4/719bb10cdb9b4b58afd85a282b55e292/FLAG47307321a [2022-03-01 16:12:39,903 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 16:12:39,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-03-01 16:12:39,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab0299a4/719bb10cdb9b4b58afd85a282b55e292/FLAG47307321a [2022-03-01 16:12:40,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab0299a4/719bb10cdb9b4b58afd85a282b55e292 [2022-03-01 16:12:40,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 16:12:40,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 16:12:40,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 16:12:40,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 16:12:40,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 16:12:40,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56095921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40, skipping insertion in model container [2022-03-01 16:12:40,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 16:12:40,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 16:12:40,517 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-send-receive.wvr.c[3107,3120] [2022-03-01 16:12:40,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:12:40,528 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 16:12:40,544 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-send-receive.wvr.c[3107,3120] [2022-03-01 16:12:40,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:12:40,556 INFO L208 MainTranslator]: Completed translation [2022-03-01 16:12:40,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40 WrapperNode [2022-03-01 16:12:40,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 16:12:40,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 16:12:40,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 16:12:40,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 16:12:40,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,585 INFO L137 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-03-01 16:12:40,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 16:12:40,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 16:12:40,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 16:12:40,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 16:12:40,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 16:12:40,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 16:12:40,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 16:12:40,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 16:12:40,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40" (1/1) ... [2022-03-01 16:12:40,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:12:40,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:12:40,641 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-01 16:12:40,669 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-01 16:12:40,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 16:12:40,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 16:12:40,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 16:12:40,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 16:12:40,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-01 16:12:40,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-01 16:12:40,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-01 16:12:40,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-01 16:12:40,705 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-01 16:12:40,705 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-01 16:12:40,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 16:12:40,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-01 16:12:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-01 16:12:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-01 16:12:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 16:12:40,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 16:12:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 16:12:40,707 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 16:12:40,771 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 16:12:40,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 16:12:40,953 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 16:12:41,041 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 16:12:41,041 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-01 16:12:41,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:12:41 BoogieIcfgContainer [2022-03-01 16:12:41,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 16:12:41,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 16:12:41,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 16:12:41,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 16:12:41,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 04:12:40" (1/3) ... [2022-03-01 16:12:41,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b26e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:12:41, skipping insertion in model container [2022-03-01 16:12:41,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:12:40" (2/3) ... [2022-03-01 16:12:41,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b26e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:12:41, skipping insertion in model container [2022-03-01 16:12:41,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:12:41" (3/3) ... [2022-03-01 16:12:41,057 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-03-01 16:12:41,061 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 16:12:41,062 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 16:12:41,062 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-01 16:12:41,062 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 16:12:41,105 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,105 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,105 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,106 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,106 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,106 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,106 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,107 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,107 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,107 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,107 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,107 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-01 16:12:41,107 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,107 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,108 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-01 16:12:41,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,109 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,110 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,111 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,111 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-01 16:12:41,111 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-01 16:12:41,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,112 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-01 16:12:41,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,112 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-01 16:12:41,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,112 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,113 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,114 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-01 16:12:41,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,115 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-01 16:12:41,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,116 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-01 16:12:41,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,127 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-01 16:12:41,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,129 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,129 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,130 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,130 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,132 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,133 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,133 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-01 16:12:41,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,135 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-01 16:12:41,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:12:41,143 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-01 16:12:41,180 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 16:12:41,187 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-01 16:12:41,187 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-01 16:12:41,200 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142 places, 142 transitions, 308 flow [2022-03-01 16:12:41,347 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 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-01 16:12:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 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-01 16:12:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-01 16:12:41,391 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:12:41,392 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] [2022-03-01 16:12:41,393 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-01 16:12:41,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:12:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash 518546796, now seen corresponding path program 1 times [2022-03-01 16:12:41,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:12:41,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568538277] [2022-03-01 16:12:41,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:12:41,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:12:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:41,589 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-01 16:12:41,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:12:41,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568538277] [2022-03-01 16:12:41,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568538277] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:12:41,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:12:41,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 16:12:41,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270378798] [2022-03-01 16:12:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:12:41,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 16:12:41,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:12:41,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 16:12:41,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 16:12:41,621 INFO L87 Difference]: Start difference. First operand has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 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 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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-01 16:12:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:12:41,738 INFO L93 Difference]: Finished difference Result 3113 states and 10261 transitions. [2022-03-01 16:12:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 16:12:41,740 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-01 16:12:41,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:12:41,791 INFO L225 Difference]: With dead ends: 3113 [2022-03-01 16:12:41,791 INFO L226 Difference]: Without dead ends: 2945 [2022-03-01 16:12:41,792 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-01 16:12:41,797 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:12:41,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:12:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2022-03-01 16:12:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2945. [2022-03-01 16:12:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2944 states have (on average 3.297554347826087) internal successors, (9708), 2944 states have internal predecessors, (9708), 0 states have call successors, (0), 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-01 16:12:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 9708 transitions. [2022-03-01 16:12:41,934 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 9708 transitions. Word has length 96 [2022-03-01 16:12:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:12:41,935 INFO L470 AbstractCegarLoop]: Abstraction has 2945 states and 9708 transitions. [2022-03-01 16:12:41,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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-01 16:12:41,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 9708 transitions. [2022-03-01 16:12:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-01 16:12:41,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:12:41,978 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] [2022-03-01 16:12:41,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 16:12:41,979 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-01 16:12:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:12:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1430139861, now seen corresponding path program 1 times [2022-03-01 16:12:41,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:12:41,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493658870] [2022-03-01 16:12:41,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:12:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:12:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:42,147 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-01 16:12:42,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:12:42,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493658870] [2022-03-01 16:12:42,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493658870] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:12:42,148 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:12:42,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-01 16:12:42,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376189176] [2022-03-01 16:12:42,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:12:42,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-01 16:12:42,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:12:42,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-01 16:12:42,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-01 16:12:42,150 INFO L87 Difference]: Start difference. First operand 2945 states and 9708 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-01 16:12:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:12:42,252 INFO L93 Difference]: Finished difference Result 2975 states and 9924 transitions. [2022-03-01 16:12:42,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-01 16:12:42,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-01 16:12:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:12:42,267 INFO L225 Difference]: With dead ends: 2975 [2022-03-01 16:12:42,268 INFO L226 Difference]: Without dead ends: 2975 [2022-03-01 16:12:42,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-01 16:12:42,270 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 101 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:12:42,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 313 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:12:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2022-03-01 16:12:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2567. [2022-03-01 16:12:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2566 states have (on average 3.314886983632112) internal successors, (8506), 2566 states have internal predecessors, (8506), 0 states have call successors, (0), 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-01 16:12:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 8506 transitions. [2022-03-01 16:12:42,352 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 8506 transitions. Word has length 96 [2022-03-01 16:12:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:12:42,354 INFO L470 AbstractCegarLoop]: Abstraction has 2567 states and 8506 transitions. [2022-03-01 16:12:42,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-01 16:12:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 8506 transitions. [2022-03-01 16:12:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-01 16:12:42,362 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:12:42,363 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] [2022-03-01 16:12:42,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 16:12:42,363 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-01 16:12:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:12:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1635672389, now seen corresponding path program 2 times [2022-03-01 16:12:42,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:12:42,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947510170] [2022-03-01 16:12:42,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:12:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:12:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:42,475 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-01 16:12:42,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:12:42,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947510170] [2022-03-01 16:12:42,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947510170] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:12:42,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:12:42,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-01 16:12:42,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593251560] [2022-03-01 16:12:42,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:12:42,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-01 16:12:42,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:12:42,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-01 16:12:42,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-01 16:12:42,477 INFO L87 Difference]: Start difference. First operand 2567 states and 8506 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-01 16:12:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:12:42,567 INFO L93 Difference]: Finished difference Result 3707 states and 12439 transitions. [2022-03-01 16:12:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-01 16:12:42,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-01 16:12:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:12:42,591 INFO L225 Difference]: With dead ends: 3707 [2022-03-01 16:12:42,591 INFO L226 Difference]: Without dead ends: 3707 [2022-03-01 16:12:42,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-01 16:12:42,597 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:12:42,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 292 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:12:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2022-03-01 16:12:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 2552. [2022-03-01 16:12:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2551 states have (on average 3.3171305370442963) internal successors, (8462), 2551 states have internal predecessors, (8462), 0 states have call successors, (0), 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-01 16:12:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 8462 transitions. [2022-03-01 16:12:42,666 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 8462 transitions. Word has length 96 [2022-03-01 16:12:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:12:42,667 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 8462 transitions. [2022-03-01 16:12:42,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-01 16:12:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 8462 transitions. [2022-03-01 16:12:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-01 16:12:42,707 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:12:42,707 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] [2022-03-01 16:12:42,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 16:12:42,707 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-01 16:12:42,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:12:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1043909749, now seen corresponding path program 3 times [2022-03-01 16:12:42,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:12:42,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634014287] [2022-03-01 16:12:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:12:42,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:12:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:42,839 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-01 16:12:42,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:12:42,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634014287] [2022-03-01 16:12:42,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634014287] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:12:42,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:12:42,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:12:42,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911976029] [2022-03-01 16:12:42,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:12:42,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-01 16:12:42,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:12:42,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-01 16:12:42,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-01 16:12:42,841 INFO L87 Difference]: Start difference. First operand 2552 states and 8462 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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-01 16:12:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:12:42,987 INFO L93 Difference]: Finished difference Result 6261 states and 21083 transitions. [2022-03-01 16:12:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-01 16:12:42,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-01 16:12:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:12:43,009 INFO L225 Difference]: With dead ends: 6261 [2022-03-01 16:12:43,010 INFO L226 Difference]: Without dead ends: 3651 [2022-03-01 16:12:43,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-01 16:12:43,013 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 237 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:12:43,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 354 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:12:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2022-03-01 16:12:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 2628. [2022-03-01 16:12:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2627 states have (on average 3.2401979444232967) internal successors, (8512), 2627 states have internal predecessors, (8512), 0 states have call successors, (0), 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-01 16:12:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 8512 transitions. [2022-03-01 16:12:43,096 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 8512 transitions. Word has length 96 [2022-03-01 16:12:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:12:43,097 INFO L470 AbstractCegarLoop]: Abstraction has 2628 states and 8512 transitions. [2022-03-01 16:12:43,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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-01 16:12:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 8512 transitions. [2022-03-01 16:12:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-01 16:12:43,104 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:12:43,104 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] [2022-03-01 16:12:43,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 16:12:43,105 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-01 16:12:43,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:12:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1775513332, now seen corresponding path program 1 times [2022-03-01 16:12:43,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:12:43,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404649448] [2022-03-01 16:12:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:12:43,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:12:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:43,237 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-01 16:12:43,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:12:43,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404649448] [2022-03-01 16:12:43,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404649448] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:12:43,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:12:43,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 16:12:43,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667886027] [2022-03-01 16:12:43,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:12:43,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:12:43,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:12:43,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:12:43,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:12:43,239 INFO L87 Difference]: Start difference. First operand 2628 states and 8512 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-01 16:12:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:12:43,270 INFO L93 Difference]: Finished difference Result 2664 states and 8430 transitions. [2022-03-01 16:12:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:12:43,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-03-01 16:12:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:12:43,288 INFO L225 Difference]: With dead ends: 2664 [2022-03-01 16:12:43,288 INFO L226 Difference]: Without dead ends: 2664 [2022-03-01 16:12:43,288 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-01 16:12:43,289 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:12:43,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 156 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:12:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2022-03-01 16:12:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2664. [2022-03-01 16:12:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2663 states have (on average 3.1656027037176115) internal successors, (8430), 2663 states have internal predecessors, (8430), 0 states have call successors, (0), 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-01 16:12:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 8430 transitions. [2022-03-01 16:12:43,371 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 8430 transitions. Word has length 99 [2022-03-01 16:12:43,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:12:43,371 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 8430 transitions. [2022-03-01 16:12:43,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-01 16:12:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 8430 transitions. [2022-03-01 16:12:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-01 16:12:43,379 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:12:43,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:12:43,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 16:12:43,379 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-01 16:12:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:12:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1192942030, now seen corresponding path program 1 times [2022-03-01 16:12:43,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:12:43,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353287078] [2022-03-01 16:12:43,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:12:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:12:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:12:43,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:12:43,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353287078] [2022-03-01 16:12:43,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353287078] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:12:43,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:12:43,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 16:12:43,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620725989] [2022-03-01 16:12:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:12:43,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:12:43,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:12:43,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:12:43,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:12:43,486 INFO L87 Difference]: Start difference. First operand 2664 states and 8430 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 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-01 16:12:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:12:43,575 INFO L93 Difference]: Finished difference Result 3417 states and 10384 transitions. [2022-03-01 16:12:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 16:12:43,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-03-01 16:12:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:12:43,585 INFO L225 Difference]: With dead ends: 3417 [2022-03-01 16:12:43,586 INFO L226 Difference]: Without dead ends: 2670 [2022-03-01 16:12:43,587 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-01 16:12:43,589 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 311 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:12:43,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 313 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:12:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2022-03-01 16:12:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2665. [2022-03-01 16:12:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2664 states have (on average 3.16478978978979) internal successors, (8431), 2664 states have internal predecessors, (8431), 0 states have call successors, (0), 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-01 16:12:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 8431 transitions. [2022-03-01 16:12:43,656 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 8431 transitions. Word has length 110 [2022-03-01 16:12:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:12:43,657 INFO L470 AbstractCegarLoop]: Abstraction has 2665 states and 8431 transitions. [2022-03-01 16:12:43,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 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-01 16:12:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 8431 transitions. [2022-03-01 16:12:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-03-01 16:12:43,663 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:12:43,663 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] [2022-03-01 16:12:43,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-01 16:12:43,664 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-01 16:12:43,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:12:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash 623162093, now seen corresponding path program 1 times [2022-03-01 16:12:43,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:12:43,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100883765] [2022-03-01 16:12:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:12:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:12:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:12:43,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:12:43,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100883765] [2022-03-01 16:12:43,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100883765] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:12:43,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781124892] [2022-03-01 16:12:43,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:12:43,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:12:43,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:12:43,964 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-01 16:12:43,965 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-01 16:12:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:44,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-01 16:12:44,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:12:44,140 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-01 16:12:44,190 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 16:12:44,190 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-01 16:12:44,240 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 16:12:44,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-03-01 16:12:44,843 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-01 16:12:44,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-03-01 16:12:45,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01 16:12:45,411 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 6 treesize of output 5 [2022-03-01 16:12:45,534 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-01 16:12:45,807 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-01 16:12:45,884 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-01 16:12:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:12:45,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:12:46,152 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_124 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_124) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_124 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_124) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (< c_~front~0 0)) is different from false [2022-03-01 16:12:47,639 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:12:47,639 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 100 treesize of output 76 [2022-03-01 16:12:47,651 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:12:47,651 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 1496 treesize of output 1432 [2022-03-01 16:12:47,674 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:12:47,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1416 treesize of output 1372 [2022-03-01 16:12:47,685 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 1229 treesize of output 1133 [2022-03-01 16:12:47,699 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:12:47,700 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 1260 treesize of output 1156 [2022-03-01 16:12:47,709 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 1037 treesize of output 941 [2022-03-01 16:12:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:12:54,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781124892] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:12:54,742 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:12:54,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 27] total 61 [2022-03-01 16:12:54,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223548742] [2022-03-01 16:12:54,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:12:54,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-01 16:12:54,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:12:54,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-01 16:12:54,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=3099, Unknown=32, NotChecked=116, Total=3660 [2022-03-01 16:12:54,744 INFO L87 Difference]: Start difference. First operand 2665 states and 8431 transitions. Second operand has 61 states, 61 states have (on average 4.721311475409836) internal successors, (288), 61 states have internal predecessors, (288), 0 states have call successors, (0), 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-01 16:12:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:12:59,342 INFO L93 Difference]: Finished difference Result 17744 states and 59027 transitions. [2022-03-01 16:12:59,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-01 16:12:59,342 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.721311475409836) internal successors, (288), 61 states have internal predecessors, (288), 0 states have call successors, (0), 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 117 [2022-03-01 16:12:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:12:59,367 INFO L225 Difference]: With dead ends: 17744 [2022-03-01 16:12:59,368 INFO L226 Difference]: Without dead ends: 9593 [2022-03-01 16:12:59,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 203 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3473 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1368, Invalid=9523, Unknown=33, NotChecked=206, Total=11130 [2022-03-01 16:12:59,371 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 2718 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2718 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1465 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:12:59,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2718 Valid, 2938 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1040 Invalid, 0 Unknown, 1465 Unchecked, 0.6s Time] [2022-03-01 16:12:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9593 states. [2022-03-01 16:12:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9593 to 4109. [2022-03-01 16:12:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4109 states, 4108 states have (on average 3.057205452775073) internal successors, (12559), 4108 states have internal predecessors, (12559), 0 states have call successors, (0), 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-01 16:12:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 12559 transitions. [2022-03-01 16:12:59,568 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 12559 transitions. Word has length 117 [2022-03-01 16:12:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:12:59,569 INFO L470 AbstractCegarLoop]: Abstraction has 4109 states and 12559 transitions. [2022-03-01 16:12:59,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.721311475409836) internal successors, (288), 61 states have internal predecessors, (288), 0 states have call successors, (0), 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-01 16:12:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 12559 transitions. [2022-03-01 16:12:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-01 16:12:59,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:12:59,576 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-01 16:12:59,599 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-01 16:12:59,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:12:59,784 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-01 16:12:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:12:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash 869306436, now seen corresponding path program 2 times [2022-03-01 16:12:59,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:12:59,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167400517] [2022-03-01 16:12:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:12:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:12:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:12:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 16:12:59,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:12:59,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167400517] [2022-03-01 16:12:59,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167400517] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:12:59,861 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:12:59,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-01 16:12:59,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701868661] [2022-03-01 16:12:59,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:12:59,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-01 16:12:59,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:12:59,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-01 16:12:59,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-01 16:12:59,862 INFO L87 Difference]: Start difference. First operand 4109 states and 12559 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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-01 16:12:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:12:59,920 INFO L93 Difference]: Finished difference Result 9989 states and 31073 transitions. [2022-03-01 16:12:59,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 16:12:59,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 120 [2022-03-01 16:12:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:12:59,947 INFO L225 Difference]: With dead ends: 9989 [2022-03-01 16:12:59,947 INFO L226 Difference]: Without dead ends: 9917 [2022-03-01 16:12:59,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-01 16:12:59,948 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 147 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:12:59,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 207 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:12:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9917 states. [2022-03-01 16:13:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9917 to 8399. [2022-03-01 16:13:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8398 states have (on average 3.1245534651107407) internal successors, (26240), 8398 states have internal predecessors, (26240), 0 states have call successors, (0), 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-01 16:13:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 26240 transitions. [2022-03-01 16:13:00,149 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 26240 transitions. Word has length 120 [2022-03-01 16:13:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:13:00,149 INFO L470 AbstractCegarLoop]: Abstraction has 8399 states and 26240 transitions. [2022-03-01 16:13:00,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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-01 16:13:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 26240 transitions. [2022-03-01 16:13:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-01 16:13:00,170 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:13:00,171 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] [2022-03-01 16:13:00,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-01 16:13:00,172 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-01 16:13:00,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:13:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1680628146, now seen corresponding path program 1 times [2022-03-01 16:13:00,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:13:00,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097660493] [2022-03-01 16:13:00,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:13:00,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:13:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:13:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:13:00,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:13:00,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097660493] [2022-03-01 16:13:00,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097660493] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:13:00,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:13:00,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 16:13:00,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154416154] [2022-03-01 16:13:00,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:13:00,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:13:00,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:13:00,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:13:00,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:13:00,229 INFO L87 Difference]: Start difference. First operand 8399 states and 26240 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-01 16:13:00,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:13:00,273 INFO L93 Difference]: Finished difference Result 8199 states and 25593 transitions. [2022-03-01 16:13:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:13:00,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 124 [2022-03-01 16:13:00,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:13:00,298 INFO L225 Difference]: With dead ends: 8199 [2022-03-01 16:13:00,298 INFO L226 Difference]: Without dead ends: 8199 [2022-03-01 16:13:00,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01 16:13:00,300 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:13:00,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 223 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:13:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2022-03-01 16:13:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8149. [2022-03-01 16:13:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8149 states, 8148 states have (on average 3.125306823760432) internal successors, (25465), 8148 states have internal predecessors, (25465), 0 states have call successors, (0), 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-01 16:13:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8149 states to 8149 states and 25465 transitions. [2022-03-01 16:13:00,502 INFO L78 Accepts]: Start accepts. Automaton has 8149 states and 25465 transitions. Word has length 124 [2022-03-01 16:13:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:13:00,502 INFO L470 AbstractCegarLoop]: Abstraction has 8149 states and 25465 transitions. [2022-03-01 16:13:00,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-01 16:13:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 8149 states and 25465 transitions. [2022-03-01 16:13:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-03-01 16:13:00,518 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:13:00,518 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-01 16:13:00,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 16:13:00,518 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-01 16:13:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:13:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1813426250, now seen corresponding path program 3 times [2022-03-01 16:13:00,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:13:00,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141224301] [2022-03-01 16:13:00,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:13:00,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:13:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:13:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-01 16:13:00,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:13:00,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141224301] [2022-03-01 16:13:00,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141224301] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:13:00,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:13:00,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-01 16:13:00,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643097275] [2022-03-01 16:13:00,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:13:00,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-01 16:13:00,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:13:00,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-01 16:13:00,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-01 16:13:00,614 INFO L87 Difference]: Start difference. First operand 8149 states and 25465 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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-01 16:13:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:13:00,690 INFO L93 Difference]: Finished difference Result 13321 states and 41453 transitions. [2022-03-01 16:13:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 16:13:00,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 131 [2022-03-01 16:13:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:13:00,725 INFO L225 Difference]: With dead ends: 13321 [2022-03-01 16:13:00,725 INFO L226 Difference]: Without dead ends: 13321 [2022-03-01 16:13:00,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-01 16:13:00,726 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 73 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:13:00,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 382 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:13:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2022-03-01 16:13:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 12814. [2022-03-01 16:13:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12814 states, 12813 states have (on average 3.1134784984000623) internal successors, (39893), 12813 states have internal predecessors, (39893), 0 states have call successors, (0), 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-01 16:13:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12814 states to 12814 states and 39893 transitions. [2022-03-01 16:13:00,969 INFO L78 Accepts]: Start accepts. Automaton has 12814 states and 39893 transitions. Word has length 131 [2022-03-01 16:13:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:13:00,969 INFO L470 AbstractCegarLoop]: Abstraction has 12814 states and 39893 transitions. [2022-03-01 16:13:00,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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-01 16:13:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 12814 states and 39893 transitions. [2022-03-01 16:13:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-03-01 16:13:00,990 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:13:00,990 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:13:00,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 16:13:00,990 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-01 16:13:00,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:13:00,990 INFO L85 PathProgramCache]: Analyzing trace with hash 154122346, now seen corresponding path program 1 times [2022-03-01 16:13:00,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:13:00,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075354005] [2022-03-01 16:13:00,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:13:00,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:13:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:13:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-01 16:13:01,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:13:01,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075354005] [2022-03-01 16:13:01,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075354005] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:13:01,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216538260] [2022-03-01 16:13:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:13:01,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:13:01,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:13:01,408 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-01 16:13:01,409 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-01 16:13:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:13:01,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-01 16:13:01,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:13:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 16:13:01,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:13:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:13:02,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216538260] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:13:02,542 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:13:02,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 31 [2022-03-01 16:13:02,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942775147] [2022-03-01 16:13:02,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:13:02,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-01 16:13:02,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:13:02,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-01 16:13:02,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2022-03-01 16:13:02,544 INFO L87 Difference]: Start difference. First operand 12814 states and 39893 transitions. Second operand has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 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-01 16:13:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:13:03,200 INFO L93 Difference]: Finished difference Result 14512 states and 46254 transitions. [2022-03-01 16:13:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:13:03,201 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 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 131 [2022-03-01 16:13:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:13:03,236 INFO L225 Difference]: With dead ends: 14512 [2022-03-01 16:13:03,236 INFO L226 Difference]: Without dead ends: 13555 [2022-03-01 16:13:03,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=549, Invalid=1803, Unknown=0, NotChecked=0, Total=2352 [2022-03-01 16:13:03,237 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 1174 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:13:03,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1174 Valid, 1719 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:13:03,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13555 states. [2022-03-01 16:13:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13555 to 9707. [2022-03-01 16:13:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9707 states, 9706 states have (on average 3.217494333402019) internal successors, (31229), 9706 states have internal predecessors, (31229), 0 states have call successors, (0), 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-01 16:13:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 31229 transitions. [2022-03-01 16:13:03,438 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 31229 transitions. Word has length 131 [2022-03-01 16:13:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:13:03,439 INFO L470 AbstractCegarLoop]: Abstraction has 9707 states and 31229 transitions. [2022-03-01 16:13:03,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 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-01 16:13:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 31229 transitions. [2022-03-01 16:13:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-01 16:13:03,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:13:03,456 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:13:03,475 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-01 16:13:03,673 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,SelfDestructingSolverStorable10 [2022-03-01 16:13:03,673 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-01 16:13:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:13:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1700635271, now seen corresponding path program 2 times [2022-03-01 16:13:03,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:13:03,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353513199] [2022-03-01 16:13:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:13:03,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:13:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:13:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:13:03,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:13:03,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353513199] [2022-03-01 16:13:03,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353513199] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:13:03,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489021495] [2022-03-01 16:13:03,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:13:03,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:13:03,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:13:03,984 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-01 16:13:03,985 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-01 16:13:04,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 16:13:04,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:13:04,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-01 16:13:04,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:13:05,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:13:05,248 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 32 treesize of output 32 [2022-03-01 16:13:05,403 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-01 16:13:05,403 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 48 treesize of output 14 [2022-03-01 16:13:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:13:05,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:13:06,023 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-01 16:13:06,024 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 133 treesize of output 134 [2022-03-01 16:13:06,031 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-01 16:13:06,031 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 71 treesize of output 58 [2022-03-01 16:13:06,037 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-01 16:13:06,038 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 58 treesize of output 45 [2022-03-01 16:13:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:13:07,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489021495] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:13:07,746 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:13:07,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26, 25] total 59 [2022-03-01 16:13:07,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379867011] [2022-03-01 16:13:07,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:13:07,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-01 16:13:07,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:13:07,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-01 16:13:07,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=3069, Unknown=1, NotChecked=0, Total=3422 [2022-03-01 16:13:07,749 INFO L87 Difference]: Start difference. First operand 9707 states and 31229 transitions. Second operand has 59 states, 59 states have (on average 5.813559322033898) internal successors, (343), 59 states have internal predecessors, (343), 0 states have call successors, (0), 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-01 16:13:20,432 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 c_~v_assert~0)) is different from false [2022-03-01 16:13:22,088 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-03-01 16:13:31,395 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-03-01 16:13:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:13:33,503 INFO L93 Difference]: Finished difference Result 154088 states and 515217 transitions. [2022-03-01 16:13:33,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2022-03-01 16:13:33,504 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 5.813559322033898) internal successors, (343), 59 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-03-01 16:13:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:13:34,331 INFO L225 Difference]: With dead ends: 154088 [2022-03-01 16:13:34,332 INFO L226 Difference]: Without dead ends: 114740 [2022-03-01 16:13:34,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 252 SyntacticMatches, 34 SemanticMatches, 368 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 62306 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=13076, Invalid=121123, Unknown=135, NotChecked=2196, Total=136530 [2022-03-01 16:13:34,345 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 7100 mSDsluCounter, 10595 mSDsCounter, 0 mSdLazyCounter, 5056 mSolverCounterSat, 960 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7100 SdHoareTripleChecker+Valid, 9621 SdHoareTripleChecker+Invalid, 8918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 960 IncrementalHoareTripleChecker+Valid, 5056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2902 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:13:34,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7100 Valid, 9621 Invalid, 8918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [960 Valid, 5056 Invalid, 0 Unknown, 2902 Unchecked, 2.9s Time] [2022-03-01 16:13:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114740 states. [2022-03-01 16:13:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114740 to 24922. [2022-03-01 16:13:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24922 states, 24921 states have (on average 3.153926407447534) internal successors, (78599), 24921 states have internal predecessors, (78599), 0 states have call successors, (0), 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-01 16:13:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24922 states to 24922 states and 78599 transitions. [2022-03-01 16:13:36,015 INFO L78 Accepts]: Start accepts. Automaton has 24922 states and 78599 transitions. Word has length 138 [2022-03-01 16:13:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:13:36,016 INFO L470 AbstractCegarLoop]: Abstraction has 24922 states and 78599 transitions. [2022-03-01 16:13:36,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 5.813559322033898) internal successors, (343), 59 states have internal predecessors, (343), 0 states have call successors, (0), 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-01 16:13:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 24922 states and 78599 transitions. [2022-03-01 16:13:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-01 16:13:36,054 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:13:36,054 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:13:36,074 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-01 16:13:36,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:13:36,268 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-01 16:13:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:13:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1880030863, now seen corresponding path program 3 times [2022-03-01 16:13:36,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:13:36,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61179666] [2022-03-01 16:13:36,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:13:36,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:13:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:13:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:13:37,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:13:37,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61179666] [2022-03-01 16:13:37,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61179666] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:13:37,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717727477] [2022-03-01 16:13:37,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:13:37,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:13:37,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:13:37,601 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-01 16:13:37,602 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-01 16:13:37,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-01 16:13:37,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:13:37,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-01 16:13:37,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:13:39,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:13:39,169 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 44 treesize of output 42 [2022-03-01 16:13:39,264 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-01 16:13:39,264 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 50 treesize of output 16 [2022-03-01 16:13:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:13:39,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:13:39,582 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-03-01 16:13:39,609 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~front~0 0)) is different from false [2022-03-01 16:13:39,633 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-01 16:13:39,660 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-01 16:13:39,671 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-01 16:13:39,694 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-01 16:13:39,775 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-01 16:13:39,775 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 137 treesize of output 122 [2022-03-01 16:13:39,778 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 59 treesize of output 52 [2022-03-01 16:13:39,781 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 52 treesize of output 45 [2022-03-01 16:13:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-03-01 16:13:41,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717727477] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:13:41,767 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:13:41,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 28] total 82 [2022-03-01 16:13:41,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349223847] [2022-03-01 16:13:41,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:13:41,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-03-01 16:13:41,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:13:41,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-03-01 16:13:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=5245, Unknown=6, NotChecked=918, Total=6642 [2022-03-01 16:13:41,769 INFO L87 Difference]: Start difference. First operand 24922 states and 78599 transitions. Second operand has 82 states, 82 states have (on average 4.390243902439025) internal successors, (360), 82 states have internal predecessors, (360), 0 states have call successors, (0), 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-01 16:13:49,392 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-03-01 16:13:49,546 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-03-01 16:13:54,979 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (or (< (+ c_~back~0 1) 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= (* c_~front~0 4) (* c_~back~0 4))) (<= 2 c_~front~0) (<= 1 c_~back~0) (< c_~front~0 0))) is different from false [2022-03-01 16:13:55,570 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-03-01 16:13:58,121 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0)) is different from false [2022-03-01 16:13:58,306 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0))) is different from false [2022-03-01 16:13:59,007 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-03-01 16:13:59,306 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-03-01 16:13:59,375 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0))) is different from false [2022-03-01 16:14:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:14:02,990 INFO L93 Difference]: Finished difference Result 138535 states and 444968 transitions. [2022-03-01 16:14:02,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2022-03-01 16:14:02,990 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 4.390243902439025) internal successors, (360), 82 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-03-01 16:14:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:14:03,821 INFO L225 Difference]: With dead ends: 138535 [2022-03-01 16:14:03,821 INFO L226 Difference]: Without dead ends: 117936 [2022-03-01 16:14:03,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 226 SyntacticMatches, 14 SemanticMatches, 288 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 31290 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=9670, Invalid=65700, Unknown=40, NotChecked=8400, Total=83810 [2022-03-01 16:14:03,840 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 6283 mSDsluCounter, 14059 mSDsCounter, 0 mSdLazyCounter, 7421 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6283 SdHoareTripleChecker+Valid, 12892 SdHoareTripleChecker+Invalid, 16124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 7421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8039 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:14:03,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6283 Valid, 12892 Invalid, 16124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 7421 Invalid, 0 Unknown, 8039 Unchecked, 3.6s Time] [2022-03-01 16:14:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117936 states. [2022-03-01 16:14:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117936 to 31841. [2022-03-01 16:14:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31841 states, 31840 states have (on average 3.1207914572864324) internal successors, (99366), 31840 states have internal predecessors, (99366), 0 states have call successors, (0), 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-01 16:14:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31841 states to 31841 states and 99366 transitions. [2022-03-01 16:14:05,552 INFO L78 Accepts]: Start accepts. Automaton has 31841 states and 99366 transitions. Word has length 138 [2022-03-01 16:14:05,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:14:05,552 INFO L470 AbstractCegarLoop]: Abstraction has 31841 states and 99366 transitions. [2022-03-01 16:14:05,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 4.390243902439025) internal successors, (360), 82 states have internal predecessors, (360), 0 states have call successors, (0), 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-01 16:14:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 31841 states and 99366 transitions. [2022-03-01 16:14:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-01 16:14:05,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:14:05,596 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:14:05,613 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-01 16:14:05,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:14:05,813 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-01 16:14:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:14:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash 412402409, now seen corresponding path program 4 times [2022-03-01 16:14:05,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:14:05,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117820079] [2022-03-01 16:14:05,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:14:05,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:14:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:14:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:14:07,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:14:07,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117820079] [2022-03-01 16:14:07,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117820079] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:14:07,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751387003] [2022-03-01 16:14:07,196 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:14:07,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:14:07,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:14:07,197 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-01 16:14:07,198 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-01 16:14:07,313 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:14:07,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:14:07,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-01 16:14:07,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:14:07,344 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-01 16:14:07,591 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 16:14:07,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 16:14:08,879 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-01 16:14:09,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:14:09,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:14:09,143 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:14:09,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 44 treesize of output 19 [2022-03-01 16:14:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:14:09,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:14:09,876 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-01 16:14:09,877 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 154 treesize of output 144 [2022-03-01 16:14:09,887 INFO L353 Elim1Store]: treesize reduction 37, result has 27.5 percent of original size [2022-03-01 16:14:09,887 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 100 treesize of output 82 [2022-03-01 16:14:13,250 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-01 16:14:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:14:13,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751387003] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:14:13,287 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:14:13,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 28] total 80 [2022-03-01 16:14:13,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314832453] [2022-03-01 16:14:13,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:14:13,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-03-01 16:14:13,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:14:13,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-03-01 16:14:13,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=5600, Unknown=1, NotChecked=0, Total=6320 [2022-03-01 16:14:13,289 INFO L87 Difference]: Start difference. First operand 31841 states and 99366 transitions. Second operand has 80 states, 80 states have (on average 4.3625) internal successors, (349), 80 states have internal predecessors, (349), 0 states have call successors, (0), 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-01 16:14:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:14:34,920 INFO L93 Difference]: Finished difference Result 164154 states and 534058 transitions. [2022-03-01 16:14:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-03-01 16:14:34,928 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 4.3625) internal successors, (349), 80 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-03-01 16:14:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:14:35,886 INFO L225 Difference]: With dead ends: 164154 [2022-03-01 16:14:35,887 INFO L226 Difference]: Without dead ends: 128178 [2022-03-01 16:14:35,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 242 SyntacticMatches, 14 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 21615 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=7822, Invalid=45255, Unknown=53, NotChecked=0, Total=53130 [2022-03-01 16:14:35,894 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 4439 mSDsluCounter, 11378 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 590 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4439 SdHoareTripleChecker+Valid, 9615 SdHoareTripleChecker+Invalid, 10441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 590 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6617 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:14:35,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4439 Valid, 9615 Invalid, 10441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [590 Valid, 3234 Invalid, 0 Unknown, 6617 Unchecked, 1.7s Time] [2022-03-01 16:14:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128178 states. [2022-03-01 16:14:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128178 to 41356. [2022-03-01 16:14:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41356 states, 41355 states have (on average 3.0856970136621933) internal successors, (127609), 41355 states have internal predecessors, (127609), 0 states have call successors, (0), 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-01 16:14:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41356 states to 41356 states and 127609 transitions. [2022-03-01 16:14:37,585 INFO L78 Accepts]: Start accepts. Automaton has 41356 states and 127609 transitions. Word has length 138 [2022-03-01 16:14:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:14:37,585 INFO L470 AbstractCegarLoop]: Abstraction has 41356 states and 127609 transitions. [2022-03-01 16:14:37,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 4.3625) internal successors, (349), 80 states have internal predecessors, (349), 0 states have call successors, (0), 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-01 16:14:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 41356 states and 127609 transitions. [2022-03-01 16:14:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-01 16:14:37,860 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:14:37,860 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:14:37,882 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-01 16:14:38,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-01 16:14:38,076 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-01 16:14:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:14:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash -547652913, now seen corresponding path program 5 times [2022-03-01 16:14:38,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:14:38,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586089907] [2022-03-01 16:14:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:14:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:14:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:14:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:14:39,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:14:39,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586089907] [2022-03-01 16:14:39,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586089907] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:14:39,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131275390] [2022-03-01 16:14:39,398 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:14:39,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:14:39,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:14:39,399 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-01 16:14:39,403 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-01 16:14:39,488 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-01 16:14:39,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:14:39,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-01 16:14:39,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:14:39,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 16:14:39,603 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 16:14:39,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 16:14:40,033 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 48 treesize of output 46 [2022-03-01 16:14:40,100 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-01 16:14:40,101 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 53 treesize of output 19 [2022-03-01 16:14:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:14:40,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:14:40,410 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_356 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-03-01 16:14:40,606 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-01 16:14:40,606 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 137 treesize of output 122 [2022-03-01 16:14:40,609 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 59 treesize of output 52 [2022-03-01 16:14:40,611 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 52 treesize of output 45 [2022-03-01 16:14:41,900 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-01 16:14:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 3 not checked. [2022-03-01 16:14:41,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131275390] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:14:41,947 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:14:41,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 17] total 56 [2022-03-01 16:14:41,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460227836] [2022-03-01 16:14:41,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:14:41,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-01 16:14:41,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:14:41,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-01 16:14:41,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2789, Unknown=2, NotChecked=106, Total=3080 [2022-03-01 16:14:41,948 INFO L87 Difference]: Start difference. First operand 41356 states and 127609 transitions. Second operand has 56 states, 56 states have (on average 6.089285714285714) internal successors, (341), 56 states have internal predecessors, (341), 0 states have call successors, (0), 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-01 16:14:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:14:51,260 INFO L93 Difference]: Finished difference Result 120589 states and 371005 transitions. [2022-03-01 16:14:51,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-03-01 16:14:51,260 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 6.089285714285714) internal successors, (341), 56 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-03-01 16:14:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:14:51,861 INFO L225 Difference]: With dead ends: 120589 [2022-03-01 16:14:51,861 INFO L226 Difference]: Without dead ends: 103142 [2022-03-01 16:14:51,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 258 SyntacticMatches, 5 SemanticMatches, 162 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7758 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3358, Invalid=23034, Unknown=18, NotChecked=322, Total=26732 [2022-03-01 16:14:51,864 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 3406 mSDsluCounter, 10501 mSDsCounter, 0 mSdLazyCounter, 5173 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3406 SdHoareTripleChecker+Valid, 9607 SdHoareTripleChecker+Invalid, 7021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 5173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1449 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:14:51,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3406 Valid, 9607 Invalid, 7021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 5173 Invalid, 0 Unknown, 1449 Unchecked, 2.1s Time] [2022-03-01 16:14:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103142 states. [2022-03-01 16:14:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103142 to 39571. [2022-03-01 16:14:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39571 states, 39570 states have (on average 3.0909274703057874) internal successors, (122308), 39570 states have internal predecessors, (122308), 0 states have call successors, (0), 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-01 16:14:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39571 states to 39571 states and 122308 transitions. [2022-03-01 16:14:53,445 INFO L78 Accepts]: Start accepts. Automaton has 39571 states and 122308 transitions. Word has length 138 [2022-03-01 16:14:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:14:53,445 INFO L470 AbstractCegarLoop]: Abstraction has 39571 states and 122308 transitions. [2022-03-01 16:14:53,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 6.089285714285714) internal successors, (341), 56 states have internal predecessors, (341), 0 states have call successors, (0), 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-01 16:14:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 39571 states and 122308 transitions. [2022-03-01 16:14:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-03-01 16:14:53,494 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:14:53,494 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-03-01 16:14:53,511 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-01 16:14:53,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-01 16:14:53,711 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-01 16:14:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:14:53,711 INFO L85 PathProgramCache]: Analyzing trace with hash 721946978, now seen corresponding path program 6 times [2022-03-01 16:14:53,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:14:53,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035558769] [2022-03-01 16:14:53,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:14:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:14:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:14:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:14:53,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:14:53,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035558769] [2022-03-01 16:14:53,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035558769] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:14:53,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394082961] [2022-03-01 16:14:53,883 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:14:53,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:14:53,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:14:53,884 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-01 16:14:53,942 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-01 16:14:54,127 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-01 16:14:54,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:14:54,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-01 16:14:54,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:14:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-01 16:14:54,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:14:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 16:14:54,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394082961] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:14:54,680 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:14:54,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 11 [2022-03-01 16:14:54,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588697988] [2022-03-01 16:14:54,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:14:54,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:14:54,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:14:54,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:14:54,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:14:54,681 INFO L87 Difference]: Start difference. First operand 39571 states and 122308 transitions. Second operand has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 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-01 16:14:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:14:55,076 INFO L93 Difference]: Finished difference Result 62709 states and 193441 transitions. [2022-03-01 16:14:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:14:55,077 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 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-01 16:14:55,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:14:55,259 INFO L225 Difference]: With dead ends: 62709 [2022-03-01 16:14:55,260 INFO L226 Difference]: Without dead ends: 61917 [2022-03-01 16:14:55,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:14:55,262 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 455 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:14:55,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 438 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:14:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61917 states. [2022-03-01 16:14:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61917 to 51217. [2022-03-01 16:14:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51217 states, 51216 states have (on average 3.0729654795376447) internal successors, (157385), 51216 states have internal predecessors, (157385), 0 states have call successors, (0), 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-01 16:14:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51217 states to 51217 states and 157385 transitions. [2022-03-01 16:14:56,689 INFO L78 Accepts]: Start accepts. Automaton has 51217 states and 157385 transitions. Word has length 141 [2022-03-01 16:14:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:14:56,689 INFO L470 AbstractCegarLoop]: Abstraction has 51217 states and 157385 transitions. [2022-03-01 16:14:56,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 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-01 16:14:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 51217 states and 157385 transitions. [2022-03-01 16:14:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-03-01 16:14:56,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:14:56,745 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-03-01 16:14:56,761 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-01 16:14:56,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:14:56,948 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-01 16:14:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:14:57,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1877924540, now seen corresponding path program 7 times [2022-03-01 16:14:57,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:14:57,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834483602] [2022-03-01 16:14:57,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:14:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:14:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:14:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-01 16:14:57,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:14:57,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834483602] [2022-03-01 16:14:57,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834483602] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:14:57,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819770602] [2022-03-01 16:14:57,452 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:14:57,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:14:57,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:14:57,453 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-01 16:14:57,454 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-01 16:14:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:14:57,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-01 16:14:57,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:14:59,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:14:59,111 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 44 treesize of output 42 [2022-03-01 16:14:59,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:14:59,273 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:14:59,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 14 [2022-03-01 16:14:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:14:59,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:14:59,578 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-03-01 16:14:59,871 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-01 16:14:59,872 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 137 treesize of output 122 [2022-03-01 16:14:59,876 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 59 treesize of output 52 [2022-03-01 16:14:59,878 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 52 treesize of output 45 [2022-03-01 16:15:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:15:01,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819770602] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:15:01,270 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:15:01,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 28, 27] total 65 [2022-03-01 16:15:01,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843439094] [2022-03-01 16:15:01,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:15:01,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-01 16:15:01,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:15:01,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-01 16:15:01,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3627, Unknown=1, NotChecked=124, Total=4160 [2022-03-01 16:15:01,272 INFO L87 Difference]: Start difference. First operand 51217 states and 157385 transitions. Second operand has 65 states, 65 states have (on average 5.661538461538462) internal successors, (368), 65 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-01 16:15:07,887 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0)) is different from false [2022-03-01 16:15:11,218 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-03-01 16:15:11,226 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-03-01 16:15:11,502 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-03-01 16:15:11,555 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-03-01 16:15:11,761 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 c_~v_assert~0)) is different from false [2022-03-01 16:15:12,422 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-03-01 16:15:12,716 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-03-01 16:15:12,928 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-03-01 16:15:13,374 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_433 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_433) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_433 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_433) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-03-01 16:15:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:15:13,743 INFO L93 Difference]: Finished difference Result 199963 states and 636989 transitions. [2022-03-01 16:15:13,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2022-03-01 16:15:13,743 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 5.661538461538462) internal successors, (368), 65 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 145 [2022-03-01 16:15:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:15:14,454 INFO L225 Difference]: With dead ends: 199963 [2022-03-01 16:15:14,454 INFO L226 Difference]: Without dead ends: 171409 [2022-03-01 16:15:14,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 258 SyntacticMatches, 7 SemanticMatches, 235 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 19909 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=6104, Invalid=44749, Unknown=41, NotChecked=5038, Total=55932 [2022-03-01 16:15:14,457 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 7446 mSDsluCounter, 8962 mSDsCounter, 0 mSdLazyCounter, 3961 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7446 SdHoareTripleChecker+Valid, 8131 SdHoareTripleChecker+Invalid, 10991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 3961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6256 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:15:14,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7446 Valid, 8131 Invalid, 10991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 3961 Invalid, 0 Unknown, 6256 Unchecked, 2.2s Time] [2022-03-01 16:15:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171409 states. [2022-03-01 16:15:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171409 to 64491. [2022-03-01 16:15:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64491 states, 64490 states have (on average 3.059218483485812) internal successors, (197289), 64490 states have internal predecessors, (197289), 0 states have call successors, (0), 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-01 16:15:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64491 states to 64491 states and 197289 transitions. [2022-03-01 16:15:16,987 INFO L78 Accepts]: Start accepts. Automaton has 64491 states and 197289 transitions. Word has length 145 [2022-03-01 16:15:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:15:16,987 INFO L470 AbstractCegarLoop]: Abstraction has 64491 states and 197289 transitions. [2022-03-01 16:15:16,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 5.661538461538462) internal successors, (368), 65 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-01 16:15:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 64491 states and 197289 transitions. [2022-03-01 16:15:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-03-01 16:15:17,235 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:15:17,235 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-03-01 16:15:17,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-01 16:15:17,441 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,SelfDestructingSolverStorable16 [2022-03-01 16:15:17,442 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 16:15:17,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:15:17,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1633273564, now seen corresponding path program 8 times [2022-03-01 16:15:17,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:15:17,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687085712] [2022-03-01 16:15:17,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:15:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:15:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:15:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:15:19,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:15:19,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687085712] [2022-03-01 16:15:19,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687085712] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:15:19,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132826853] [2022-03-01 16:15:19,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:15:19,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:15:19,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:15:19,317 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-01 16:15:19,319 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-01 16:15:19,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 16:15:19,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:15:19,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 81 conjunts are in the unsatisfiable core [2022-03-01 16:15:19,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:15:19,466 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-01 16:15:19,720 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 16:15:19,721 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 16:15:20,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-01 16:15:21,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:15:21,029 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:15:21,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 14 [2022-03-01 16:15:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:15:21,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:15:21,582 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-03-01 16:15:21,582 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 156 treesize of output 143 [2022-03-01 16:15:21,592 INFO L353 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2022-03-01 16:15:21,592 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 101 treesize of output 80 [2022-03-01 16:15:23,480 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-01 16:15:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:15:23,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132826853] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:15:23,524 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:15:23,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 28, 27] total 85 [2022-03-01 16:15:23,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397083116] [2022-03-01 16:15:23,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:15:23,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-01 16:15:23,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:15:23,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-01 16:15:23,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=6435, Unknown=1, NotChecked=0, Total=7140 [2022-03-01 16:15:23,526 INFO L87 Difference]: Start difference. First operand 64491 states and 197289 transitions. Second operand has 85 states, 85 states have (on average 4.482352941176471) internal successors, (381), 85 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-01 16:15:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:15:54,190 INFO L93 Difference]: Finished difference Result 288529 states and 915592 transitions. [2022-03-01 16:15:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2022-03-01 16:15:54,191 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 4.482352941176471) internal successors, (381), 85 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 145 [2022-03-01 16:15:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:15:56,026 INFO L225 Difference]: With dead ends: 288529 [2022-03-01 16:15:56,027 INFO L226 Difference]: Without dead ends: 288529 [2022-03-01 16:15:56,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 244 SyntacticMatches, 11 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73580 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=15666, Invalid=154340, Unknown=150, NotChecked=0, Total=170156 [2022-03-01 16:15:56,034 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 7423 mSDsluCounter, 15191 mSDsCounter, 0 mSdLazyCounter, 7850 mSolverCounterSat, 637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7423 SdHoareTripleChecker+Valid, 13176 SdHoareTripleChecker+Invalid, 12995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 637 IncrementalHoareTripleChecker+Valid, 7850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4508 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:15:56,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7423 Valid, 13176 Invalid, 12995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [637 Valid, 7850 Invalid, 0 Unknown, 4508 Unchecked, 3.7s Time] [2022-03-01 16:15:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288529 states. [2022-03-01 16:16:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288529 to 106855. [2022-03-01 16:16:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106855 states, 106854 states have (on average 3.1295880360117545) internal successors, (334409), 106854 states have internal predecessors, (334409), 0 states have call successors, (0), 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-01 16:16:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106855 states to 106855 states and 334409 transitions. [2022-03-01 16:16:01,298 INFO L78 Accepts]: Start accepts. Automaton has 106855 states and 334409 transitions. Word has length 145 [2022-03-01 16:16:01,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:16:01,298 INFO L470 AbstractCegarLoop]: Abstraction has 106855 states and 334409 transitions. [2022-03-01 16:16:01,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 4.482352941176471) internal successors, (381), 85 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-01 16:16:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 106855 states and 334409 transitions. [2022-03-01 16:16:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-03-01 16:16:01,685 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:16:01,685 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-03-01 16:16:01,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-01 16:16:01,899 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,SelfDestructingSolverStorable17 [2022-03-01 16:16:01,900 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 16:16:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:16:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash 56927478, now seen corresponding path program 9 times [2022-03-01 16:16:01,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:16:01,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614764626] [2022-03-01 16:16:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:16:01,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:16:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:16:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:16:04,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:16:04,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614764626] [2022-03-01 16:16:04,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614764626] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:16:04,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289092657] [2022-03-01 16:16:04,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:16:04,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:16:04,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:16:04,781 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-01 16:16:04,782 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-01 16:16:05,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-01 16:16:05,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:16:05,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-01 16:16:05,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:16:06,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:16:06,023 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 48 treesize of output 46 [2022-03-01 16:16:06,067 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-01 16:16:06,068 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 48 treesize of output 14 [2022-03-01 16:16:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-01 16:16:06,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:16:06,273 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_516 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_516) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_516 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_516) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-03-01 16:16:06,446 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-01 16:16:06,446 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 137 treesize of output 122 [2022-03-01 16:16:06,449 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 59 treesize of output 52 [2022-03-01 16:16:06,451 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 52 treesize of output 45 [2022-03-01 16:16:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 1 not checked. [2022-03-01 16:16:07,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289092657] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:16:07,165 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:16:07,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 20, 17] total 64 [2022-03-01 16:16:07,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157698744] [2022-03-01 16:16:07,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:16:07,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-01 16:16:07,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:16:07,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-01 16:16:07,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3637, Unknown=1, NotChecked=122, Total=4032 [2022-03-01 16:16:07,172 INFO L87 Difference]: Start difference. First operand 106855 states and 334409 transitions. Second operand has 64 states, 64 states have (on average 5.640625) internal successors, (361), 64 states have internal predecessors, (361), 0 states have call successors, (0), 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-01 16:16:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:16:18,292 INFO L93 Difference]: Finished difference Result 242448 states and 768282 transitions. [2022-03-01 16:16:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-03-01 16:16:18,293 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 5.640625) internal successors, (361), 64 states have internal predecessors, (361), 0 states have call successors, (0), 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 145 [2022-03-01 16:16:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:16:19,207 INFO L225 Difference]: With dead ends: 242448 [2022-03-01 16:16:19,207 INFO L226 Difference]: Without dead ends: 206100 [2022-03-01 16:16:19,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 270 SyntacticMatches, 4 SemanticMatches, 187 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 11537 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=4181, Invalid=30962, Unknown=17, NotChecked=372, Total=35532 [2022-03-01 16:16:19,209 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 3932 mSDsluCounter, 8539 mSDsCounter, 0 mSdLazyCounter, 4788 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3932 SdHoareTripleChecker+Valid, 7995 SdHoareTripleChecker+Invalid, 6208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 4788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1045 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:16:19,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3932 Valid, 7995 Invalid, 6208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 4788 Invalid, 0 Unknown, 1045 Unchecked, 2.1s Time] [2022-03-01 16:16:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206100 states. [2022-03-01 16:16:21,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206100 to 96422. [2022-03-01 16:16:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96422 states, 96421 states have (on average 3.1224110930191555) internal successors, (301066), 96421 states have internal predecessors, (301066), 0 states have call successors, (0), 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-01 16:16:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96422 states to 96422 states and 301066 transitions. [2022-03-01 16:16:22,686 INFO L78 Accepts]: Start accepts. Automaton has 96422 states and 301066 transitions. Word has length 145 [2022-03-01 16:16:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:16:22,686 INFO L470 AbstractCegarLoop]: Abstraction has 96422 states and 301066 transitions. [2022-03-01 16:16:22,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 5.640625) internal successors, (361), 64 states have internal predecessors, (361), 0 states have call successors, (0), 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-01 16:16:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 96422 states and 301066 transitions. [2022-03-01 16:16:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-01 16:16:23,065 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:16:23,065 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-03-01 16:16:23,081 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-01 16:16:23,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:16:23,281 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 16:16:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:16:23,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1807247570, now seen corresponding path program 10 times [2022-03-01 16:16:23,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:16:23,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205343563] [2022-03-01 16:16:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:16:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:16:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:16:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-01 16:16:23,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:16:23,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205343563] [2022-03-01 16:16:23,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205343563] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:16:23,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520846529] [2022-03-01 16:16:23,449 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:16:23,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:16:23,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:16:23,458 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-01 16:16:23,459 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-01 16:16:23,546 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:16:23,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:16:23,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-01 16:16:23,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:16:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-01 16:16:23,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:16:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-01 16:16:24,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520846529] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:16:24,281 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:16:24,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 35 [2022-03-01 16:16:24,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985831774] [2022-03-01 16:16:24,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:16:24,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-01 16:16:24,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:16:24,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-01 16:16:24,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2022-03-01 16:16:24,282 INFO L87 Difference]: Start difference. First operand 96422 states and 301066 transitions. Second operand has 35 states, 35 states have (on average 8.142857142857142) internal successors, (285), 35 states have internal predecessors, (285), 0 states have call successors, (0), 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-01 16:16:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:16:25,251 INFO L93 Difference]: Finished difference Result 60527 states and 191853 transitions. [2022-03-01 16:16:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 16:16:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 8.142857142857142) internal successors, (285), 35 states have internal predecessors, (285), 0 states have call successors, (0), 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 152 [2022-03-01 16:16:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:16:25,418 INFO L225 Difference]: With dead ends: 60527 [2022-03-01 16:16:25,418 INFO L226 Difference]: Without dead ends: 57428 [2022-03-01 16:16:25,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=679, Invalid=2627, Unknown=0, NotChecked=0, Total=3306 [2022-03-01 16:16:25,419 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 1391 mSDsluCounter, 2943 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:16:25,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1391 Valid, 2996 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:16:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57428 states. [2022-03-01 16:16:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57428 to 57428. [2022-03-01 16:16:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57428 states, 57427 states have (on average 3.1908684068469535) internal successors, (183242), 57427 states have internal predecessors, (183242), 0 states have call successors, (0), 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-01 16:16:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57428 states to 57428 states and 183242 transitions. [2022-03-01 16:16:26,825 INFO L78 Accepts]: Start accepts. Automaton has 57428 states and 183242 transitions. Word has length 152 [2022-03-01 16:16:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:16:26,825 INFO L470 AbstractCegarLoop]: Abstraction has 57428 states and 183242 transitions. [2022-03-01 16:16:26,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.142857142857142) internal successors, (285), 35 states have internal predecessors, (285), 0 states have call successors, (0), 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-01 16:16:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 57428 states and 183242 transitions. [2022-03-01 16:16:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-01 16:16:26,875 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:16:26,875 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-03-01 16:16:26,894 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-01 16:16:27,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:16:27,091 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 16:16:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:16:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash -327922223, now seen corresponding path program 11 times [2022-03-01 16:16:27,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:16:27,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607916760] [2022-03-01 16:16:27,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:16:27,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:16:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:16:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:16:30,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:16:30,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607916760] [2022-03-01 16:16:30,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607916760] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:16:30,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386738393] [2022-03-01 16:16:30,166 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:16:30,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:16:30,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:16:30,167 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-01 16:16:30,168 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-01 16:16:30,276 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-01 16:16:30,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:16:30,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-01 16:16:30,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:16:30,857 INFO L353 Elim1Store]: treesize reduction 15, result has 16.7 percent of original size [2022-03-01 16:16:30,857 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 29 treesize of output 14 [2022-03-01 16:16:30,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-03-01 16:16:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 16:16:31,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:16:31,167 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:16:31,167 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 42 treesize of output 34 [2022-03-01 16:16:31,290 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:16:31,291 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 53 treesize of output 45 [2022-03-01 16:16:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-03-01 16:16:31,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386738393] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:16:31,811 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:16:31,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18, 10] total 55 [2022-03-01 16:16:31,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471420080] [2022-03-01 16:16:31,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:16:31,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-01 16:16:31,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:16:31,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-01 16:16:31,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2677, Unknown=0, NotChecked=0, Total=2970 [2022-03-01 16:16:31,822 INFO L87 Difference]: Start difference. First operand 57428 states and 183242 transitions. Second operand has 55 states, 55 states have (on average 6.781818181818182) internal successors, (373), 55 states have internal predecessors, (373), 0 states have call successors, (0), 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-01 16:16:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:16:37,998 INFO L93 Difference]: Finished difference Result 103660 states and 331838 transitions. [2022-03-01 16:16:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-01 16:16:37,999 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 6.781818181818182) internal successors, (373), 55 states have internal predecessors, (373), 0 states have call successors, (0), 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 152 [2022-03-01 16:16:37,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:16:38,270 INFO L225 Difference]: With dead ends: 103660 [2022-03-01 16:16:38,270 INFO L226 Difference]: Without dead ends: 97480 [2022-03-01 16:16:38,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 282 SyntacticMatches, 4 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6471 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2771, Invalid=18109, Unknown=0, NotChecked=0, Total=20880 [2022-03-01 16:16:38,272 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 2710 mSDsluCounter, 6991 mSDsCounter, 0 mSdLazyCounter, 3511 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2710 SdHoareTripleChecker+Valid, 6606 SdHoareTripleChecker+Invalid, 3787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 3511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:16:38,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2710 Valid, 6606 Invalid, 3787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 3511 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 16:16:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97480 states. [2022-03-01 16:16:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97480 to 57428. [2022-03-01 16:16:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57428 states, 57427 states have (on average 3.1908684068469535) internal successors, (183242), 57427 states have internal predecessors, (183242), 0 states have call successors, (0), 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-01 16:16:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57428 states to 57428 states and 183242 transitions. [2022-03-01 16:16:40,225 INFO L78 Accepts]: Start accepts. Automaton has 57428 states and 183242 transitions. Word has length 152 [2022-03-01 16:16:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:16:40,225 INFO L470 AbstractCegarLoop]: Abstraction has 57428 states and 183242 transitions. [2022-03-01 16:16:40,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.781818181818182) internal successors, (373), 55 states have internal predecessors, (373), 0 states have call successors, (0), 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-01 16:16:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 57428 states and 183242 transitions. [2022-03-01 16:16:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-01 16:16:40,280 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:16:40,280 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-03-01 16:16:40,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-01 16:16:40,495 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,SelfDestructingSolverStorable20 [2022-03-01 16:16:40,496 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 16:16:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:16:40,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1005237407, now seen corresponding path program 12 times [2022-03-01 16:16:40,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:16:40,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739850975] [2022-03-01 16:16:40,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:16:40,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:16:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:16:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:16:42,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:16:42,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739850975] [2022-03-01 16:16:42,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739850975] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:16:42,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456607068] [2022-03-01 16:16:42,752 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 16:16:42,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:16:42,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:16:42,753 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-01 16:16:42,754 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-01 16:16:42,929 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-01 16:16:42,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:16:42,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-01 16:16:42,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:16:42,960 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-01 16:16:43,129 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 16:16:43,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 16:16:43,671 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-01 16:16:43,863 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-01 16:16:43,863 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 48 treesize of output 14 [2022-03-01 16:16:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-03-01 16:16:43,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:16:44,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_642 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_642) c_~queue~0.base))) (or (not (= (+ (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (let ((.cse1 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse2)) (select .cse0 (+ c_~queue~0.offset .cse2 4)))))) (and (<= 0 .cse1) (<= .cse1 1)))))) is different from false [2022-03-01 16:16:44,279 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-01 16:16:44,279 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 156 treesize of output 157 [2022-03-01 16:16:44,295 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-01 16:16:44,295 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 101 treesize of output 94 [2022-03-01 16:16:45,609 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-01 16:16:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 46 trivial. 1 not checked. [2022-03-01 16:16:45,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456607068] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:16:45,647 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:16:45,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 18, 17] total 61 [2022-03-01 16:16:45,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284459000] [2022-03-01 16:16:45,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:16:45,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-01 16:16:45,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:16:45,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-01 16:16:45,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=3265, Unknown=1, NotChecked=116, Total=3660 [2022-03-01 16:16:45,648 INFO L87 Difference]: Start difference. First operand 57428 states and 183242 transitions. Second operand has 61 states, 61 states have (on average 5.901639344262295) internal successors, (360), 61 states have internal predecessors, (360), 0 states have call successors, (0), 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-01 16:16:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:16:53,545 INFO L93 Difference]: Finished difference Result 118807 states and 383401 transitions. [2022-03-01 16:16:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-01 16:16:53,545 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 5.901639344262295) internal successors, (360), 61 states have internal predecessors, (360), 0 states have call successors, (0), 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 152 [2022-03-01 16:16:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:16:53,907 INFO L225 Difference]: With dead ends: 118807 [2022-03-01 16:16:53,908 INFO L226 Difference]: Without dead ends: 98251 [2022-03-01 16:16:53,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 285 SyntacticMatches, 9 SemanticMatches, 150 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6859 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2950, Invalid=19703, Unknown=1, NotChecked=298, Total=22952 [2022-03-01 16:16:53,909 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 3486 mSDsluCounter, 6291 mSDsCounter, 0 mSdLazyCounter, 3627 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3486 SdHoareTripleChecker+Valid, 5938 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 3627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:16:53,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3486 Valid, 5938 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 3627 Invalid, 0 Unknown, 551 Unchecked, 1.8s Time] [2022-03-01 16:16:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98251 states. [2022-03-01 16:16:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98251 to 55964. [2022-03-01 16:16:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55964 states, 55963 states have (on average 3.2002930507656844) internal successors, (179098), 55963 states have internal predecessors, (179098), 0 states have call successors, (0), 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-01 16:16:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55964 states to 55964 states and 179098 transitions. [2022-03-01 16:16:55,663 INFO L78 Accepts]: Start accepts. Automaton has 55964 states and 179098 transitions. Word has length 152 [2022-03-01 16:16:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:16:55,663 INFO L470 AbstractCegarLoop]: Abstraction has 55964 states and 179098 transitions. [2022-03-01 16:16:55,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 5.901639344262295) internal successors, (360), 61 states have internal predecessors, (360), 0 states have call successors, (0), 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-01 16:16:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 55964 states and 179098 transitions. [2022-03-01 16:16:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-01 16:16:55,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:16:55,701 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-03-01 16:16:55,718 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-01 16:16:55,907 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,SelfDestructingSolverStorable21 [2022-03-01 16:16:55,907 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 16:16:55,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:16:55,908 INFO L85 PathProgramCache]: Analyzing trace with hash -805556699, now seen corresponding path program 13 times [2022-03-01 16:16:55,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:16:55,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738876917] [2022-03-01 16:16:55,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:16:55,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:16:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:16:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-03-01 16:16:56,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:16:56,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738876917] [2022-03-01 16:16:56,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738876917] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:16:56,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140002915] [2022-03-01 16:16:56,162 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 16:16:56,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:16:56,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:16:56,163 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:16:56,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-01 16:16:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:16:56,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-01 16:16:56,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:16:57,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:16:57,803 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 44 treesize of output 42 [2022-03-01 16:16:57,857 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-01 16:16:57,858 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 50 treesize of output 16 [2022-03-01 16:16:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:16:57,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:16:58,057 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_687 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_687) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_687 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_687) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-03-01 16:16:58,149 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_687 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_687) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_687 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_687) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) is different from false [2022-03-01 16:16:58,159 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_687 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_687) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_687 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_687) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) is different from false [2022-03-01 16:16:58,182 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_687 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_687) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_687 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_687) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) is different from false [2022-03-01 16:16:58,233 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (and (forall ((v_ArrVal_687 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_687) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_687 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_687) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))))))) is different from false [2022-03-01 16:16:58,278 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-03-01 16:16:58,278 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 137 treesize of output 108 [2022-03-01 16:16:58,281 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 59 treesize of output 52 [2022-03-01 16:16:58,283 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 52 treesize of output 45 [2022-03-01 16:17:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-03-01 16:17:00,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140002915] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:17:00,581 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:17:00,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 33, 32] total 75 [2022-03-01 16:17:00,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696912262] [2022-03-01 16:17:00,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:17:00,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-03-01 16:17:00,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:17:00,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-03-01 16:17:00,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=4360, Unknown=5, NotChecked=700, Total=5550 [2022-03-01 16:17:00,583 INFO L87 Difference]: Start difference. First operand 55964 states and 179098 transitions. Second operand has 75 states, 75 states have (on average 5.08) internal successors, (381), 75 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-01 16:17:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:17:10,837 INFO L93 Difference]: Finished difference Result 159358 states and 508387 transitions. [2022-03-01 16:17:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2022-03-01 16:17:10,837 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 5.08) internal successors, (381), 75 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 152 [2022-03-01 16:17:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:17:11,675 INFO L225 Difference]: With dead ends: 159358 [2022-03-01 16:17:11,675 INFO L226 Difference]: Without dead ends: 159358 [2022-03-01 16:17:11,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 257 SyntacticMatches, 23 SemanticMatches, 233 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 22465 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=6227, Invalid=46449, Unknown=14, NotChecked=2300, Total=54990 [2022-03-01 16:17:11,678 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 4468 mSDsluCounter, 9480 mSDsCounter, 0 mSdLazyCounter, 4891 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4468 SdHoareTripleChecker+Valid, 8889 SdHoareTripleChecker+Invalid, 8816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 4891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3498 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:17:11,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4468 Valid, 8889 Invalid, 8816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 4891 Invalid, 0 Unknown, 3498 Unchecked, 2.1s Time] [2022-03-01 16:17:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159358 states. [2022-03-01 16:17:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159358 to 73177. [2022-03-01 16:17:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73177 states, 73176 states have (on average 3.2283672242265222) internal successors, (236239), 73176 states have internal predecessors, (236239), 0 states have call successors, (0), 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-01 16:17:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73177 states to 73177 states and 236239 transitions. [2022-03-01 16:17:14,156 INFO L78 Accepts]: Start accepts. Automaton has 73177 states and 236239 transitions. Word has length 152 [2022-03-01 16:17:14,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:17:14,156 INFO L470 AbstractCegarLoop]: Abstraction has 73177 states and 236239 transitions. [2022-03-01 16:17:14,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 5.08) internal successors, (381), 75 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-01 16:17:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 73177 states and 236239 transitions. [2022-03-01 16:17:14,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-01 16:17:14,442 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:17:14,442 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-03-01 16:17:14,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-01 16:17:14,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:17:14,678 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 16:17:14,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:17:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash -813275425, now seen corresponding path program 14 times [2022-03-01 16:17:14,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:17:14,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803652117] [2022-03-01 16:17:14,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:17:14,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:17:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:17:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-03-01 16:17:15,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:17:15,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803652117] [2022-03-01 16:17:15,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803652117] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:17:15,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217223257] [2022-03-01 16:17:15,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:17:15,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:17:15,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:17:15,068 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:17:15,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-01 16:17:15,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 16:17:15,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:17:15,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-01 16:17:15,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:17:16,246 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-01 16:17:16,644 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-01 16:17:16,751 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-01 16:17:17,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:17:17,666 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 44 treesize of output 42 [2022-03-01 16:17:17,744 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-01 16:17:17,744 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 50 treesize of output 16 [2022-03-01 16:17:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:17:17,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:17:17,946 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_736 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_736) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_736 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_736) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-03-01 16:17:17,980 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_736 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_736) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_736 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_736) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~front~0 0)) is different from false [2022-03-01 16:17:18,000 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_736 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_736) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_736 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_736) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-01 16:17:18,031 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_736 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_736) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_736 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_736) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-01 16:17:18,067 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_736 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_736) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_736 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_736) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-01 16:17:18,091 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_736 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_736) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_736 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_736) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-03-01 16:17:18,226 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~back~0 1)) (.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (* c_~back~0 4))) (or (< .cse0 0) (<= c_~n~0 c_~front~0) (not (= (+ (select .cse1 (+ c_~queue~0.offset .cse2 4)) 1) 0)) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_736 (Array Int Int))) (<= 0 (let ((.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_736) c_~queue~0.base) (+ c_~queue~0.offset .cse3 4)))))) (forall ((v_ArrVal_736 (Array Int Int))) (<= (let ((.cse4 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse4)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_736) c_~queue~0.base) (+ c_~queue~0.offset .cse4 4)))) 1))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select .cse1 (+ c_~queue~0.offset .cse2)) 1)))) is different from false [2022-03-01 16:17:19,860 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:17:19,860 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 189 treesize of output 129 [2022-03-01 16:17:19,910 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-01 16:17:19,911 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 30778 treesize of output 27596 [2022-03-01 16:17:20,020 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-01 16:17:20,021 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 27544 treesize of output 25138 [2022-03-01 16:17:20,131 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 24813 treesize of output 23021 [2022-03-01 16:17:20,253 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-01 16:17:20,254 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 23294 treesize of output 18430 [2022-03-01 16:17:20,332 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 18157 treesize of output 16365 [2022-03-01 16:17:20,433 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-01 16:17:20,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-01 16:17:20,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:17:20,663 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-01 16:17:20,665 INFO L158 Benchmark]: Toolchain (without parser) took 280338.53ms. Allocated memory was 216.0MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 160.4MB in the beginning and 5.8GB in the end (delta: -5.6GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-03-01 16:17:20,665 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory was 176.9MB in the beginning and 176.8MB in the end (delta: 72.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 16:17:20,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.18ms. Allocated memory was 216.0MB in the beginning and 271.6MB in the end (delta: 55.6MB). Free memory was 160.2MB in the beginning and 241.9MB in the end (delta: -81.7MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-03-01 16:17:20,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.07ms. Allocated memory is still 271.6MB. Free memory was 241.9MB in the beginning and 239.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 16:17:20,665 INFO L158 Benchmark]: Boogie Preprocessor took 24.05ms. Allocated memory is still 271.6MB. Free memory was 239.8MB in the beginning and 237.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 16:17:20,665 INFO L158 Benchmark]: RCFGBuilder took 433.16ms. Allocated memory is still 271.6MB. Free memory was 237.7MB in the beginning and 218.3MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-03-01 16:17:20,665 INFO L158 Benchmark]: TraceAbstraction took 279619.83ms. Allocated memory was 271.6MB in the beginning and 6.7GB in the end (delta: 6.4GB). Free memory was 217.8MB in the beginning and 5.8GB in the end (delta: -5.6GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-03-01 16:17:20,667 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory was 176.9MB in the beginning and 176.8MB in the end (delta: 72.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.18ms. Allocated memory was 216.0MB in the beginning and 271.6MB in the end (delta: 55.6MB). Free memory was 160.2MB in the beginning and 241.9MB in the end (delta: -81.7MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.07ms. Allocated memory is still 271.6MB. Free memory was 241.9MB in the beginning and 239.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.05ms. Allocated memory is still 271.6MB. Free memory was 239.8MB in the beginning and 237.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 433.16ms. Allocated memory is still 271.6MB. Free memory was 237.7MB in the beginning and 218.3MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 279619.83ms. Allocated memory was 271.6MB in the beginning and 6.7GB in the end (delta: 6.4GB). Free memory was 217.8MB in the beginning and 5.8GB in the end (delta: -5.6GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-01 16:17:20,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...