/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-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-15 11:51:56,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 11:51:56,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 11:51:56,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 11:51:56,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 11:51:56,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 11:51:56,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 11:51:56,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 11:51:56,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 11:51:56,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 11:51:56,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 11:51:56,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 11:51:56,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 11:51:56,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 11:51:56,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 11:51:56,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 11:51:56,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 11:51:56,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 11:51:56,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 11:51:56,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 11:51:56,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 11:51:56,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 11:51:56,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 11:51:56,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 11:51:56,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 11:51:56,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 11:51:56,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 11:51:56,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 11:51:56,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 11:51:56,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 11:51:56,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 11:51:56,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 11:51:56,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 11:51:56,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 11:51:56,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 11:51:56,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 11:51:56,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 11:51:56,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 11:51:56,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 11:51:56,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 11:51:56,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 11:51:56,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-15 11:51:56,458 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 11:51:56,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 11:51:56,459 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-15 11:51:56,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-15 11:51:56,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-15 11:51:56,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-15 11:51:56,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-15 11:51:56,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-15 11:51:56,460 INFO L138 SettingsManager]: * Use SBE=true [2022-02-15 11:51:56,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 11:51:56,460 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 11:51:56,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 11:51:56,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 11:51:56,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 11:51:56,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 11:51:56,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 11:51:56,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 11:51:56,460 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 11:51:56,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 11:51:56,461 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 11:51:56,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 11:51:56,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 11:51:56,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 11:51:56,461 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 11:51:56,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 11:51:56,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 11:51:56,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 11:51:56,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-15 11:51:56,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-15 11:51:56,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 11:51:56,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-15 11:51:56,462 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-15 11:51:56,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 11:51:56,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-15 11:51:56,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 11:51:56,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 11:51:56,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 11:51:56,702 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 11:51:56,702 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 11:51:56,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-02-15 11:51:56,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a461fdc89/3a5f8052804e44e7b2339e0525e8a447/FLAG36ca835c4 [2022-02-15 11:51:57,123 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 11:51:57,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-02-15 11:51:57,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a461fdc89/3a5f8052804e44e7b2339e0525e8a447/FLAG36ca835c4 [2022-02-15 11:51:57,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a461fdc89/3a5f8052804e44e7b2339e0525e8a447 [2022-02-15 11:51:57,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 11:51:57,153 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 11:51:57,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 11:51:57,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 11:51:57,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 11:51:57,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b72df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57, skipping insertion in model container [2022-02-15 11:51:57,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 11:51:57,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 11:51:57,366 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-more-dec-subseq.wvr.c[2924,2937] [2022-02-15 11:51:57,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 11:51:57,385 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 11:51:57,416 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-more-dec-subseq.wvr.c[2924,2937] [2022-02-15 11:51:57,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 11:51:57,434 INFO L208 MainTranslator]: Completed translation [2022-02-15 11:51:57,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57 WrapperNode [2022-02-15 11:51:57,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 11:51:57,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-15 11:51:57,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-15 11:51:57,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-15 11:51:57,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,465 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-02-15 11:51:57,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-15 11:51:57,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 11:51:57,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 11:51:57,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 11:51:57,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 11:51:57,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 11:51:57,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 11:51:57,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 11:51:57,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57" (1/1) ... [2022-02-15 11:51:57,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 11:51:57,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:51:57,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 11:51:57,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 11:51:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 11:51:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-15 11:51:57,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-15 11:51:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-15 11:51:57,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-15 11:51:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 11:51:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-15 11:51:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 11:51:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-15 11:51:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-15 11:51:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-15 11:51:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 11:51:57,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 11:51:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 11:51:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 11:51:57,600 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-15 11:51:57,669 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 11:51:57,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 11:51:58,028 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 11:51:58,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 11:51:58,091 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-15 11:51:58,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:51:58 BoogieIcfgContainer [2022-02-15 11:51:58,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 11:51:58,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 11:51:58,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 11:51:58,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 11:51:58,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 11:51:57" (1/3) ... [2022-02-15 11:51:58,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17803d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:51:58, skipping insertion in model container [2022-02-15 11:51:58,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:51:57" (2/3) ... [2022-02-15 11:51:58,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17803d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:51:58, skipping insertion in model container [2022-02-15 11:51:58,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:51:58" (3/3) ... [2022-02-15 11:51:58,097 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-02-15 11:51:58,100 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-15 11:51:58,101 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-15 11:51:58,101 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 11:51:58,101 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-15 11:51:58,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,148 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,150 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,150 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,150 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,150 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,150 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,150 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 11:51:58,152 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-15 11:51:58,186 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 11:51:58,190 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-15 11:51:58,191 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-15 11:51:58,205 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 181 places, 189 transitions, 394 flow [2022-02-15 11:51:58,281 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 704 states, 703 states have (on average 2.52773826458037) internal successors, (1777), 703 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 704 states, 703 states have (on average 2.52773826458037) internal successors, (1777), 703 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-02-15 11:51:58,304 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:51:58,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:51:58,305 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:51:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:51:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash -7555604, now seen corresponding path program 1 times [2022-02-15 11:51:58,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:51:58,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345736639] [2022-02-15 11:51:58,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:51:58,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:51:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:51:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:51:58,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:51:58,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345736639] [2022-02-15 11:51:58,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345736639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:51:58,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:51:58,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-15 11:51:58,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072155786] [2022-02-15 11:51:58,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:51:58,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-15 11:51:58,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:51:58,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-15 11:51:58,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-15 11:51:58,603 INFO L87 Difference]: Start difference. First operand has 704 states, 703 states have (on average 2.52773826458037) internal successors, (1777), 703 states have internal predecessors, (1777), 0 states have call successors, (0), 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 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:58,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:51:58,649 INFO L93 Difference]: Finished difference Result 704 states and 1672 transitions. [2022-02-15 11:51:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-15 11:51:58,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-02-15 11:51:58,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:51:58,668 INFO L225 Difference]: With dead ends: 704 [2022-02-15 11:51:58,668 INFO L226 Difference]: Without dead ends: 698 [2022-02-15 11:51:58,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-15 11:51:58,671 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:51:58,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 11:51:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-02-15 11:51:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2022-02-15 11:51:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 2.3902439024390243) internal successors, (1666), 697 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1666 transitions. [2022-02-15 11:51:58,740 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1666 transitions. Word has length 132 [2022-02-15 11:51:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:51:58,741 INFO L470 AbstractCegarLoop]: Abstraction has 698 states and 1666 transitions. [2022-02-15 11:51:58,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1666 transitions. [2022-02-15 11:51:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-02-15 11:51:58,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:51:58,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:51:58,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 11:51:58,745 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:51:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:51:58,745 INFO L85 PathProgramCache]: Analyzing trace with hash 962025419, now seen corresponding path program 1 times [2022-02-15 11:51:58,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:51:58,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492729445] [2022-02-15 11:51:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:51:58,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:51:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:51:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:51:58,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:51:58,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492729445] [2022-02-15 11:51:58,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492729445] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:51:58,929 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:51:58,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 11:51:58,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861715404] [2022-02-15 11:51:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:51:58,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 11:51:58,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:51:58,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 11:51:58,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 11:51:58,932 INFO L87 Difference]: Start difference. First operand 698 states and 1666 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:51:59,069 INFO L93 Difference]: Finished difference Result 1118 states and 2818 transitions. [2022-02-15 11:51:59,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 11:51:59,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-02-15 11:51:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:51:59,075 INFO L225 Difference]: With dead ends: 1118 [2022-02-15 11:51:59,075 INFO L226 Difference]: Without dead ends: 1118 [2022-02-15 11:51:59,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-15 11:51:59,080 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 132 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:51:59,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 431 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 11:51:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-02-15 11:51:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 740. [2022-02-15 11:51:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 2.404600811907984) internal successors, (1777), 739 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1777 transitions. [2022-02-15 11:51:59,111 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1777 transitions. Word has length 132 [2022-02-15 11:51:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:51:59,112 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 1777 transitions. [2022-02-15 11:51:59,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1777 transitions. [2022-02-15 11:51:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-02-15 11:51:59,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:51:59,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:51:59,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 11:51:59,117 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:51:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:51:59,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1932159763, now seen corresponding path program 1 times [2022-02-15 11:51:59,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:51:59,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247373626] [2022-02-15 11:51:59,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:51:59,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:51:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:51:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 11:51:59,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:51:59,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247373626] [2022-02-15 11:51:59,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247373626] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:51:59,279 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:51:59,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 11:51:59,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899691008] [2022-02-15 11:51:59,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:51:59,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 11:51:59,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:51:59,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 11:51:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-15 11:51:59,282 INFO L87 Difference]: Start difference. First operand 740 states and 1777 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:51:59,385 INFO L93 Difference]: Finished difference Result 1185 states and 2913 transitions. [2022-02-15 11:51:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 11:51:59,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-02-15 11:51:59,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:51:59,390 INFO L225 Difference]: With dead ends: 1185 [2022-02-15 11:51:59,390 INFO L226 Difference]: Without dead ends: 1124 [2022-02-15 11:51:59,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-02-15 11:51:59,396 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 318 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:51:59,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 484 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 11:51:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2022-02-15 11:51:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 741. [2022-02-15 11:51:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 2.402702702702703) internal successors, (1778), 740 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1778 transitions. [2022-02-15 11:51:59,413 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1778 transitions. Word has length 137 [2022-02-15 11:51:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:51:59,414 INFO L470 AbstractCegarLoop]: Abstraction has 741 states and 1778 transitions. [2022-02-15 11:51:59,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1778 transitions. [2022-02-15 11:51:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-02-15 11:51:59,418 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:51:59,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:51:59,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 11:51:59,418 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:51:59,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:51:59,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1113696768, now seen corresponding path program 1 times [2022-02-15 11:51:59,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:51:59,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900129673] [2022-02-15 11:51:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:51:59,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:51:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:51:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:51:59,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:51:59,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900129673] [2022-02-15 11:51:59,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900129673] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:51:59,562 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:51:59,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 11:51:59,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946273369] [2022-02-15 11:51:59,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:51:59,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 11:51:59,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:51:59,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 11:51:59,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 11:51:59,564 INFO L87 Difference]: Start difference. First operand 741 states and 1778 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:51:59,620 INFO L93 Difference]: Finished difference Result 1101 states and 2768 transitions. [2022-02-15 11:51:59,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 11:51:59,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2022-02-15 11:51:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:51:59,624 INFO L225 Difference]: With dead ends: 1101 [2022-02-15 11:51:59,624 INFO L226 Difference]: Without dead ends: 918 [2022-02-15 11:51:59,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-15 11:51:59,629 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 19 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:51:59,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 483 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 11:51:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-02-15 11:51:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 800. [2022-02-15 11:51:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.430538172715895) internal successors, (1942), 799 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1942 transitions. [2022-02-15 11:51:59,647 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1942 transitions. Word has length 144 [2022-02-15 11:51:59,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:51:59,647 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 1942 transitions. [2022-02-15 11:51:59,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1942 transitions. [2022-02-15 11:51:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-02-15 11:51:59,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:51:59,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:51:59,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 11:51:59,649 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:51:59,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:51:59,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1975010592, now seen corresponding path program 1 times [2022-02-15 11:51:59,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:51:59,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162880738] [2022-02-15 11:51:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:51:59,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:51:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:51:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:51:59,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:51:59,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162880738] [2022-02-15 11:51:59,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162880738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:51:59,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:51:59,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 11:51:59,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494346954] [2022-02-15 11:51:59,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:51:59,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 11:51:59,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:51:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 11:51:59,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-15 11:51:59,781 INFO L87 Difference]: Start difference. First operand 800 states and 1942 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:51:59,824 INFO L93 Difference]: Finished difference Result 976 states and 2324 transitions. [2022-02-15 11:51:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 11:51:59,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2022-02-15 11:51:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:51:59,828 INFO L225 Difference]: With dead ends: 976 [2022-02-15 11:51:59,828 INFO L226 Difference]: Without dead ends: 898 [2022-02-15 11:51:59,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-15 11:51:59,828 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 36 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:51:59,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 524 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 11:51:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2022-02-15 11:51:59,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 880. [2022-02-15 11:51:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 2.4175199089874857) internal successors, (2125), 879 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2125 transitions. [2022-02-15 11:51:59,844 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2125 transitions. Word has length 149 [2022-02-15 11:51:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:51:59,845 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 2125 transitions. [2022-02-15 11:51:59,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,845 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2125 transitions. [2022-02-15 11:51:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-02-15 11:51:59,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:51:59,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:51:59,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 11:51:59,847 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:51:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:51:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1498906467, now seen corresponding path program 1 times [2022-02-15 11:51:59,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:51:59,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244260512] [2022-02-15 11:51:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:51:59,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:51:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:51:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:51:59,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:51:59,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244260512] [2022-02-15 11:51:59,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244260512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:51:59,899 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:51:59,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 11:51:59,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249183539] [2022-02-15 11:51:59,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:51:59,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 11:51:59,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:51:59,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 11:51:59,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-15 11:51:59,900 INFO L87 Difference]: Start difference. First operand 880 states and 2125 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:51:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:51:59,977 INFO L93 Difference]: Finished difference Result 1065 states and 2473 transitions. [2022-02-15 11:51:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 11:51:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2022-02-15 11:51:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:51:59,981 INFO L225 Difference]: With dead ends: 1065 [2022-02-15 11:51:59,981 INFO L226 Difference]: Without dead ends: 886 [2022-02-15 11:51:59,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-15 11:51:59,981 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 107 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 11:51:59,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 632 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 11:51:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-02-15 11:51:59,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 881. [2022-02-15 11:52:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 2.415909090909091) internal successors, (2126), 880 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:52:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 2126 transitions. [2022-02-15 11:52:00,016 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 2126 transitions. Word has length 153 [2022-02-15 11:52:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:52:00,016 INFO L470 AbstractCegarLoop]: Abstraction has 881 states and 2126 transitions. [2022-02-15 11:52:00,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:52:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 2126 transitions. [2022-02-15 11:52:00,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-02-15 11:52:00,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:52:00,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:52:00,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 11:52:00,019 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:52:00,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:52:00,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1833342822, now seen corresponding path program 1 times [2022-02-15 11:52:00,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:52:00,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510610087] [2022-02-15 11:52:00,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:52:00,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:52:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:52:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:52:01,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:52:01,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510610087] [2022-02-15 11:52:01,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510610087] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:52:01,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842626057] [2022-02-15 11:52:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:52:01,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:52:01,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:52:01,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:52:01,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-15 11:52:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:52:01,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-15 11:52:01,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:52:02,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-15 11:52:02,411 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:52:02,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-15 11:52:03,763 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-15 11:52:03,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-02-15 11:52:03,782 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 27 treesize of output 15 [2022-02-15 11:52:04,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-15 11:52:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:52:04,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:52:04,760 INFO L353 Elim1Store]: treesize reduction 23, result has 58.2 percent of original size [2022-02-15 11:52:04,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 68 [2022-02-15 11:52:04,766 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 29 treesize of output 23 [2022-02-15 11:52:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:52:07,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842626057] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:52:07,153 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:52:07,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 26, 27] total 79 [2022-02-15 11:52:07,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670919918] [2022-02-15 11:52:07,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:52:07,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-02-15 11:52:07,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:52:07,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-02-15 11:52:07,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=5589, Unknown=3, NotChecked=0, Total=6162 [2022-02-15 11:52:07,156 INFO L87 Difference]: Start difference. First operand 881 states and 2126 transitions. Second operand has 79 states, 79 states have (on average 5.518987341772152) internal successors, (436), 79 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:52:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:52:36,040 INFO L93 Difference]: Finished difference Result 10604 states and 27821 transitions. [2022-02-15 11:52:36,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2022-02-15 11:52:36,041 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 5.518987341772152) internal successors, (436), 79 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-02-15 11:52:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:52:36,078 INFO L225 Difference]: With dead ends: 10604 [2022-02-15 11:52:36,079 INFO L226 Difference]: Without dead ends: 9482 [2022-02-15 11:52:36,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 313 SyntacticMatches, 51 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 34991 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=8769, Invalid=68178, Unknown=59, NotChecked=0, Total=77006 [2022-02-15 11:52:36,092 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 9161 mSDsluCounter, 11980 mSDsCounter, 0 mSdLazyCounter, 6129 mSolverCounterSat, 863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9161 SdHoareTripleChecker+Valid, 10791 SdHoareTripleChecker+Invalid, 11303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 863 IncrementalHoareTripleChecker+Valid, 6129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4311 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-02-15 11:52:36,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9161 Valid, 10791 Invalid, 11303 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [863 Valid, 6129 Invalid, 0 Unknown, 4311 Unchecked, 3.4s Time] [2022-02-15 11:52:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9482 states. [2022-02-15 11:52:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9482 to 1569. [2022-02-15 11:52:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 2.403698979591837) internal successors, (3769), 1568 states have internal predecessors, (3769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:52:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 3769 transitions. [2022-02-15 11:52:36,210 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 3769 transitions. Word has length 160 [2022-02-15 11:52:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:52:36,211 INFO L470 AbstractCegarLoop]: Abstraction has 1569 states and 3769 transitions. [2022-02-15 11:52:36,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 5.518987341772152) internal successors, (436), 79 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:52:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 3769 transitions. [2022-02-15 11:52:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-02-15 11:52:36,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:52:36,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:52:36,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-15 11:52:36,415 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-02-15 11:52:36,416 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:52:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:52:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2000453552, now seen corresponding path program 2 times [2022-02-15 11:52:36,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:52:36,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857471958] [2022-02-15 11:52:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:52:36,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:52:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:52:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:52:37,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:52:37,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857471958] [2022-02-15 11:52:37,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857471958] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:52:37,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481851527] [2022-02-15 11:52:37,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:52:37,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:52:37,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:52:37,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:52:37,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-15 11:52:37,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:52:37,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:52:37,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 66 conjunts are in the unsatisfiable core [2022-02-15 11:52:37,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:52:37,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-15 11:52:38,413 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-15 11:52:38,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-15 11:52:39,096 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:52:39,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-15 11:52:39,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 11:52:39,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-15 11:52:39,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-15 11:52:40,408 INFO L353 Elim1Store]: treesize reduction 50, result has 5.7 percent of original size [2022-02-15 11:52:40,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 13 [2022-02-15 11:52:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:52:40,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:52:41,517 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:52:41,518 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 938 treesize of output 894 [2022-02-15 11:52:41,538 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:52:41,538 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 794 treesize of output 740 [2022-02-15 11:52:41,582 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:52:41,583 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 692 treesize of output 536 [2022-02-15 11:52:51,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-15 11:52:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-15 11:52:52,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481851527] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:52:52,002 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:52:52,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 28] total 77 [2022-02-15 11:52:52,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739280868] [2022-02-15 11:52:52,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:52:52,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-02-15 11:52:52,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:52:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-02-15 11:52:52,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=5278, Unknown=13, NotChecked=0, Total=5852 [2022-02-15 11:52:52,004 INFO L87 Difference]: Start difference. First operand 1569 states and 3769 transitions. Second operand has 77 states, 77 states have (on average 5.675324675324675) internal successors, (437), 77 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:53:14,651 INFO L93 Difference]: Finished difference Result 12316 states and 32539 transitions. [2022-02-15 11:53:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-02-15 11:53:14,652 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 5.675324675324675) internal successors, (437), 77 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-02-15 11:53:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:53:14,688 INFO L225 Difference]: With dead ends: 12316 [2022-02-15 11:53:14,688 INFO L226 Difference]: Without dead ends: 10027 [2022-02-15 11:53:14,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 279 SyntacticMatches, 49 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24023 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=7801, Invalid=50486, Unknown=35, NotChecked=0, Total=58322 [2022-02-15 11:53:14,692 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 8380 mSDsluCounter, 8671 mSDsCounter, 0 mSdLazyCounter, 4189 mSolverCounterSat, 872 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8380 SdHoareTripleChecker+Valid, 7931 SdHoareTripleChecker+Invalid, 8797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 872 IncrementalHoareTripleChecker+Valid, 4189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3736 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:53:14,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8380 Valid, 7931 Invalid, 8797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [872 Valid, 4189 Invalid, 0 Unknown, 3736 Unchecked, 2.2s Time] [2022-02-15 11:53:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10027 states. [2022-02-15 11:53:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10027 to 2198. [2022-02-15 11:53:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2198 states, 2197 states have (on average 2.470186618115612) internal successors, (5427), 2197 states have internal predecessors, (5427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 5427 transitions. [2022-02-15 11:53:14,802 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 5427 transitions. Word has length 160 [2022-02-15 11:53:14,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:53:14,802 INFO L470 AbstractCegarLoop]: Abstraction has 2198 states and 5427 transitions. [2022-02-15 11:53:14,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 5.675324675324675) internal successors, (437), 77 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 5427 transitions. [2022-02-15 11:53:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-02-15 11:53:14,807 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:53:14,807 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:53:14,826 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-02-15 11:53:15,024 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,SelfDestructingSolverStorable7 [2022-02-15 11:53:15,024 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:53:15,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:53:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash -400624774, now seen corresponding path program 3 times [2022-02-15 11:53:15,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:53:15,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736222128] [2022-02-15 11:53:15,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:15,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:53:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:53:15,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:53:15,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736222128] [2022-02-15 11:53:15,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736222128] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:53:15,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709395753] [2022-02-15 11:53:15,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 11:53:15,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:15,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:53:15,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:53:15,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-15 11:53:15,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-15 11:53:15,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:53:15,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-15 11:53:15,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:53:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:53:15,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:53:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 11:53:15,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709395753] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:53:15,849 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:53:15,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 10 [2022-02-15 11:53:15,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686868767] [2022-02-15 11:53:15,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:53:15,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 11:53:15,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:53:15,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 11:53:15,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-02-15 11:53:15,850 INFO L87 Difference]: Start difference. First operand 2198 states and 5427 transitions. Second operand has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:53:15,939 INFO L93 Difference]: Finished difference Result 3996 states and 10152 transitions. [2022-02-15 11:53:15,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 11:53:15,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-02-15 11:53:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:53:15,948 INFO L225 Difference]: With dead ends: 3996 [2022-02-15 11:53:15,948 INFO L226 Difference]: Without dead ends: 3843 [2022-02-15 11:53:15,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-02-15 11:53:15,948 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 434 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:53:15,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 751 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 11:53:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2022-02-15 11:53:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3226. [2022-02-15 11:53:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3225 states have (on average 2.566201550387597) internal successors, (8276), 3225 states have internal predecessors, (8276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 8276 transitions. [2022-02-15 11:53:16,006 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 8276 transitions. Word has length 165 [2022-02-15 11:53:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:53:16,006 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 8276 transitions. [2022-02-15 11:53:16,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 8276 transitions. [2022-02-15 11:53:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-02-15 11:53:16,013 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:53:16,013 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:53:16,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-15 11:53:16,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:16,231 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:53:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:53:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1626521301, now seen corresponding path program 1 times [2022-02-15 11:53:16,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:53:16,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100652756] [2022-02-15 11:53:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:16,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:53:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-15 11:53:16,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:53:16,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100652756] [2022-02-15 11:53:16,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100652756] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:53:16,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367310073] [2022-02-15 11:53:16,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:16,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:16,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:53:16,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:53:16,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-15 11:53:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:16,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-15 11:53:16,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:53:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-15 11:53:16,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:53:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-15 11:53:17,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367310073] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:53:17,118 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:53:17,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-02-15 11:53:17,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968611874] [2022-02-15 11:53:17,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:53:17,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-15 11:53:17,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:53:17,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-15 11:53:17,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2022-02-15 11:53:17,120 INFO L87 Difference]: Start difference. First operand 3226 states and 8276 transitions. Second operand has 24 states, 24 states have (on average 13.791666666666666) internal successors, (331), 24 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:53:17,355 INFO L93 Difference]: Finished difference Result 4076 states and 10252 transitions. [2022-02-15 11:53:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-15 11:53:17,356 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 13.791666666666666) internal successors, (331), 24 states have internal predecessors, (331), 0 states have call successors, (0), 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 172 [2022-02-15 11:53:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:53:17,389 INFO L225 Difference]: With dead ends: 4076 [2022-02-15 11:53:17,389 INFO L226 Difference]: Without dead ends: 3421 [2022-02-15 11:53:17,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=321, Invalid=939, Unknown=0, NotChecked=0, Total=1260 [2022-02-15 11:53:17,390 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 990 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:53:17,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [990 Valid, 1398 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 11:53:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2022-02-15 11:53:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3164. [2022-02-15 11:53:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3164 states, 3163 states have (on average 2.5776161871640846) internal successors, (8153), 3163 states have internal predecessors, (8153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 8153 transitions. [2022-02-15 11:53:17,503 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 8153 transitions. Word has length 172 [2022-02-15 11:53:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:53:17,503 INFO L470 AbstractCegarLoop]: Abstraction has 3164 states and 8153 transitions. [2022-02-15 11:53:17,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.791666666666666) internal successors, (331), 24 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 8153 transitions. [2022-02-15 11:53:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-02-15 11:53:17,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:53:17,510 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:53:17,546 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-02-15 11:53:17,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:17,729 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:53:17,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:53:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1088583688, now seen corresponding path program 2 times [2022-02-15 11:53:17,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:53:17,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916824549] [2022-02-15 11:53:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:17,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:53:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-15 11:53:17,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:53:17,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916824549] [2022-02-15 11:53:17,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916824549] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:53:17,966 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:53:17,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 11:53:17,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912373569] [2022-02-15 11:53:17,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:53:17,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 11:53:17,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:53:17,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 11:53:17,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-15 11:53:17,967 INFO L87 Difference]: Start difference. First operand 3164 states and 8153 transitions. Second operand has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:53:18,295 INFO L93 Difference]: Finished difference Result 3215 states and 8343 transitions. [2022-02-15 11:53:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 11:53:18,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 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 179 [2022-02-15 11:53:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:53:18,301 INFO L225 Difference]: With dead ends: 3215 [2022-02-15 11:53:18,301 INFO L226 Difference]: Without dead ends: 3215 [2022-02-15 11:53:18,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2022-02-15 11:53:18,301 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 344 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:53:18,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 928 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 11:53:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2022-02-15 11:53:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 2977. [2022-02-15 11:53:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2976 states have (on average 2.6011424731182795) internal successors, (7741), 2976 states have internal predecessors, (7741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 7741 transitions. [2022-02-15 11:53:18,345 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 7741 transitions. Word has length 179 [2022-02-15 11:53:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:53:18,346 INFO L470 AbstractCegarLoop]: Abstraction has 2977 states and 7741 transitions. [2022-02-15 11:53:18,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 7741 transitions. [2022-02-15 11:53:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-02-15 11:53:18,351 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:53:18,351 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:53:18,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 11:53:18,352 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:53:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:53:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1465175280, now seen corresponding path program 3 times [2022-02-15 11:53:18,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:53:18,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441254966] [2022-02-15 11:53:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:18,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:53:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-15 11:53:18,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:53:18,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441254966] [2022-02-15 11:53:18,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441254966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 11:53:18,668 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 11:53:18,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-15 11:53:18,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986854518] [2022-02-15 11:53:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 11:53:18,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-15 11:53:18,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:53:18,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-15 11:53:18,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-02-15 11:53:18,671 INFO L87 Difference]: Start difference. First operand 2977 states and 7741 transitions. Second operand has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:53:19,125 INFO L93 Difference]: Finished difference Result 2864 states and 7406 transitions. [2022-02-15 11:53:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 11:53:19,126 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 0 states have call successors, (0), 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 179 [2022-02-15 11:53:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:53:19,130 INFO L225 Difference]: With dead ends: 2864 [2022-02-15 11:53:19,130 INFO L226 Difference]: Without dead ends: 2864 [2022-02-15 11:53:19,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2022-02-15 11:53:19,131 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 420 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:53:19,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [420 Valid, 1230 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 11:53:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2022-02-15 11:53:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2757. [2022-02-15 11:53:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2757 states, 2756 states have (on average 2.5932510885341076) internal successors, (7147), 2756 states have internal predecessors, (7147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 7147 transitions. [2022-02-15 11:53:19,170 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 7147 transitions. Word has length 179 [2022-02-15 11:53:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:53:19,170 INFO L470 AbstractCegarLoop]: Abstraction has 2757 states and 7147 transitions. [2022-02-15 11:53:19,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 7147 transitions. [2022-02-15 11:53:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-02-15 11:53:19,175 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:53:19,175 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:53:19,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 11:53:19,176 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:53:19,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:53:19,176 INFO L85 PathProgramCache]: Analyzing trace with hash 546908008, now seen corresponding path program 4 times [2022-02-15 11:53:19,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:53:19,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449945656] [2022-02-15 11:53:19,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:19,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:53:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-15 11:53:19,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:53:19,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449945656] [2022-02-15 11:53:19,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449945656] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:53:19,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698358256] [2022-02-15 11:53:19,240 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-15 11:53:19,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:19,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:53:19,242 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:53:19,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-15 11:53:19,338 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-15 11:53:19,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:53:19,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-15 11:53:19,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:53:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-15 11:53:19,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:53:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-15 11:53:20,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698358256] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:53:20,071 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:53:20,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-02-15 11:53:20,071 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941710782] [2022-02-15 11:53:20,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:53:20,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-15 11:53:20,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:53:20,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-15 11:53:20,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-02-15 11:53:20,072 INFO L87 Difference]: Start difference. First operand 2757 states and 7147 transitions. Second operand has 19 states, 19 states have (on average 12.421052631578947) internal successors, (236), 19 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:53:20,262 INFO L93 Difference]: Finished difference Result 3092 states and 8012 transitions. [2022-02-15 11:53:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-15 11:53:20,262 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.421052631578947) internal successors, (236), 19 states have internal predecessors, (236), 0 states have call successors, (0), 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 181 [2022-02-15 11:53:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:53:20,265 INFO L225 Difference]: With dead ends: 3092 [2022-02-15 11:53:20,266 INFO L226 Difference]: Without dead ends: 2432 [2022-02-15 11:53:20,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2022-02-15 11:53:20,268 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 510 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:53:20,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 1462 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 11:53:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2022-02-15 11:53:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2427. [2022-02-15 11:53:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2426 states have (on average 2.6504534212695794) internal successors, (6430), 2426 states have internal predecessors, (6430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 6430 transitions. [2022-02-15 11:53:20,351 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 6430 transitions. Word has length 181 [2022-02-15 11:53:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:53:20,352 INFO L470 AbstractCegarLoop]: Abstraction has 2427 states and 6430 transitions. [2022-02-15 11:53:20,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.421052631578947) internal successors, (236), 19 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 6430 transitions. [2022-02-15 11:53:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-02-15 11:53:20,376 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:53:20,376 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:53:20,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-15 11:53:20,576 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,SelfDestructingSolverStorable12 [2022-02-15 11:53:20,577 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:53:20,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:53:20,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1376543345, now seen corresponding path program 5 times [2022-02-15 11:53:20,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:53:20,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002039217] [2022-02-15 11:53:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:20,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:53:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-15 11:53:20,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:53:20,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002039217] [2022-02-15 11:53:20,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002039217] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:53:20,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333225556] [2022-02-15 11:53:20,666 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-15 11:53:20,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:20,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:53:20,667 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:53:20,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-15 11:53:20,760 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-15 11:53:20,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:53:20,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-15 11:53:20,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:53:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-15 11:53:21,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:53:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-15 11:53:21,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333225556] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:53:21,609 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:53:21,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 16 [2022-02-15 11:53:21,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411655495] [2022-02-15 11:53:21,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:53:21,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-15 11:53:21,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:53:21,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-15 11:53:21,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-15 11:53:21,611 INFO L87 Difference]: Start difference. First operand 2427 states and 6430 transitions. Second operand has 16 states, 16 states have (on average 18.5625) internal successors, (297), 16 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:53:22,165 INFO L93 Difference]: Finished difference Result 8245 states and 22542 transitions. [2022-02-15 11:53:22,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-15 11:53:22,165 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 18.5625) internal successors, (297), 16 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2022-02-15 11:53:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:53:22,179 INFO L225 Difference]: With dead ends: 8245 [2022-02-15 11:53:22,179 INFO L226 Difference]: Without dead ends: 8230 [2022-02-15 11:53:22,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=500, Invalid=1222, Unknown=0, NotChecked=0, Total=1722 [2022-02-15 11:53:22,180 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 869 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 11:53:22,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [869 Valid, 2117 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 11:53:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8230 states. [2022-02-15 11:53:22,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8230 to 2816. [2022-02-15 11:53:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2815 states have (on average 2.738898756660746) internal successors, (7710), 2815 states have internal predecessors, (7710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 7710 transitions. [2022-02-15 11:53:22,250 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 7710 transitions. Word has length 183 [2022-02-15 11:53:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:53:22,250 INFO L470 AbstractCegarLoop]: Abstraction has 2816 states and 7710 transitions. [2022-02-15 11:53:22,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.5625) internal successors, (297), 16 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 7710 transitions. [2022-02-15 11:53:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-02-15 11:53:22,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:53:22,256 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:53:22,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-15 11:53:22,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:22,471 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:53:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:53:22,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1641267285, now seen corresponding path program 6 times [2022-02-15 11:53:22,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:53:22,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77838520] [2022-02-15 11:53:22,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:22,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:53:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-15 11:53:23,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:53:23,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77838520] [2022-02-15 11:53:23,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77838520] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:53:23,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545404601] [2022-02-15 11:53:23,880 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-15 11:53:23,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:23,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:53:23,882 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:53:23,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-15 11:53:24,011 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-15 11:53:24,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:53:24,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 68 conjunts are in the unsatisfiable core [2022-02-15 11:53:24,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:53:24,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-15 11:53:24,260 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:53:24,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-15 11:53:26,416 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-15 11:53:26,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 75 [2022-02-15 11:53:26,433 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:26,433 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 60 treesize of output 46 [2022-02-15 11:53:26,870 INFO L353 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-02-15 11:53:26,870 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 44 treesize of output 16 [2022-02-15 11:53:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-15 11:53:26,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:53:27,283 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) is different from false [2022-02-15 11:53:27,356 WARN L838 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0))) is different from false [2022-02-15 11:53:27,389 WARN L838 $PredicateComparison]: unable to prove that (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0))) is different from false [2022-02-15 11:53:27,407 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))) (not (< c_~end~0 c_~n~0)) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0))) is different from false [2022-02-15 11:53:27,472 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0)) (< |c_thread1Thread1of1ForFork0_#t~mem5#1| .cse0)))) (not (< c_~end~0 c_~n~0)) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0))) is different from false [2022-02-15 11:53:27,530 WARN L838 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0)) (forall ((v_~i~0_42 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (select .cse3 (+ (* v_~i~0_42 4) c_~A~0.offset)))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse2)) (< (select .cse3 (+ c_~A~0.offset (* c_~i~0 4))) .cse2)))))) is different from false [2022-02-15 11:53:27,897 INFO L353 Elim1Store]: treesize reduction 93, result has 66.2 percent of original size [2022-02-15 11:53:27,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 155 treesize of output 254 [2022-02-15 11:53:27,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-15 11:53:27,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2022-02-15 11:53:27,915 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 45 treesize of output 39 [2022-02-15 11:53:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 11 not checked. [2022-02-15 11:53:34,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545404601] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:53:34,132 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:53:34,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 35] total 93 [2022-02-15 11:53:34,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791518486] [2022-02-15 11:53:34,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:53:34,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-02-15 11:53:34,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:53:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-02-15 11:53:34,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=6793, Unknown=6, NotChecked=1050, Total=8556 [2022-02-15 11:53:34,136 INFO L87 Difference]: Start difference. First operand 2816 states and 7710 transitions. Second operand has 93 states, 93 states have (on average 5.075268817204301) internal successors, (472), 93 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:48,027 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~new~0 c_~v_old~0) (= c_~ok~0 1) (or (not (< c_~end~0 c_~n~0)) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (forall ((v_ArrVal_374 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (not (= (mod c_~ok~0 256) 0))) (not (<= 0 c_~end~0)) (forall ((v_~i~0_42 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (select .cse3 (+ (* v_~i~0_42 4) c_~A~0.offset)))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse2)) (< (select .cse3 (+ c_~A~0.offset (* c_~i~0 4))) .cse2))))))) is different from false [2022-02-15 11:53:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:53:49,373 INFO L93 Difference]: Finished difference Result 7953 states and 21516 transitions. [2022-02-15 11:53:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-02-15 11:53:49,373 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 5.075268817204301) internal successors, (472), 93 states have internal predecessors, (472), 0 states have call successors, (0), 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 188 [2022-02-15 11:53:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:53:49,387 INFO L225 Difference]: With dead ends: 7953 [2022-02-15 11:53:49,387 INFO L226 Difference]: Without dead ends: 7944 [2022-02-15 11:53:49,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 341 SyntacticMatches, 53 SemanticMatches, 215 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 18144 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=4273, Invalid=39611, Unknown=34, NotChecked=2954, Total=46872 [2022-02-15 11:53:49,390 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 4582 mSDsluCounter, 11123 mSDsCounter, 0 mSdLazyCounter, 4041 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4582 SdHoareTripleChecker+Valid, 10410 SdHoareTripleChecker+Invalid, 14017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 4041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9744 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-15 11:53:49,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4582 Valid, 10410 Invalid, 14017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 4041 Invalid, 0 Unknown, 9744 Unchecked, 1.7s Time] [2022-02-15 11:53:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2022-02-15 11:53:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 3616. [2022-02-15 11:53:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3616 states, 3615 states have (on average 2.6697095435684646) internal successors, (9651), 3615 states have internal predecessors, (9651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 9651 transitions. [2022-02-15 11:53:49,465 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 9651 transitions. Word has length 188 [2022-02-15 11:53:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:53:49,465 INFO L470 AbstractCegarLoop]: Abstraction has 3616 states and 9651 transitions. [2022-02-15 11:53:49,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 5.075268817204301) internal successors, (472), 93 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:53:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 9651 transitions. [2022-02-15 11:53:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-02-15 11:53:49,471 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:53:49,471 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:53:49,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-15 11:53:49,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:49,689 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:53:49,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:53:49,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1624005731, now seen corresponding path program 7 times [2022-02-15 11:53:49,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:53:49,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692419921] [2022-02-15 11:53:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:53:49,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:53:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-15 11:53:51,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:53:51,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692419921] [2022-02-15 11:53:51,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692419921] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:53:51,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506436834] [2022-02-15 11:53:51,094 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-15 11:53:51,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:53:51,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:53:51,096 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:53:51,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-15 11:53:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:53:51,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 75 conjunts are in the unsatisfiable core [2022-02-15 11:53:51,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:53:51,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-15 11:53:51,565 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 11:53:51,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-15 11:53:53,360 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-15 11:53:53,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 74 [2022-02-15 11:53:53,378 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:53:53,379 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 59 treesize of output 45 [2022-02-15 11:53:53,871 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-02-15 11:53:53,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 13 [2022-02-15 11:53:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-15 11:53:53,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:53:54,499 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse2 0) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)))) is different from false [2022-02-15 11:53:54,661 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~start~0 1))) (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))) (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (< .cse3 0) (<= c_~n~0 .cse3) (not (<= 0 c_~end~0)))) is different from false [2022-02-15 11:53:54,745 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~start~0 1))) (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (forall ((~i~0 Int)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse2)) (< |c_thread1Thread1of1ForFork0_#t~mem5#1| .cse2)))) (not (< c_~end~0 c_~n~0)) (< .cse3 0) (<= c_~n~0 .cse3) (not (<= 0 c_~end~0)))) is different from false [2022-02-15 11:53:54,791 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (< .cse2 0) (<= c_~n~0 .cse2) (forall ((v_~i~0_46 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (< (select .cse3 (+ c_~A~0.offset (* c_~i~0 4))) .cse4) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse4)))))) (not (<= 0 c_~end~0)))) is different from false [2022-02-15 11:53:54,826 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse2 0) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)) (forall ((v_~end~0_90 Int) (v_~i~0_46 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (not (<= (+ c_~end~0 1) v_~end~0_90)) (not (< v_~end~0_90 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_90 4))) .cse3)) (< (select .cse4 (+ c_~A~0.offset (* c_~i~0 4))) .cse3))))))) is different from false [2022-02-15 11:53:54,890 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse2 0) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)) (forall ((v_~end~0_90 Int) (v_~i~0_46 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (not (<= (+ c_~end~0 1) v_~end~0_90)) (not (< v_~end~0_90 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_90 4))) .cse3)) (< (select .cse4 (+ c_~A~0.offset (* c_~i~0 4))) .cse3))))))) is different from false [2022-02-15 11:53:54,981 INFO L353 Elim1Store]: treesize reduction 89, result has 67.0 percent of original size [2022-02-15 11:53:54,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 154 treesize of output 253 [2022-02-15 11:53:55,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2022-02-15 11:53:55,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-15 11:53:55,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2022-02-15 11:54:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2022-02-15 11:54:10,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506436834] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 11:54:10,232 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 11:54:10,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36, 37] total 100 [2022-02-15 11:54:10,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731140761] [2022-02-15 11:54:10,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 11:54:10,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-02-15 11:54:10,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 11:54:10,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-02-15 11:54:10,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=887, Invalid=7866, Unknown=13, NotChecked=1134, Total=9900 [2022-02-15 11:54:10,235 INFO L87 Difference]: Start difference. First operand 3616 states and 9651 transitions. Second operand has 100 states, 100 states have (on average 4.85) internal successors, (485), 100 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:54:20,202 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~start~0 1))) (let ((.cse0 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse7 (* c_~start~0 4))) (<= (select .cse6 (+ .cse7 c_~queue~0.offset 4)) (select .cse6 (+ .cse7 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse1 (< .cse5 0)) (.cse2 (<= c_~n~0 .cse5))) (and (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) .cse0 (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) .cse1 .cse2 (not (<= 0 c_~end~0)) (forall ((v_~end~0_90 Int) (v_~i~0_46 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (not (<= (+ c_~end~0 1) v_~end~0_90)) (not (< v_~end~0_90 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_90 4))) .cse3)) (< (select .cse4 (+ c_~A~0.offset (* c_~i~0 4))) .cse3)))))) (or .cse0 .cse1 .cse2) (<= c_~new~0 c_~v_old~0) (= c_~ok~0 1)))) is different from false [2022-02-15 11:54:20,452 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~start~0 1))) (let ((.cse0 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse10 (* c_~start~0 4))) (<= (select .cse9 (+ .cse10 c_~queue~0.offset 4)) (select .cse9 (+ .cse10 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse1 (not (< c_~end~0 c_~n~0))) (.cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))) (.cse3 (< .cse8 0)) (.cse4 (<= c_~n~0 .cse8)) (.cse5 (not (<= 0 c_~end~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (forall ((v_~end~0_90 Int) (v_~i~0_46 Int)) (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (let ((.cse6 (select .cse7 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (not (<= (+ c_~end~0 1) v_~end~0_90)) (not (< v_~end~0_90 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* v_~end~0_90 4))) .cse6)) (< (select .cse7 (+ c_~A~0.offset (* c_~i~0 4))) .cse6))))))))) is different from false [2022-02-15 11:54:20,979 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~start~0 1))) (let ((.cse0 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse7 (* c_~start~0 4))) (<= (select .cse6 (+ .cse7 c_~queue~0.offset 4)) (select .cse6 (+ .cse7 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse1 (< .cse5 0)) (.cse2 (<= c_~n~0 .cse5))) (and (or .cse0 (not (< c_~end~0 c_~n~0)) .cse1 .cse2 (forall ((v_~i~0_46 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* v_~i~0_46 4))))) (or (< (select .cse3 (+ c_~A~0.offset (* c_~i~0 4))) .cse4) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse4)))))) (not (<= 0 c_~end~0))) (or .cse0 .cse1 .cse2)))) is different from false [2022-02-15 11:54:21,484 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~start~0 1))) (let ((.cse0 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse6 (* c_~start~0 4))) (<= (select .cse5 (+ .cse6 c_~queue~0.offset 4)) (select .cse5 (+ .cse6 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse2 (< .cse4 0)) (.cse3 (<= c_~n~0 .cse4))) (and (or .cse0 (forall ((~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse1)) (< |c_thread1Thread1of1ForFork0_#t~mem5#1| .cse1)))) (not (< c_~end~0 c_~n~0)) .cse2 .cse3 (not (<= 0 c_~end~0))) (or .cse0 .cse2 .cse3)))) is different from false [2022-02-15 11:54:21,617 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~start~0 1))) (let ((.cse1 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse6 (* c_~start~0 4))) (<= (select .cse5 (+ .cse6 c_~queue~0.offset 4)) (select .cse5 (+ .cse6 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse2 (< .cse4 0)) (.cse3 (<= c_~n~0 .cse4))) (and (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))) .cse1 (not (< c_~end~0 c_~n~0)) .cse2 .cse3 (not (<= 0 c_~end~0))) (or .cse1 .cse2 .cse3)))) is different from false [2022-02-15 11:54:21,768 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~start~0 1))) (let ((.cse0 (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse8 (* c_~start~0 4))) (<= (select .cse7 (+ .cse8 c_~queue~0.offset 4)) (select .cse7 (+ .cse8 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)))) (.cse1 (not (< c_~end~0 c_~n~0))) (.cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))) (.cse3 (< .cse6 0)) (.cse4 (<= c_~n~0 .cse6)) (.cse5 (not (<= 0 c_~end~0)))) (and (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)))) is different from false [2022-02-15 11:54:22,264 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse2 (+ c_~start~0 1))) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_416 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (<= (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (select .cse0 (+ .cse1 c_~queue~0.offset))))) (forall ((v_ArrVal_416 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0))) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse2 0) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)))) (= c_~ok~0 1)) is different from false [2022-02-15 11:54:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 11:54:22,729 INFO L93 Difference]: Finished difference Result 10685 states and 28964 transitions. [2022-02-15 11:54:22,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-02-15 11:54:22,730 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 4.85) internal successors, (485), 100 states have internal predecessors, (485), 0 states have call successors, (0), 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 188 [2022-02-15 11:54:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 11:54:22,748 INFO L225 Difference]: With dead ends: 10685 [2022-02-15 11:54:22,748 INFO L226 Difference]: Without dead ends: 10652 [2022-02-15 11:54:22,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 338 SyntacticMatches, 70 SemanticMatches, 192 ConstructedPredicates, 13 IntricatePredicates, 3 DeprecatedPredicates, 15005 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=3801, Invalid=28770, Unknown=61, NotChecked=4810, Total=37442 [2022-02-15 11:54:22,750 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 4704 mSDsluCounter, 9719 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4704 SdHoareTripleChecker+Valid, 9490 SdHoareTripleChecker+Invalid, 9523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6375 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-15 11:54:22,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4704 Valid, 9490 Invalid, 9523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2893 Invalid, 0 Unknown, 6375 Unchecked, 1.1s Time] [2022-02-15 11:54:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10652 states. [2022-02-15 11:54:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10652 to 4858. [2022-02-15 11:54:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4858 states, 4857 states have (on average 2.697138151122092) internal successors, (13100), 4857 states have internal predecessors, (13100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:54:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4858 states to 4858 states and 13100 transitions. [2022-02-15 11:54:22,867 INFO L78 Accepts]: Start accepts. Automaton has 4858 states and 13100 transitions. Word has length 188 [2022-02-15 11:54:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 11:54:22,867 INFO L470 AbstractCegarLoop]: Abstraction has 4858 states and 13100 transitions. [2022-02-15 11:54:22,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 4.85) internal successors, (485), 100 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 11:54:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 4858 states and 13100 transitions. [2022-02-15 11:54:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-02-15 11:54:22,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 11:54:22,876 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 11:54:22,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-15 11:54:23,110 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,SelfDestructingSolverStorable15 [2022-02-15 11:54:23,110 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-15 11:54:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 11:54:23,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1613183643, now seen corresponding path program 8 times [2022-02-15 11:54:23,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 11:54:23,111 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572727920] [2022-02-15 11:54:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 11:54:23,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 11:54:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 11:54:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-15 11:54:25,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 11:54:25,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572727920] [2022-02-15 11:54:25,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572727920] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 11:54:25,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364013128] [2022-02-15 11:54:25,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 11:54:25,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 11:54:25,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 11:54:25,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 11:54:25,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-15 11:54:25,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 11:54:25,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 11:54:25,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 89 conjunts are in the unsatisfiable core [2022-02-15 11:54:25,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 11:54:25,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-15 11:54:26,247 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-15 11:54:26,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-15 11:54:26,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-15 11:54:27,173 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-15 11:54:27,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-02-15 11:54:27,290 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 6 treesize of output 5 [2022-02-15 11:54:27,355 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 6 treesize of output 5 [2022-02-15 11:54:27,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-15 11:54:28,712 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-15 11:54:28,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 74 [2022-02-15 11:54:28,748 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:54:28,749 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 59 treesize of output 45 [2022-02-15 11:54:29,449 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-02-15 11:54:29,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 13 [2022-02-15 11:54:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 11:54:29,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 11:54:30,422 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~start~0 1))) (or (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse0 0) (<= c_~n~0 .cse0) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset)))))))) is different from false [2022-02-15 11:54:30,467 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~start~0 1))) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse0 0) (<= c_~n~0 .cse0) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse2 (* c_~start~0 4))) (<= (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (select .cse1 (+ .cse2 c_~queue~0.offset)))))))) is different from false [2022-02-15 11:54:30,491 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~start~0 1))) (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))) (not (< c_~end~0 c_~n~0)) (< .cse1 0) (<= c_~n~0 .cse1) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse3 (* c_~start~0 4))) (<= (select .cse2 (+ .cse3 c_~queue~0.offset 4)) (select .cse2 (+ .cse3 c_~queue~0.offset)))))))) is different from false [2022-02-15 11:54:30,582 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~start~0 1))) (or (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0)) (< |c_thread1Thread1of1ForFork0_#t~mem5#1| .cse0)))) (not (< c_~end~0 c_~n~0)) (< .cse1 0) (<= c_~n~0 .cse1) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse3 (* c_~start~0 4))) (<= (select .cse2 (+ .cse3 c_~queue~0.offset 4)) (select .cse2 (+ .cse3 c_~queue~0.offset)))))))) is different from false [2022-02-15 11:54:30,650 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~start~0 1))) (or (forall ((v_~i~0_50 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse1 (+ (* v_~i~0_50 4) c_~A~0.offset)))) (or (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0)) (< (select .cse1 (+ c_~A~0.offset (* c_~i~0 4))) .cse0))))) (not (< c_~end~0 c_~n~0)) (< .cse2 0) (<= c_~n~0 .cse2) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse4 (* c_~start~0 4))) (<= (select .cse3 (+ .cse4 c_~queue~0.offset 4)) (select .cse3 (+ .cse4 c_~queue~0.offset)))))))) is different from false [2022-02-15 11:54:30,696 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~start~0 1))) (or (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse0 0) (forall ((v_~end~0_95 Int) (v_~i~0_50 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse2 (+ (* v_~i~0_50 4) c_~A~0.offset)))) (or (not (= .cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ (* v_~end~0_95 4) c_~queue~0.offset)))) (not (<= (+ c_~end~0 1) v_~end~0_95)) (< (select .cse2 (+ c_~A~0.offset (* c_~i~0 4))) .cse1) (not (< v_~end~0_95 c_~n~0)))))) (<= c_~n~0 .cse0) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse4 (* c_~start~0 4))) (<= (select .cse3 (+ .cse4 c_~queue~0.offset 4)) (select .cse3 (+ .cse4 c_~queue~0.offset)))))))) is different from false [2022-02-15 11:54:30,771 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~start~0 1))) (or (not (<= |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (not (< c_~end~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (< .cse0 0) (forall ((v_~end~0_95 Int) (v_~i~0_50 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse2 (+ (* v_~i~0_50 4) c_~A~0.offset)))) (or (not (= .cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ (* v_~end~0_95 4) c_~queue~0.offset)))) (not (<= (+ c_~end~0 1) v_~end~0_95)) (< (select .cse2 (+ c_~A~0.offset (* c_~i~0 4))) .cse1) (not (< v_~end~0_95 c_~n~0)))))) (<= c_~n~0 .cse0) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse4 (* c_~start~0 4))) (<= (select .cse3 (+ .cse4 c_~queue~0.offset 4)) (select .cse3 (+ .cse4 c_~queue~0.offset)))))))) is different from false [2022-02-15 11:54:30,831 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~start~0 1))) (or (forall ((~A~0.offset Int) (v_~end~0_95 Int) (v_~i~0_50 Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse3 (select |c_#memory_int| ~A~0.base))) (let ((.cse1 (select .cse3 (+ (* ~i~0 4) ~A~0.offset))) (.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (select .cse3 (+ (* v_~i~0_50 4) ~A~0.offset)))) (or (not (= (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) .cse1)) (not (<= (+ c_~end~0 1) v_~end~0_95)) (< .cse1 .cse2) (< c_~last~0 .cse1) (not (< v_~end~0_95 c_~n~0)) (not (= (select .cse0 (+ (* v_~end~0_95 4) c_~queue~0.offset)) .cse2)))))) (not (< c_~end~0 c_~n~0)) (< .cse4 0) (<= c_~n~0 .cse4) (not (<= 0 c_~end~0)) (and (forall ((v_ArrVal_464 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) c_~queue~0.base)) (.cse6 (* c_~start~0 4))) (<= (select .cse5 (+ .cse6 c_~queue~0.offset 4)) (select .cse5 (+ .cse6 c_~queue~0.offset)))))))) is different from false [2022-02-15 11:55:59,627 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 11:55:59,627 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 295 treesize of output 187 [2022-02-15 11:55:59,846 INFO L353 Elim1Store]: treesize reduction 66, result has 82.3 percent of original size [2022-02-15 11:55:59,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 3009 treesize of output 2937 [2022-02-15 11:56:00,012 INFO L353 Elim1Store]: treesize reduction 51, result has 79.3 percent of original size [2022-02-15 11:56:00,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2937 treesize of output 2575 [2022-02-15 11:56:00,209 INFO L353 Elim1Store]: treesize reduction 51, result has 79.3 percent of original size [2022-02-15 11:56:00,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2575 treesize of output 2491 [2022-02-15 11:56:00,312 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 1323 treesize of output 1131 [2022-02-15 11:56:00,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-15 11:56:00,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1131 treesize of output 1027 [2022-02-15 11:56:00,442 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-15 11:56:00,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-15 11:56:00,659 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,SelfDestructingSolverStorable16 [2022-02-15 11:56:00,660 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.transform(TermContextTransformationEngine.java:65) 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.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) 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-02-15 11:56:00,664 INFO L158 Benchmark]: Toolchain (without parser) took 243511.49ms. Allocated memory was 210.8MB in the beginning and 811.6MB in the end (delta: 600.8MB). Free memory was 158.0MB in the beginning and 610.0MB in the end (delta: -452.1MB). Peak memory consumption was 533.2MB. Max. memory is 8.0GB. [2022-02-15 11:56:00,664 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 210.8MB. Free memory is still 174.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 11:56:00,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.03ms. Allocated memory is still 210.8MB. Free memory was 157.8MB in the beginning and 183.7MB in the end (delta: -25.9MB). Peak memory consumption was 4.0MB. Max. memory is 8.0GB. [2022-02-15 11:56:00,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.27ms. Allocated memory is still 210.8MB. Free memory was 183.7MB in the beginning and 181.6MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-15 11:56:00,665 INFO L158 Benchmark]: Boogie Preprocessor took 39.01ms. Allocated memory is still 210.8MB. Free memory was 181.6MB in the beginning and 180.0MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-15 11:56:00,665 INFO L158 Benchmark]: RCFGBuilder took 587.34ms. Allocated memory is still 210.8MB. Free memory was 179.7MB in the beginning and 158.5MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-02-15 11:56:00,665 INFO L158 Benchmark]: TraceAbstraction took 242570.35ms. Allocated memory was 210.8MB in the beginning and 811.6MB in the end (delta: 600.8MB). Free memory was 158.0MB in the beginning and 610.0MB in the end (delta: -452.1MB). Peak memory consumption was 534.4MB. Max. memory is 8.0GB. [2022-02-15 11:56:00,666 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 210.8MB. Free memory is still 174.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.03ms. Allocated memory is still 210.8MB. Free memory was 157.8MB in the beginning and 183.7MB in the end (delta: -25.9MB). Peak memory consumption was 4.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.27ms. Allocated memory is still 210.8MB. Free memory was 183.7MB in the beginning and 181.6MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.01ms. Allocated memory is still 210.8MB. Free memory was 181.6MB in the beginning and 180.0MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 587.34ms. Allocated memory is still 210.8MB. Free memory was 179.7MB in the beginning and 158.5MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 242570.35ms. Allocated memory was 210.8MB in the beginning and 811.6MB in the end (delta: 600.8MB). Free memory was 158.0MB in the beginning and 610.0MB in the end (delta: -452.1MB). Peak memory consumption was 534.4MB. 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-02-15 11:56:00,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...