/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-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 17:31:41,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 17:31:41,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 17:31:42,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 17:31:42,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 17:31:42,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 17:31:42,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 17:31:42,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 17:31:42,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 17:31:42,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 17:31:42,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 17:31:42,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 17:31:42,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 17:31:42,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 17:31:42,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 17:31:42,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 17:31:42,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 17:31:42,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 17:31:42,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 17:31:42,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 17:31:42,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 17:31:42,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 17:31:42,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 17:31:42,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 17:31:42,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 17:31:42,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 17:31:42,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 17:31:42,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 17:31:42,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 17:31:42,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 17:31:42,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 17:31:42,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 17:31:42,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 17:31:42,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 17:31:42,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 17:31:42,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 17:31:42,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 17:31:42,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 17:31:42,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 17:31:42,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 17:31:42,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 17:31:42,076 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-03 17:31:42,099 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 17:31:42,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 17:31:42,100 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 17:31:42,100 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 17:31:42,100 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 17:31:42,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 17:31:42,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 17:31:42,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 17:31:42,101 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 17:31:42,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 17:31:42,102 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 17:31:42,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 17:31:42,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 17:31:42,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 17:31:42,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 17:31:42,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 17:31:42,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 17:31:42,103 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 17:31:42,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 17:31:42,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 17:31:42,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 17:31:42,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 17:31:42,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 17:31:42,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 17:31:42,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 17:31:42,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:31:42,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 17:31:42,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 17:31:42,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 17:31:42,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 17:31:42,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 17:31:42,105 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 17:31:42,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 17:31:42,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-03 17:31:42,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 17:31:42,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 17:31:42,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 17:31:42,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 17:31:42,277 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 17:31:42,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-03-03 17:31:42,322 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e2a6142/c832237480a24aed9e2ace471ac51e19/FLAG2f28c61fb [2022-03-03 17:31:42,746 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 17:31:42,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-03-03 17:31:42,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e2a6142/c832237480a24aed9e2ace471ac51e19/FLAG2f28c61fb [2022-03-03 17:31:42,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e2a6142/c832237480a24aed9e2ace471ac51e19 [2022-03-03 17:31:42,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 17:31:42,775 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 17:31:42,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 17:31:42,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 17:31:42,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 17:31:42,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:31:42" (1/1) ... [2022-03-03 17:31:42,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f10a84e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:42, skipping insertion in model container [2022-03-03 17:31:42,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:31:42" (1/1) ... [2022-03-03 17:31:42,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 17:31:42,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 17:31:42,994 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-queue-add-2-nl.wvr.c[2870,2883] [2022-03-03 17:31:43,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:31:43,016 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 17:31:43,044 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-queue-add-2-nl.wvr.c[2870,2883] [2022-03-03 17:31:43,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:31:43,056 INFO L208 MainTranslator]: Completed translation [2022-03-03 17:31:43,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43 WrapperNode [2022-03-03 17:31:43,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 17:31:43,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 17:31:43,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 17:31:43,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 17:31:43,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43" (1/1) ... [2022-03-03 17:31:43,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43" (1/1) ... [2022-03-03 17:31:43,102 INFO L137 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 163 [2022-03-03 17:31:43,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 17:31:43,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 17:31:43,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 17:31:43,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 17:31:43,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43" (1/1) ... [2022-03-03 17:31:43,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43" (1/1) ... [2022-03-03 17:31:43,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43" (1/1) ... [2022-03-03 17:31:43,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43" (1/1) ... [2022-03-03 17:31:43,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43" (1/1) ... [2022-03-03 17:31:43,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43" (1/1) ... [2022-03-03 17:31:43,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43" (1/1) ... [2022-03-03 17:31:43,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 17:31:43,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 17:31:43,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 17:31:43,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 17:31:43,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43" (1/1) ... [2022-03-03 17:31:43,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:31:43,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:31:43,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-03 17:31:43,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-03 17:31:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 17:31:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 17:31:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 17:31:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 17:31:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-03 17:31:43,193 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-03 17:31:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-03 17:31:43,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-03 17:31:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 17:31:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-03 17:31:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-03 17:31:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-03 17:31:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 17:31:43,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 17:31:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 17:31:43,195 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 17:31:43,272 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 17:31:43,273 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 17:31:43,501 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 17:31:43,617 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 17:31:43,618 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-03 17:31:43,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:31:43 BoogieIcfgContainer [2022-03-03 17:31:43,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 17:31:43,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 17:31:43,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 17:31:43,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 17:31:43,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:31:42" (1/3) ... [2022-03-03 17:31:43,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e383a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:31:43, skipping insertion in model container [2022-03-03 17:31:43,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:31:43" (2/3) ... [2022-03-03 17:31:43,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e383a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:31:43, skipping insertion in model container [2022-03-03 17:31:43,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:31:43" (3/3) ... [2022-03-03 17:31:43,626 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2022-03-03 17:31:43,631 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 17:31:43,631 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 17:31:43,631 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-03 17:31:43,631 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 17:31:43,681 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,682 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,682 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,682 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,682 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,682 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,682 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,685 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,685 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,685 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,685 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,685 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,685 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,685 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,687 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,687 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,687 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,687 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,687 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,687 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,687 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,688 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,688 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,688 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,688 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,688 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,688 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,688 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,688 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,688 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,689 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,689 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,689 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,689 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,689 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,689 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,690 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,692 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,692 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,692 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,694 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,694 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,694 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,694 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,694 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,694 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,694 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:31:43,696 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-03 17:31:43,738 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 17:31:43,744 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 17:31:43,744 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-03 17:31:43,758 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 145 transitions, 306 flow [2022-03-03 17:31:43,824 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-03 17:31:43,845 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:43,845 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] [2022-03-03 17:31:43,846 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:43,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash -27169455, now seen corresponding path program 1 times [2022-03-03 17:31:43,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:43,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981413436] [2022-03-03 17:31:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:31:44,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:44,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981413436] [2022-03-03 17:31:44,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981413436] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:44,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:44,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 17:31:44,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180246699] [2022-03-03 17:31:44,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:44,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 17:31:44,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:44,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 17:31:44,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:31:44,132 INFO L87 Difference]: Start difference. First operand has 673 states, 672 states have (on average 2.6324404761904763) internal successors, (1769), 672 states have internal predecessors, (1769), 0 states have call successors, (0), 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 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:44,169 INFO L93 Difference]: Finished difference Result 673 states and 1616 transitions. [2022-03-03 17:31:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 17:31:44,171 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-03-03 17:31:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:44,183 INFO L225 Difference]: With dead ends: 673 [2022-03-03 17:31:44,184 INFO L226 Difference]: Without dead ends: 669 [2022-03-03 17:31:44,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:31:44,187 INFO L933 BasicCegarLoop]: 119 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, 119 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-03-03 17:31:44,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:31:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-03-03 17:31:44,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2022-03-03 17:31:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 2.413173652694611) internal successors, (1612), 668 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1612 transitions. [2022-03-03 17:31:44,246 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1612 transitions. Word has length 104 [2022-03-03 17:31:44,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:44,247 INFO L470 AbstractCegarLoop]: Abstraction has 669 states and 1612 transitions. [2022-03-03 17:31:44,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1612 transitions. [2022-03-03 17:31:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-03-03 17:31:44,258 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:44,258 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] [2022-03-03 17:31:44,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 17:31:44,258 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:44,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1160132223, now seen corresponding path program 1 times [2022-03-03 17:31:44,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:44,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865587855] [2022-03-03 17:31:44,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:44,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:31:44,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:44,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865587855] [2022-03-03 17:31:44,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865587855] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:44,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:44,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 17:31:44,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000674937] [2022-03-03 17:31:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:44,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 17:31:44,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 17:31:44,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-03 17:31:44,424 INFO L87 Difference]: Start difference. First operand 669 states and 1612 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:44,498 INFO L93 Difference]: Finished difference Result 778 states and 1820 transitions. [2022-03-03 17:31:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 17:31:44,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-03-03 17:31:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:44,502 INFO L225 Difference]: With dead ends: 778 [2022-03-03 17:31:44,502 INFO L226 Difference]: Without dead ends: 675 [2022-03-03 17:31:44,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-03 17:31:44,503 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 278 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:44,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 329 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:31:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-03-03 17:31:44,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 670. [2022-03-03 17:31:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 2.411061285500747) internal successors, (1613), 669 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1613 transitions. [2022-03-03 17:31:44,529 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1613 transitions. Word has length 108 [2022-03-03 17:31:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:44,530 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 1613 transitions. [2022-03-03 17:31:44,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1613 transitions. [2022-03-03 17:31:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:44,536 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:44,536 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] [2022-03-03 17:31:44,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 17:31:44,537 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:44,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1866616762, now seen corresponding path program 1 times [2022-03-03 17:31:44,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:44,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013573855] [2022-03-03 17:31:44,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:44,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:44,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013573855] [2022-03-03 17:31:44,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013573855] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:44,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:44,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 17:31:44,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945925450] [2022-03-03 17:31:44,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:44,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 17:31:44,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:44,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 17:31:44,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 17:31:44,641 INFO L87 Difference]: Start difference. First operand 670 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:44,668 INFO L93 Difference]: Finished difference Result 712 states and 1721 transitions. [2022-03-03 17:31:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 17:31:44,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:44,672 INFO L225 Difference]: With dead ends: 712 [2022-03-03 17:31:44,672 INFO L226 Difference]: Without dead ends: 712 [2022-03-03 17:31:44,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 17:31:44,673 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:44,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:31:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-03-03 17:31:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2022-03-03 17:31:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 2.420534458509142) internal successors, (1721), 711 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1721 transitions. [2022-03-03 17:31:44,697 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1721 transitions. Word has length 115 [2022-03-03 17:31:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:44,699 INFO L470 AbstractCegarLoop]: Abstraction has 712 states and 1721 transitions. [2022-03-03 17:31:44,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1721 transitions. [2022-03-03 17:31:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:44,702 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:44,702 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] [2022-03-03 17:31:44,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 17:31:44,705 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:44,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1016891364, now seen corresponding path program 2 times [2022-03-03 17:31:44,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:44,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950315921] [2022-03-03 17:31:44,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:45,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:45,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950315921] [2022-03-03 17:31:45,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950315921] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:45,376 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:45,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 17:31:45,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059411604] [2022-03-03 17:31:45,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:45,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:31:45,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:45,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:31:45,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:31:45,379 INFO L87 Difference]: Start difference. First operand 712 states and 1721 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:45,662 INFO L93 Difference]: Finished difference Result 1064 states and 2599 transitions. [2022-03-03 17:31:45,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 17:31:45,663 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:45,667 INFO L225 Difference]: With dead ends: 1064 [2022-03-03 17:31:45,667 INFO L226 Difference]: Without dead ends: 1013 [2022-03-03 17:31:45,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-03-03 17:31:45,668 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 203 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:45,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 1237 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 17:31:45,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2022-03-03 17:31:45,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 774. [2022-03-03 17:31:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 2.4307891332470892) internal successors, (1879), 773 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1879 transitions. [2022-03-03 17:31:45,684 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1879 transitions. Word has length 115 [2022-03-03 17:31:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:45,684 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 1879 transitions. [2022-03-03 17:31:45,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1879 transitions. [2022-03-03 17:31:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:45,686 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:45,686 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] [2022-03-03 17:31:45,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 17:31:45,686 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1424716348, now seen corresponding path program 3 times [2022-03-03 17:31:45,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:45,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063510473] [2022-03-03 17:31:45,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:45,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:46,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:46,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063510473] [2022-03-03 17:31:46,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063510473] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:46,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:46,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 17:31:46,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311008307] [2022-03-03 17:31:46,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:46,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:31:46,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:46,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:31:46,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:31:46,052 INFO L87 Difference]: Start difference. First operand 774 states and 1879 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:46,335 INFO L93 Difference]: Finished difference Result 1112 states and 2694 transitions. [2022-03-03 17:31:46,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 17:31:46,336 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:46,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:46,340 INFO L225 Difference]: With dead ends: 1112 [2022-03-03 17:31:46,340 INFO L226 Difference]: Without dead ends: 1061 [2022-03-03 17:31:46,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-03-03 17:31:46,341 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 199 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:46,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 1514 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 17:31:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2022-03-03 17:31:46,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 778. [2022-03-03 17:31:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 2.4375804375804377) internal successors, (1894), 777 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1894 transitions. [2022-03-03 17:31:46,362 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1894 transitions. Word has length 115 [2022-03-03 17:31:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:46,363 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1894 transitions. [2022-03-03 17:31:46,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1894 transitions. [2022-03-03 17:31:46,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:46,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:46,365 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] [2022-03-03 17:31:46,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 17:31:46,365 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:46,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:46,366 INFO L85 PathProgramCache]: Analyzing trace with hash 122927162, now seen corresponding path program 4 times [2022-03-03 17:31:46,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:46,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456061498] [2022-03-03 17:31:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:46,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:46,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456061498] [2022-03-03 17:31:46,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456061498] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:46,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:46,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 17:31:46,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735881796] [2022-03-03 17:31:46,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:46,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:31:46,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:46,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:31:46,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:31:46,690 INFO L87 Difference]: Start difference. First operand 778 states and 1894 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:46,904 INFO L93 Difference]: Finished difference Result 1013 states and 2475 transitions. [2022-03-03 17:31:46,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 17:31:46,904 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:46,908 INFO L225 Difference]: With dead ends: 1013 [2022-03-03 17:31:46,908 INFO L226 Difference]: Without dead ends: 950 [2022-03-03 17:31:46,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-03-03 17:31:46,909 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 184 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:46,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 1123 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:31:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-03-03 17:31:46,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 778. [2022-03-03 17:31:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 2.4324324324324325) internal successors, (1890), 777 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1890 transitions. [2022-03-03 17:31:46,926 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1890 transitions. Word has length 115 [2022-03-03 17:31:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:46,926 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1890 transitions. [2022-03-03 17:31:46,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1890 transitions. [2022-03-03 17:31:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:46,951 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:46,951 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] [2022-03-03 17:31:46,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-03 17:31:46,952 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:46,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1038328538, now seen corresponding path program 5 times [2022-03-03 17:31:46,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:46,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558802108] [2022-03-03 17:31:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:47,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:47,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558802108] [2022-03-03 17:31:47,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558802108] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:47,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:47,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 17:31:47,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643282811] [2022-03-03 17:31:47,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:47,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:31:47,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:47,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:31:47,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:31:47,312 INFO L87 Difference]: Start difference. First operand 778 states and 1890 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:47,517 INFO L93 Difference]: Finished difference Result 1113 states and 2715 transitions. [2022-03-03 17:31:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 17:31:47,517 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:47,521 INFO L225 Difference]: With dead ends: 1113 [2022-03-03 17:31:47,521 INFO L226 Difference]: Without dead ends: 1062 [2022-03-03 17:31:47,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-03-03 17:31:47,524 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 200 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:47,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 1364 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:31:47,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-03-03 17:31:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 823. [2022-03-03 17:31:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 2.427007299270073) internal successors, (1995), 822 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1995 transitions. [2022-03-03 17:31:47,559 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1995 transitions. Word has length 115 [2022-03-03 17:31:47,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:47,559 INFO L470 AbstractCegarLoop]: Abstraction has 823 states and 1995 transitions. [2022-03-03 17:31:47,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1995 transitions. [2022-03-03 17:31:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:47,561 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:47,561 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] [2022-03-03 17:31:47,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-03 17:31:47,562 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:47,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:47,563 INFO L85 PathProgramCache]: Analyzing trace with hash 892649658, now seen corresponding path program 6 times [2022-03-03 17:31:47,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:47,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757703318] [2022-03-03 17:31:47,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:47,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:47,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:47,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757703318] [2022-03-03 17:31:47,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757703318] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:47,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:47,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 17:31:47,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596648731] [2022-03-03 17:31:47,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:47,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:31:47,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:47,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:31:47,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:31:47,922 INFO L87 Difference]: Start difference. First operand 823 states and 1995 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:48,225 INFO L93 Difference]: Finished difference Result 1235 states and 2985 transitions. [2022-03-03 17:31:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 17:31:48,225 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:48,229 INFO L225 Difference]: With dead ends: 1235 [2022-03-03 17:31:48,229 INFO L226 Difference]: Without dead ends: 1184 [2022-03-03 17:31:48,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-03-03 17:31:48,230 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 231 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:48,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 1467 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 17:31:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2022-03-03 17:31:48,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 909. [2022-03-03 17:31:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 2.4129955947136565) internal successors, (2191), 908 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 2191 transitions. [2022-03-03 17:31:48,247 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 2191 transitions. Word has length 115 [2022-03-03 17:31:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:48,247 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 2191 transitions. [2022-03-03 17:31:48,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 2191 transitions. [2022-03-03 17:31:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:48,249 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:48,249 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] [2022-03-03 17:31:48,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-03 17:31:48,250 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:48,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1515110916, now seen corresponding path program 7 times [2022-03-03 17:31:48,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:48,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827813733] [2022-03-03 17:31:48,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:48,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:48,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827813733] [2022-03-03 17:31:48,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827813733] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:48,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:48,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 17:31:48,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531820652] [2022-03-03 17:31:48,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:48,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:31:48,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:48,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:31:48,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:31:48,569 INFO L87 Difference]: Start difference. First operand 909 states and 2191 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:48,789 INFO L93 Difference]: Finished difference Result 1193 states and 2870 transitions. [2022-03-03 17:31:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 17:31:48,789 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:48,793 INFO L225 Difference]: With dead ends: 1193 [2022-03-03 17:31:48,793 INFO L226 Difference]: Without dead ends: 1142 [2022-03-03 17:31:48,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-03-03 17:31:48,795 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 238 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:48,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 1139 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:31:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-03-03 17:31:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 913. [2022-03-03 17:31:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 2.418859649122807) internal successors, (2206), 912 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 2206 transitions. [2022-03-03 17:31:48,811 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 2206 transitions. Word has length 115 [2022-03-03 17:31:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:48,811 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 2206 transitions. [2022-03-03 17:31:48,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 2206 transitions. [2022-03-03 17:31:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:48,813 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:48,813 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] [2022-03-03 17:31:48,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-03 17:31:48,813 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:48,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1478067194, now seen corresponding path program 8 times [2022-03-03 17:31:48,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:48,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985898860] [2022-03-03 17:31:48,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:48,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:49,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:49,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985898860] [2022-03-03 17:31:49,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985898860] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:49,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:49,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 17:31:49,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918313939] [2022-03-03 17:31:49,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:49,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:31:49,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:31:49,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:31:49,097 INFO L87 Difference]: Start difference. First operand 913 states and 2206 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:49,287 INFO L93 Difference]: Finished difference Result 1094 states and 2651 transitions. [2022-03-03 17:31:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 17:31:49,288 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:49,291 INFO L225 Difference]: With dead ends: 1094 [2022-03-03 17:31:49,291 INFO L226 Difference]: Without dead ends: 1031 [2022-03-03 17:31:49,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2022-03-03 17:31:49,292 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 205 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:49,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 1020 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:31:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2022-03-03 17:31:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 885. [2022-03-03 17:31:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 2.408371040723982) internal successors, (2129), 884 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 2129 transitions. [2022-03-03 17:31:49,309 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 2129 transitions. Word has length 115 [2022-03-03 17:31:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:49,310 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 2129 transitions. [2022-03-03 17:31:49,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 2129 transitions. [2022-03-03 17:31:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:49,312 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:49,312 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] [2022-03-03 17:31:49,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-03 17:31:49,312 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:49,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:49,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2058803320, now seen corresponding path program 9 times [2022-03-03 17:31:49,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:49,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304012625] [2022-03-03 17:31:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:49,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:49,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304012625] [2022-03-03 17:31:49,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304012625] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:49,623 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:49,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 17:31:49,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427240073] [2022-03-03 17:31:49,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:49,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:31:49,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:49,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:31:49,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:31:49,624 INFO L87 Difference]: Start difference. First operand 885 states and 2129 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:49,898 INFO L93 Difference]: Finished difference Result 1171 states and 2834 transitions. [2022-03-03 17:31:49,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 17:31:49,898 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:49,902 INFO L225 Difference]: With dead ends: 1171 [2022-03-03 17:31:49,902 INFO L226 Difference]: Without dead ends: 1120 [2022-03-03 17:31:49,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2022-03-03 17:31:49,903 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 186 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:49,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 1139 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 17:31:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2022-03-03 17:31:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 901. [2022-03-03 17:31:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 2.4144444444444444) internal successors, (2173), 900 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 2173 transitions. [2022-03-03 17:31:49,918 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 2173 transitions. Word has length 115 [2022-03-03 17:31:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:49,918 INFO L470 AbstractCegarLoop]: Abstraction has 901 states and 2173 transitions. [2022-03-03 17:31:49,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 2173 transitions. [2022-03-03 17:31:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:49,920 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:49,920 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] [2022-03-03 17:31:49,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-03 17:31:49,921 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:49,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:49,921 INFO L85 PathProgramCache]: Analyzing trace with hash 382804392, now seen corresponding path program 10 times [2022-03-03 17:31:49,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:49,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542437087] [2022-03-03 17:31:49,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:49,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:50,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:50,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542437087] [2022-03-03 17:31:50,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542437087] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:50,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:50,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 17:31:50,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442791364] [2022-03-03 17:31:50,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:50,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:31:50,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:50,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:31:50,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:31:50,243 INFO L87 Difference]: Start difference. First operand 901 states and 2173 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:50,499 INFO L93 Difference]: Finished difference Result 1189 states and 2859 transitions. [2022-03-03 17:31:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 17:31:50,499 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:50,503 INFO L225 Difference]: With dead ends: 1189 [2022-03-03 17:31:50,503 INFO L226 Difference]: Without dead ends: 1138 [2022-03-03 17:31:50,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-03-03 17:31:50,504 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 188 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:50,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 1286 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 17:31:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-03-03 17:31:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 905. [2022-03-03 17:31:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 2.420353982300885) internal successors, (2188), 904 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 2188 transitions. [2022-03-03 17:31:50,541 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 2188 transitions. Word has length 115 [2022-03-03 17:31:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:50,541 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 2188 transitions. [2022-03-03 17:31:50,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 2188 transitions. [2022-03-03 17:31:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:50,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:50,543 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] [2022-03-03 17:31:50,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-03 17:31:50,543 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -918984794, now seen corresponding path program 11 times [2022-03-03 17:31:50,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:50,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076935406] [2022-03-03 17:31:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:50,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:50,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076935406] [2022-03-03 17:31:50,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076935406] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:50,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:50,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 17:31:50,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093317721] [2022-03-03 17:31:50,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:50,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:31:50,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:50,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:31:50,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:31:50,816 INFO L87 Difference]: Start difference. First operand 905 states and 2188 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:51,022 INFO L93 Difference]: Finished difference Result 1090 states and 2640 transitions. [2022-03-03 17:31:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 17:31:51,022 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:51,026 INFO L225 Difference]: With dead ends: 1090 [2022-03-03 17:31:51,026 INFO L226 Difference]: Without dead ends: 1027 [2022-03-03 17:31:51,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-03-03 17:31:51,027 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 194 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:51,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 1097 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:31:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-03-03 17:31:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 897. [2022-03-03 17:31:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 896 states have (on average 2.4129464285714284) internal successors, (2162), 896 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 2162 transitions. [2022-03-03 17:31:51,041 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 2162 transitions. Word has length 115 [2022-03-03 17:31:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:51,041 INFO L470 AbstractCegarLoop]: Abstraction has 897 states and 2162 transitions. [2022-03-03 17:31:51,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 2162 transitions. [2022-03-03 17:31:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-03-03 17:31:51,043 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:51,043 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] [2022-03-03 17:31:51,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-03 17:31:51,043 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:51,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash -3583418, now seen corresponding path program 12 times [2022-03-03 17:31:51,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:51,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69325891] [2022-03-03 17:31:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:51,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:31:51,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:51,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69325891] [2022-03-03 17:31:51,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69325891] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:51,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:51,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-03 17:31:51,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427611873] [2022-03-03 17:31:51,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:51,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:31:51,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:51,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:31:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:31:51,322 INFO L87 Difference]: Start difference. First operand 897 states and 2162 transitions. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:51,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:51,574 INFO L93 Difference]: Finished difference Result 1201 states and 2904 transitions. [2022-03-03 17:31:51,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 17:31:51,574 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-03-03 17:31:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:51,578 INFO L225 Difference]: With dead ends: 1201 [2022-03-03 17:31:51,578 INFO L226 Difference]: Without dead ends: 1150 [2022-03-03 17:31:51,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-03-03 17:31:51,579 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 202 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:51,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 1037 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 17:31:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-03-03 17:31:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 869. [2022-03-03 17:31:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 2.402073732718894) internal successors, (2085), 868 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2085 transitions. [2022-03-03 17:31:51,594 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2085 transitions. Word has length 115 [2022-03-03 17:31:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:51,595 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 2085 transitions. [2022-03-03 17:31:51,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2085 transitions. [2022-03-03 17:31:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-03 17:31:51,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:51,597 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:31:51,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-03 17:31:51,597 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:51,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:51,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1756827106, now seen corresponding path program 1 times [2022-03-03 17:31:51,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:51,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427386417] [2022-03-03 17:31:51,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:51,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:31:51,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:51,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427386417] [2022-03-03 17:31:51,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427386417] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:31:51,631 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:31:51,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-03 17:31:51,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087442392] [2022-03-03 17:31:51,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:31:51,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-03 17:31:51,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:51,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-03 17:31:51,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-03 17:31:51,632 INFO L87 Difference]: Start difference. First operand 869 states and 2085 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:51,651 INFO L93 Difference]: Finished difference Result 1737 states and 4340 transitions. [2022-03-03 17:31:51,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-03 17:31:51,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-03-03 17:31:51,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:51,656 INFO L225 Difference]: With dead ends: 1737 [2022-03-03 17:31:51,656 INFO L226 Difference]: Without dead ends: 1520 [2022-03-03 17:31:51,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-03 17:31:51,657 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 117 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:51,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 272 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:31:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2022-03-03 17:31:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1212. [2022-03-03 17:31:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 2.564822460776218) internal successors, (3106), 1211 states have internal predecessors, (3106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 3106 transitions. [2022-03-03 17:31:51,679 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 3106 transitions. Word has length 120 [2022-03-03 17:31:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:51,680 INFO L470 AbstractCegarLoop]: Abstraction has 1212 states and 3106 transitions. [2022-03-03 17:31:51,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 3106 transitions. [2022-03-03 17:31:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-03 17:31:51,682 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:51,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:31:51,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-03 17:31:51,682 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash -293483883, now seen corresponding path program 1 times [2022-03-03 17:31:51,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:51,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829995177] [2022-03-03 17:31:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:31:51,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:51,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829995177] [2022-03-03 17:31:51,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829995177] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:31:51,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225419361] [2022-03-03 17:31:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:51,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:31:51,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:31:51,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:31:51,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-03 17:31:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:51,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-03 17:31:51,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:31:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:31:52,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:31:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:31:52,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225419361] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:31:52,411 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:31:52,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-03 17:31:52,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371389437] [2022-03-03 17:31:52,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:31:52,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-03 17:31:52,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:52,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-03 17:31:52,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-03-03 17:31:52,412 INFO L87 Difference]: Start difference. First operand 1212 states and 3106 transitions. Second operand has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:52,565 INFO L93 Difference]: Finished difference Result 1683 states and 4216 transitions. [2022-03-03 17:31:52,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 17:31:52,566 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-03-03 17:31:52,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:52,570 INFO L225 Difference]: With dead ends: 1683 [2022-03-03 17:31:52,570 INFO L226 Difference]: Without dead ends: 1224 [2022-03-03 17:31:52,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-03-03 17:31:52,570 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 739 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:52,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 741 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:31:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2022-03-03 17:31:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2022-03-03 17:31:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1218 states have (on average 2.5558292282430215) internal successors, (3113), 1218 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3113 transitions. [2022-03-03 17:31:52,588 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3113 transitions. Word has length 121 [2022-03-03 17:31:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:52,588 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 3113 transitions. [2022-03-03 17:31:52,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.526315789473685) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3113 transitions. [2022-03-03 17:31:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-03-03 17:31:52,590 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:52,590 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:31:52,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-03 17:31:52,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-03 17:31:52,809 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:31:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash -927741638, now seen corresponding path program 2 times [2022-03-03 17:31:52,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:52,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987466128] [2022-03-03 17:31:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:31:53,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:53,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987466128] [2022-03-03 17:31:53,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987466128] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:31:53,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135958359] [2022-03-03 17:31:53,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:31:53,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:31:53,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:31:53,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:31:53,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-03 17:31:53,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:31:53,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:31:53,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-03 17:31:53,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:31:54,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:31:54,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:31:54,776 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-03 17:31:54,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-03-03 17:31:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:31:54,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:31:55,131 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:55,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-03-03 17:31:55,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-03 17:31:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:31:56,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135958359] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:31:56,385 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:31:56,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 21] total 62 [2022-03-03 17:31:56,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658894068] [2022-03-03 17:31:56,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:31:56,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-03 17:31:56,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:56,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-03 17:31:56,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3434, Unknown=2, NotChecked=0, Total=3782 [2022-03-03 17:31:56,388 INFO L87 Difference]: Start difference. First operand 1219 states and 3113 transitions. Second operand has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:59,709 INFO L93 Difference]: Finished difference Result 5266 states and 13499 transitions. [2022-03-03 17:31:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-03 17:31:59,710 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2022-03-03 17:31:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:59,732 INFO L225 Difference]: With dead ends: 5266 [2022-03-03 17:31:59,733 INFO L226 Difference]: Without dead ends: 5254 [2022-03-03 17:31:59,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 230 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1470, Invalid=9845, Unknown=27, NotChecked=0, Total=11342 [2022-03-03 17:31:59,735 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 2123 mSDsluCounter, 6489 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2123 SdHoareTripleChecker+Valid, 6401 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:59,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2123 Valid, 6401 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1730 Invalid, 0 Unknown, 346 Unchecked, 0.8s Time] [2022-03-03 17:31:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2022-03-03 17:31:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 3004. [2022-03-03 17:31:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 3003 states have (on average 2.668997668997669) internal successors, (8015), 3003 states have internal predecessors, (8015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 8015 transitions. [2022-03-03 17:31:59,864 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 8015 transitions. Word has length 128 [2022-03-03 17:31:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:59,864 INFO L470 AbstractCegarLoop]: Abstraction has 3004 states and 8015 transitions. [2022-03-03 17:31:59,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.838709677419355) internal successors, (300), 62 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:31:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 8015 transitions. [2022-03-03 17:31:59,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-03-03 17:31:59,870 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:59,870 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:31:59,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-03 17:32:00,086 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,SelfDestructingSolverStorable16 [2022-03-03 17:32:00,086 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:32:00,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:32:00,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1102347870, now seen corresponding path program 3 times [2022-03-03 17:32:00,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:32:00,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697427786] [2022-03-03 17:32:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:32:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:32:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:32:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:32:00,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:32:00,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697427786] [2022-03-03 17:32:00,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697427786] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:32:00,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939968835] [2022-03-03 17:32:00,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:32:00,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:32:00,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:32:00,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:32:00,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-03 17:32:00,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:32:00,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:32:00,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-03 17:32:00,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:32:01,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:32:01,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:32:01,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-03 17:32:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:32:01,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:32:01,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_258 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_258) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-03 17:32:01,412 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:01,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-03-03 17:32:01,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-03 17:32:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:32:01,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939968835] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:32:01,853 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:32:01,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 39 [2022-03-03 17:32:01,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514095988] [2022-03-03 17:32:01,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:32:01,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-03 17:32:01,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:32:01,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-03 17:32:01,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1312, Unknown=1, NotChecked=72, Total=1482 [2022-03-03 17:32:01,855 INFO L87 Difference]: Start difference. First operand 3004 states and 8015 transitions. Second operand has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:32:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:32:04,634 INFO L93 Difference]: Finished difference Result 5956 states and 15868 transitions. [2022-03-03 17:32:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-03 17:32:04,635 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 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 128 [2022-03-03 17:32:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:32:04,646 INFO L225 Difference]: With dead ends: 5956 [2022-03-03 17:32:04,646 INFO L226 Difference]: Without dead ends: 5956 [2022-03-03 17:32:04,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 238 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=702, Invalid=4557, Unknown=1, NotChecked=142, Total=5402 [2022-03-03 17:32:04,648 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 1738 mSDsluCounter, 3641 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:32:04,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1738 Valid, 3598 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1417 Invalid, 0 Unknown, 272 Unchecked, 0.6s Time] [2022-03-03 17:32:04,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2022-03-03 17:32:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 2795. [2022-03-03 17:32:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2795 states, 2794 states have (on average 2.6385110952040085) internal successors, (7372), 2794 states have internal predecessors, (7372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:32:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 7372 transitions. [2022-03-03 17:32:04,749 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 7372 transitions. Word has length 128 [2022-03-03 17:32:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:32:04,750 INFO L470 AbstractCegarLoop]: Abstraction has 2795 states and 7372 transitions. [2022-03-03 17:32:04,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:32:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 7372 transitions. [2022-03-03 17:32:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:32:04,755 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:32:04,755 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:32:04,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-03 17:32:04,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-03 17:32:04,974 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:32:04,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:32:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1695806250, now seen corresponding path program 1 times [2022-03-03 17:32:04,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:32:04,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369491220] [2022-03-03 17:32:04,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:32:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:32:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:32:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:32:06,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:32:06,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369491220] [2022-03-03 17:32:06,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369491220] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:32:06,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689942713] [2022-03-03 17:32:06,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:32:06,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:32:06,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:32:06,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:32:06,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-03 17:32:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:32:06,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-03 17:32:06,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:32:08,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:32:08,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:32:08,736 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-03 17:32:08,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-03-03 17:32:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:32:09,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:32:10,455 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:10,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:32:10,459 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 66 treesize of output 60 [2022-03-03 17:32:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:32:23,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689942713] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:32:23,215 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:32:23,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 36] total 101 [2022-03-03 17:32:23,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724834808] [2022-03-03 17:32:23,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:32:23,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-03-03 17:32:23,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:32:23,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-03-03 17:32:23,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=9298, Unknown=19, NotChecked=0, Total=10100 [2022-03-03 17:32:23,218 INFO L87 Difference]: Start difference. First operand 2795 states and 7372 transitions. Second operand has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:32:27,396 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse3 (not (< c_~q_back~0 c_~n~0))) (.cse5 (forall ((v_ArrVal_287 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_287) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (and (= c_~y~0 0) (or .cse0 (and .cse1 (= c_~N~0 .cse2)) .cse3 .cse4) (or (and .cse1 .cse5) .cse0 .cse3 .cse4) (or .cse0 .cse3 (and .cse1 (= (+ c_~s~0 .cse2) c_~N~0)) .cse4) (or .cse0 .cse3 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse1) .cse4) (or .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse3 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse8 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse7 (+ .cse8 aux_mod_aux_mod_~C~0_30_61)) (.cse6 (* 4294967295 c_~x~0))) (or (<= (+ .cse6 c_~y~0 4294967296) .cse7) (= (+ (* (- 1) c_~y~0) .cse8 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse7 (+ .cse6 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) .cse5)) (= c_~x~0 0))) is different from false [2022-03-03 17:32:43,935 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296))) (.cse2 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse3 (not (< c_~q_back~0 c_~n~0))) (.cse5 (forall ((v_ArrVal_287 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_287) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (and (= c_~y~0 0) (or .cse0 (and .cse1 (= c_~N~0 .cse2)) .cse3 .cse4) (or (and .cse1 .cse5) .cse0 .cse3 .cse4) (or .cse0 .cse3 (and .cse1 (= (+ c_~s~0 .cse2) c_~N~0)) .cse4) (or .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse3 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse8 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse7 (+ .cse8 aux_mod_aux_mod_~C~0_30_61)) (.cse6 (* 4294967295 c_~x~0))) (or (<= (+ .cse6 c_~y~0 4294967296) .cse7) (= (+ (* (- 1) c_~y~0) .cse8 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse7 (+ .cse6 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) .cse5)) (= c_~x~0 0))) is different from false [2022-03-03 17:33:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:33:02,886 INFO L93 Difference]: Finished difference Result 6852 states and 17984 transitions. [2022-03-03 17:33:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2022-03-03 17:33:02,886 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:33:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:33:02,899 INFO L225 Difference]: With dead ends: 6852 [2022-03-03 17:33:02,899 INFO L226 Difference]: Without dead ends: 6612 [2022-03-03 17:33:02,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 224 SyntacticMatches, 33 SemanticMatches, 227 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 20584 ImplicationChecksByTransitivity, 49.9s TimeCoverageRelationStatistics Valid=4251, Invalid=46895, Unknown=164, NotChecked=902, Total=52212 [2022-03-03 17:33:02,905 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 2868 mSDsluCounter, 12593 mSDsCounter, 0 mSdLazyCounter, 3077 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2868 SdHoareTripleChecker+Valid, 12059 SdHoareTripleChecker+Invalid, 8241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 3077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4967 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:33:02,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2868 Valid, 12059 Invalid, 8241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 3077 Invalid, 0 Unknown, 4967 Unchecked, 2.3s Time] [2022-03-03 17:33:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6612 states. [2022-03-03 17:33:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6612 to 3231. [2022-03-03 17:33:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3231 states, 3230 states have (on average 2.678328173374613) internal successors, (8651), 3230 states have internal predecessors, (8651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:33:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 8651 transitions. [2022-03-03 17:33:02,974 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 8651 transitions. Word has length 133 [2022-03-03 17:33:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:33:02,974 INFO L470 AbstractCegarLoop]: Abstraction has 3231 states and 8651 transitions. [2022-03-03 17:33:02,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:33:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 8651 transitions. [2022-03-03 17:33:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:33:02,980 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:33:02,980 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:33:03,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-03 17:33:03,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:33:03,198 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:33:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:33:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash 745801462, now seen corresponding path program 2 times [2022-03-03 17:33:03,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:33:03,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055579748] [2022-03-03 17:33:03,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:33:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:33:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:33:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:33:04,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:33:04,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055579748] [2022-03-03 17:33:04,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055579748] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:33:04,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253454012] [2022-03-03 17:33:04,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:33:04,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:33:04,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:33:04,707 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:33:04,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-03 17:33:04,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:33:04,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:33:04,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-03 17:33:04,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:33:07,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:33:07,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:33:07,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:33:07,475 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:07,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-03-03 17:33:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:33:08,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:33:09,467 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:09,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:33:09,471 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 66 treesize of output 60 [2022-03-03 17:33:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:33:20,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253454012] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:33:20,415 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:33:20,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 36] total 101 [2022-03-03 17:33:20,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447939679] [2022-03-03 17:33:20,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:33:20,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-03-03 17:33:20,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:33:20,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-03-03 17:33:20,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=9267, Unknown=19, NotChecked=0, Total=10100 [2022-03-03 17:33:20,417 INFO L87 Difference]: Start difference. First operand 3231 states and 8651 transitions. Second operand has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:33:52,737 WARN L228 SmtUtils]: Spent 17.53s on a formula simplification. DAG size of input: 137 DAG size of output: 111 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 17:34:02,265 WARN L228 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 134 DAG size of output: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 17:34:03,955 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse1 (= c_~s~0 c_~N~0)) (.cse3 (mod c_~x~0 4294967296)) (.cse2 (mod c_~y~0 4294967296))) (and (or .cse0 (and .cse1 (= .cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)))) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse3) (forall ((v_ArrVal_316 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (< c_~q_back~0 0) (<= c_~n~0 c_~q_back~0)) (or .cse0 (and .cse1 (= .cse3 .cse2))))) is different from false [2022-03-03 17:34:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:34:10,689 INFO L93 Difference]: Finished difference Result 6873 states and 17955 transitions. [2022-03-03 17:34:10,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-03-03 17:34:10,690 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:34:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:34:10,702 INFO L225 Difference]: With dead ends: 6873 [2022-03-03 17:34:10,703 INFO L226 Difference]: Without dead ends: 6741 [2022-03-03 17:34:10,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 227 SyntacticMatches, 36 SemanticMatches, 207 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18112 ImplicationChecksByTransitivity, 58.7s TimeCoverageRelationStatistics Valid=3898, Invalid=39055, Unknown=107, NotChecked=412, Total=43472 [2022-03-03 17:34:10,705 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 2623 mSDsluCounter, 11393 mSDsCounter, 0 mSdLazyCounter, 2764 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2623 SdHoareTripleChecker+Valid, 10975 SdHoareTripleChecker+Invalid, 6580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 2764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3637 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-03 17:34:10,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2623 Valid, 10975 Invalid, 6580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 2764 Invalid, 0 Unknown, 3637 Unchecked, 2.7s Time] [2022-03-03 17:34:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6741 states. [2022-03-03 17:34:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6741 to 3509. [2022-03-03 17:34:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 3508 states have (on average 2.694982896237172) internal successors, (9454), 3508 states have internal predecessors, (9454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:34:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 9454 transitions. [2022-03-03 17:34:10,775 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 9454 transitions. Word has length 133 [2022-03-03 17:34:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:34:10,775 INFO L470 AbstractCegarLoop]: Abstraction has 3509 states and 9454 transitions. [2022-03-03 17:34:10,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:34:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 9454 transitions. [2022-03-03 17:34:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:34:10,781 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:34:10,781 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:34:10,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-03 17:34:11,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:34:11,008 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:34:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:34:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash -555987724, now seen corresponding path program 3 times [2022-03-03 17:34:11,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:34:11,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888390421] [2022-03-03 17:34:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:34:11,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:34:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:34:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:34:12,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:34:12,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888390421] [2022-03-03 17:34:12,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888390421] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:34:12,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267289949] [2022-03-03 17:34:12,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:34:12,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:34:12,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:34:12,491 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:34:12,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-03 17:34:12,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-03 17:34:12,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:34:12,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-03 17:34:12,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:34:14,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:34:14,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:34:14,939 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-03 17:34:14,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-03-03 17:34:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:34:15,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:34:17,132 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:34:17,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:34:17,137 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 66 treesize of output 60 [2022-03-03 17:34:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:34:28,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267289949] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:34:28,439 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:34:28,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-03 17:34:28,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049277804] [2022-03-03 17:34:28,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:34:28,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-03 17:34:28,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:34:28,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-03 17:34:28,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=771, Invalid=9719, Unknown=16, NotChecked=0, Total=10506 [2022-03-03 17:34:28,441 INFO L87 Difference]: Start difference. First operand 3509 states and 9454 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:34:55,079 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (<= c_~x~0 c_~C~0)) (.cse0 (<= c_~y~0 c_~x~0)) (.cse1 (<= c_~s~0 c_~N~0)) (.cse2 (<= c_~x~0 c_~y~0)) (.cse6 (<= c_~C~0 c_~x~0)) (.cse8 (= c_~s~0 c_~N~0)) (.cse9 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse7 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse10 (mod (+ c_~C~0 c_~y~0) 4294967296)) (.cse12 (not (<= 0 c_~q_back~0))) (.cse13 (not (< c_~q_back~0 c_~n~0)))) (and (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or (and (<= c_~N~0 c_~s~0) .cse0 .cse1 .cse2) .cse3) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4) .cse5 .cse6)) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (<= 1 c_~N~0) .cse5 (or .cse3 (and .cse0 .cse1 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0) .cse2)) .cse6 (or .cse7 (and .cse8 (= (mod c_~y~0 4294967296) .cse9))) (or (and .cse8 (= .cse10 .cse9)) .cse7) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse3) (or .cse3 (let ((.cse11 (+ (* c_~q_front~0 4) c_~q~0.offset))) (and (<= .cse11 0) (<= 0 c_~q_front~0) (= (select (select |c_#memory_int| c_~q~0.base) .cse11) 1)))) (= c_~q~0.offset 0) (or .cse12 .cse13 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (= .cse10 (mod c_~x~0 4294967296))) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (or .cse12 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse13 (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse16 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse15 (+ .cse16 aux_mod_aux_mod_~C~0_30_61)) (.cse14 (* 4294967295 c_~x~0))) (or (<= (+ .cse14 c_~y~0 4294967296) .cse15) (= (+ (* (- 1) c_~y~0) .cse16 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse15 (+ .cse14 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))))) is different from false [2022-03-03 17:34:59,012 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (mod (+ c_~C~0 c_~y~0) 4294967296)) (.cse10 (mod c_~x~0 4294967296))) (let ((.cse8 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse5 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse6 (= c_~s~0 c_~N~0)) (.cse7 (mod c_~y~0 4294967296)) (.cse2 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (= .cse9 .cse10)) (.cse3 (not (< c_~q_back~0 c_~n~0))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or .cse0 (and .cse1 (= c_~N~0 .cse2)) .cse3 .cse4) (= c_~s~0 1) (= (+ c_~x~0 (* (- 1) c_~C~0)) 0) (or .cse5 (and .cse6 (= .cse7 .cse8))) (or (and .cse6 (= .cse9 .cse8)) .cse5) (or .cse0 .cse3 (and .cse6 (= .cse10 .cse7))) (< 0 c_~N~0) (< 0 c_~n~0) (or .cse0 .cse3 (and .cse1 (= (+ c_~s~0 .cse2) c_~N~0)) .cse4) (or .cse0 .cse3 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse1) .cse4) (<= 1 c_~q_back~0) (or .cse0 (and .cse1 (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) .cse3 .cse4) (<= c_~n~0 2)))) is different from false [2022-03-03 17:35:06,972 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~x~0 4294967296))) (let ((.cse3 (= c_~s~0 c_~N~0)) (.cse6 (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1)) (.cse7 (<= 1 c_~N~0)) (.cse8 (<= c_~x~0 c_~C~0)) (.cse9 (<= c_~C~0 c_~x~0)) (.cse10 (= |c_thread2Thread1of1ForFork1_~j~0#1| 1)) (.cse11 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse5 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse4)) (.cse1 (not (< c_~q_back~0 c_~n~0))) (.cse2 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (or .cse0 .cse1 .cse2 (and .cse3 (= .cse4 (mod c_~y~0 4294967296)))) (= c_~y~0 0) (or .cse0 (and .cse5 .cse3) .cse1 .cse2) (or (and .cse6 .cse7 .cse8 .cse9) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) .cse6 .cse10 .cse7 .cse8 (= (+ c_~x~0 (* (- 1) c_~C~0)) 0) .cse9 (= c_~s~0 0) (or .cse10 .cse11) (or .cse11 (let ((.cse12 (+ (* c_~q_front~0 4) c_~q~0.offset))) (and (<= .cse12 0) (<= 0 c_~q_front~0) (= (select (select |c_#memory_int| c_~q~0.base) .cse12) 1)))) (< 0 c_~N~0) (< 0 c_~n~0) (= c_~q~0.offset 0) (<= 1 c_~q_back~0) (or .cse0 (and .cse5 (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) .cse1 .cse2) (<= c_~n~0 2)))) is different from false [2022-03-03 17:35:20,166 WARN L228 SmtUtils]: Spent 8.71s on a formula simplification. DAG size of input: 107 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 17:35:20,881 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~y~0 c_~x~0)) (.cse6 (<= c_~s~0 c_~N~0)) (.cse7 (* (- 1) c_~C~0)) (.cse5 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (not (<= 0 c_~q_back~0))) (.cse2 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296))) (.cse3 (not (< c_~q_back~0 c_~n~0))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse8 (<= c_~x~0 c_~y~0))) (and (<= c_~N~0 c_~s~0) .cse0 (or .cse1 (and .cse2 (= c_~s~0 c_~N~0)) .cse3 .cse4) (or .cse1 (and .cse2 (= c_~N~0 .cse5)) .cse3 .cse4) (= c_~s~0 1) .cse6 (= (+ c_~x~0 .cse7) 0) (<= c_~N~0 1) (or (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0))) (and .cse0 .cse6 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0) .cse8)) (= (+ c_~y~0 .cse7) 0) (< 0 c_~N~0) (< 0 c_~n~0) (or .cse1 .cse3 (and .cse2 (= (+ c_~s~0 .cse5) c_~N~0)) .cse4) (= c_~q~0.offset 0) (or .cse1 .cse3 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse2) .cse4) (<= 1 c_~q_back~0) (or .cse1 (and .cse2 (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) .cse3 .cse4) (<= c_~n~0 2) .cse8)) is different from false [2022-03-03 17:35:21,076 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~y~0 c_~x~0)) (.cse7 (<= c_~s~0 c_~N~0)) (.cse3 (= c_~s~0 c_~N~0)) (.cse8 (* (- 1) c_~C~0)) (.cse6 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (not (<= 0 c_~q_back~0))) (.cse2 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296))) (.cse4 (not (< c_~q_back~0 c_~n~0))) (.cse5 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse9 (<= c_~x~0 c_~y~0))) (and (<= c_~N~0 c_~s~0) .cse0 (or .cse1 (and .cse2 .cse3) .cse4 .cse5) (or .cse1 (and .cse2 (= c_~N~0 .cse6)) .cse4 .cse5) (= c_~s~0 1) .cse7 (= (+ c_~x~0 .cse8) 0) (<= c_~N~0 1) (or (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0))) (and .cse0 .cse7 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0) .cse9)) (or (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)) (and .cse3 (= (mod c_~y~0 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296)))) (= (+ c_~y~0 .cse8) 0) (< 0 c_~N~0) (< 0 c_~n~0) (or .cse1 .cse4 (and .cse2 (= (+ c_~s~0 .cse6) c_~N~0)) .cse5) (= c_~q~0.offset 0) (or .cse1 .cse4 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse2) .cse5) (<= 1 c_~q_back~0) (or .cse1 (and .cse2 (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) .cse4 .cse5) (<= c_~n~0 2) .cse9)) is different from false [2022-03-03 17:35:26,821 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (mod (+ c_~C~0 c_~y~0) 4294967296))) (and (or .cse0 (and .cse1 (= (mod c_~y~0 4294967296) .cse2))) (or (and .cse1 (= .cse3 .cse2)) .cse0) (or (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (= .cse3 (mod c_~x~0 4294967296)) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (not (< c_~q_back~0 c_~n~0))))) is different from false [2022-03-03 17:35:38,210 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (mod (+ c_~C~0 c_~y~0) 4294967296))) (and (or .cse0 (and .cse1 (= (mod c_~y~0 4294967296) .cse2))) (or (and .cse1 (= .cse3 .cse2)) .cse0) (or (not (<= 0 c_~q_back~0)) (and (= .cse3 (mod c_~x~0 4294967296)) (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (not (< c_~q_back~0 c_~n~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)))) is different from false [2022-03-03 17:35:39,884 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~y~0 c_~x~0)) (.cse6 (<= c_~s~0 c_~N~0)) (.cse5 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (not (<= 0 c_~q_back~0))) (.cse2 (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296))) (.cse3 (not (< c_~q_back~0 c_~n~0))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse7 (<= c_~x~0 c_~y~0))) (and (<= c_~N~0 c_~s~0) .cse0 (or .cse1 (and .cse2 (= c_~s~0 c_~N~0)) .cse3 .cse4) (or .cse1 (and .cse2 (= c_~N~0 .cse5)) .cse3 .cse4) (= c_~s~0 1) .cse6 (= c_~C~0 c_~x~0) (<= c_~N~0 1) (or (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0))) (and .cse0 .cse6 (<= |c_thread1Thread1of1ForFork0_~i~0#1| c_~s~0) .cse7)) (< 0 c_~N~0) (or .cse1 .cse3 (and .cse2 (= (+ c_~s~0 .cse5) c_~N~0)) .cse4) (= c_~q~0.offset 0) (or .cse1 .cse3 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse2) .cse4) (= c_~C~0 c_~y~0) (or .cse1 (and .cse2 (forall ((v_ArrVal_345 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) .cse3 .cse4) .cse7)) is different from false [2022-03-03 17:35:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:35:48,755 INFO L93 Difference]: Finished difference Result 7792 states and 20353 transitions. [2022-03-03 17:35:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2022-03-03 17:35:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:35:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:35:48,769 INFO L225 Difference]: With dead ends: 7792 [2022-03-03 17:35:48,770 INFO L226 Difference]: Without dead ends: 7531 [2022-03-03 17:35:48,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 227 SyntacticMatches, 70 SemanticMatches, 290 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 38139 ImplicationChecksByTransitivity, 87.8s TimeCoverageRelationStatistics Valid=5977, Invalid=74295, Unknown=132, NotChecked=4568, Total=84972 [2022-03-03 17:35:48,774 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 2203 mSDsluCounter, 13163 mSDsCounter, 0 mSdLazyCounter, 3495 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2203 SdHoareTripleChecker+Valid, 12888 SdHoareTripleChecker+Invalid, 7011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 3495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3268 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:35:48,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2203 Valid, 12888 Invalid, 7011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 3495 Invalid, 0 Unknown, 3268 Unchecked, 3.6s Time] [2022-03-03 17:35:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7531 states. [2022-03-03 17:35:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7531 to 3971. [2022-03-03 17:35:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3970 states have (on average 2.695969773299748) internal successors, (10703), 3970 states have internal predecessors, (10703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:35:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 10703 transitions. [2022-03-03 17:35:48,894 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 10703 transitions. Word has length 133 [2022-03-03 17:35:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:35:48,894 INFO L470 AbstractCegarLoop]: Abstraction has 3971 states and 10703 transitions. [2022-03-03 17:35:48,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:35:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 10703 transitions. [2022-03-03 17:35:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:35:48,902 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:35:48,902 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:35:48,943 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-03-03 17:35:49,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:35:49,116 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:35:49,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:35:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash 887071450, now seen corresponding path program 4 times [2022-03-03 17:35:49,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:35:49,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773277215] [2022-03-03 17:35:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:35:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:35:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:35:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:35:50,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:35:50,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773277215] [2022-03-03 17:35:50,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773277215] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:35:50,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759042491] [2022-03-03 17:35:50,716 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:35:50,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:35:50,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:35:50,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:35:50,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-03 17:35:50,850 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:35:50,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:35:50,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-03 17:35:50,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:35:52,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:35:52,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:35:53,187 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-03 17:35:53,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-03-03 17:35:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:35:53,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:35:54,872 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:35:54,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:35:54,877 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 66 treesize of output 60 [2022-03-03 17:36:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:36:05,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759042491] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:36:05,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:36:05,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-03 17:36:05,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26880879] [2022-03-03 17:36:05,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:36:05,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-03 17:36:05,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:36:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-03 17:36:05,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=9717, Unknown=17, NotChecked=0, Total=10506 [2022-03-03 17:36:05,617 INFO L87 Difference]: Start difference. First operand 3971 states and 10703 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:36:21,213 WARN L228 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 108 DAG size of output: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 17:36:43,141 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (= c_~C~0 c_~x~0) (= c_~s~0 0) (or (and (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse2 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse1 (+ .cse2 aux_mod_aux_mod_~C~0_30_61)) (.cse0 (* 4294967295 c_~x~0))) (or (<= (+ .cse0 c_~y~0 4294967296) .cse1) (= (+ (* (- 1) c_~y~0) .cse2 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse1 (+ .cse0 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61)))))) (not (<= 0 c_~q_back~0)) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (not (< c_~q_back~0 c_~n~0))) (< 0 c_~N~0) (< 0 c_~n~0) (<= 1 c_~q_back~0) (<= c_~n~0 2)) is different from false [2022-03-03 17:36:54,144 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* c_~q_front~0 4) c_~q~0.offset)) (.cse13 (= c_~s~0 c_~N~0)) (.cse14 (mod c_~x~0 4294967296))) (let ((.cse4 (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (.cse3 (and .cse13 (= .cse14 (mod c_~y~0 4294967296)))) (.cse6 (select (select |c_#memory_int| c_~q~0.base) .cse5)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (not (< c_~q_back~0 c_~n~0))) (.cse2 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse12 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse14)) (.cse11 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (and (= .cse5 0) (= .cse6 1))) (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or (let ((.cse7 (+ c_~s~0 1))) (and (<= .cse7 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse7))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (= c_~s~0 1) (= c_~C~0 c_~x~0) (<= 1 c_~N~0) (<= c_~x~0 c_~C~0) (<= c_~C~0 c_~x~0) (or (and (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse10 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse9 (+ .cse10 aux_mod_aux_mod_~C~0_30_61)) (.cse8 (* 4294967295 c_~x~0))) (or (<= (+ .cse8 c_~y~0 4294967296) .cse9) (= (+ (* (- 1) c_~y~0) .cse10 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse9 (+ .cse8 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61)))))) .cse0 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse1) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) .cse4) (or .cse11 .cse3) (< 0 c_~N~0) (< 0 c_~n~0) (or .cse0 .cse1 (and .cse12 (= (+ c_~s~0 .cse6) c_~N~0)) .cse2) (= c_~q~0.offset 0) (or .cse0 .cse1 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse12) .cse2) (<= 1 c_~q_back~0) (or (and .cse12 .cse13) .cse11) (<= c_~n~0 2)))) is different from false [2022-03-03 17:36:54,382 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (= c_~s~0 c_~N~0)) (.cse9 (mod c_~x~0 4294967296))) (let ((.cse3 (and .cse8 (= .cse9 (mod c_~y~0 4294967296)))) (.cse6 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse7 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (not (< c_~q_back~0 c_~n~0))) (.cse2 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse5 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse9))) (and (or .cse0 .cse1 .cse2 .cse3) (= c_~y~0 0) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or .cse0 (and .cse5 (= c_~N~0 .cse6)) .cse1 .cse2) (= c_~s~0 1) (= c_~C~0 c_~x~0) (<= c_~x~0 c_~C~0) (<= c_~C~0 c_~x~0) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (or .cse7 .cse3) (< 0 c_~N~0) (< 0 c_~n~0) (or .cse0 .cse1 (and .cse5 (= (+ c_~s~0 .cse6) c_~N~0)) .cse2) (= c_~q~0.offset 0) (or .cse0 .cse1 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse5) .cse2) (<= 1 c_~q_back~0) (or (and .cse5 .cse8) .cse7) (<= c_~n~0 2) (or .cse0 .cse1 .cse2 (and .cse5 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))))))) is different from false [2022-03-03 17:36:55,168 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~x~0 4294967296))) (let ((.cse3 (= c_~s~0 c_~N~0)) (.cse8 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (.cse7 (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0)) (.cse0 (not (<= 0 c_~q_back~0))) (.cse1 (not (< c_~q_back~0 c_~n~0))) (.cse5 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse4)) (.cse6 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse2 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (or .cse0 .cse1 .cse2 (and .cse3 (= .cse4 (mod c_~y~0 4294967296)))) (= c_~y~0 0) (or .cse0 (and .cse5 .cse3) .cse1 .cse2) (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (or .cse0 (and .cse5 (= c_~N~0 .cse6)) .cse1 .cse2) (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (= c_~C~0 c_~x~0) (or .cse0 .cse7 .cse1 (and .cse5 .cse8)) (= c_~s~0 0) (or (and .cse8 (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse11 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse10 (+ .cse11 aux_mod_aux_mod_~C~0_30_61)) (.cse9 (* 4294967295 c_~x~0))) (or (<= (+ .cse9 c_~y~0 4294967296) .cse10) (= (+ (* (- 1) c_~y~0) .cse11 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse10 (+ .cse9 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61)))))) .cse0 .cse7 .cse1) (< 0 c_~N~0) (< 0 c_~n~0) (or .cse0 .cse1 (and .cse5 (= (+ c_~s~0 .cse6) c_~N~0)) .cse2) (<= 1 c_~q_back~0) (<= c_~n~0 2)))) is different from false [2022-03-03 17:37:02,190 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (mod c_~x~0 4294967296))) (let ((.cse5 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse9)) (.cse8 (= c_~s~0 c_~N~0))) (let ((.cse6 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse1 (and .cse5 .cse8)) (.cse7 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse0 (not (<= 0 c_~q_back~0))) (.cse2 (not (< c_~q_back~0 c_~n~0))) (.cse3 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) (and (<= c_~y~0 c_~x~0) (or .cse0 .cse1 .cse2 .cse3) (or (let ((.cse4 (+ c_~s~0 1))) (and (<= .cse4 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse4))) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or .cse0 (and .cse5 (= c_~N~0 .cse6)) .cse2 .cse3) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (or .cse7 (and .cse8 (= .cse9 (mod c_~y~0 4294967296)))) (or .cse0 .cse2 (and .cse5 (= (+ c_~s~0 .cse6) c_~N~0)) .cse3) (= c_~q~0.offset 0) (or .cse0 .cse2 (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse5) .cse3) (or .cse1 .cse7) (or .cse0 .cse2 .cse3 (and .cse5 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) (<= c_~x~0 c_~y~0))))) is different from false [2022-03-03 17:37:27,355 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x~0 4294967296))) (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse2))) (and (or .cse0 (and .cse1 (= .cse2 (mod c_~y~0 4294967296)))) (or (and .cse3 .cse1) .cse0) (or (not (<= 0 c_~q_back~0)) (not (< c_~q_back~0 c_~n~0)) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (and .cse3 (forall ((v_ArrVal_374 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_374) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))))))) is different from false [2022-03-03 17:37:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:37:37,700 INFO L93 Difference]: Finished difference Result 8446 states and 22184 transitions. [2022-03-03 17:37:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2022-03-03 17:37:37,700 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:37:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:37:37,711 INFO L225 Difference]: With dead ends: 8446 [2022-03-03 17:37:37,711 INFO L226 Difference]: Without dead ends: 7760 [2022-03-03 17:37:37,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 235 SyntacticMatches, 27 SemanticMatches, 240 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 21546 ImplicationChecksByTransitivity, 100.6s TimeCoverageRelationStatistics Valid=4774, Invalid=50570, Unknown=140, NotChecked=2838, Total=58322 [2022-03-03 17:37:37,714 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 3355 mSDsluCounter, 14118 mSDsCounter, 0 mSdLazyCounter, 3332 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3355 SdHoareTripleChecker+Valid, 13216 SdHoareTripleChecker+Invalid, 11175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 3332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7647 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:37:37,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3355 Valid, 13216 Invalid, 11175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 3332 Invalid, 0 Unknown, 7647 Unchecked, 2.3s Time] [2022-03-03 17:37:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7760 states. [2022-03-03 17:37:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7760 to 4060. [2022-03-03 17:37:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 4059 states have (on average 2.6762749445676275) internal successors, (10863), 4059 states have internal predecessors, (10863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 10863 transitions. [2022-03-03 17:37:37,787 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 10863 transitions. Word has length 133 [2022-03-03 17:37:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:37:37,787 INFO L470 AbstractCegarLoop]: Abstraction has 4060 states and 10863 transitions. [2022-03-03 17:37:37,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 10863 transitions. [2022-03-03 17:37:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:37:37,793 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:37:37,793 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:37:37,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-03 17:37:37,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:37:37,998 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:37:37,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:37:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash -340847820, now seen corresponding path program 5 times [2022-03-03 17:37:37,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:37:37,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682818209] [2022-03-03 17:37:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:37,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:37:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:37:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:37:39,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:37:39,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682818209] [2022-03-03 17:37:39,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682818209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:37:39,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267853114] [2022-03-03 17:37:39,589 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:37:39,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:37:39,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:37:39,590 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:37:39,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-03 17:37:39,699 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-03 17:37:39,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:37:39,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-03 17:37:39,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:37:39,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:37:40,040 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:37:40,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-03 17:37:40,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:37:41,136 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 25 treesize of output 7 [2022-03-03 17:37:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:37:41,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:37:42,908 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:37:42,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 82 [2022-03-03 17:37:42,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-03-03 17:37:44,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-03 17:37:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:37:44,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267853114] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:37:44,646 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:37:44,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 32, 29] total 90 [2022-03-03 17:37:44,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520423942] [2022-03-03 17:37:44,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:37:44,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-03-03 17:37:44,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:37:44,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-03-03 17:37:44,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=7523, Unknown=15, NotChecked=0, Total=8010 [2022-03-03 17:37:44,648 INFO L87 Difference]: Start difference. First operand 4060 states and 10863 transitions. Second operand has 90 states, 90 states have (on average 3.7111111111111112) internal successors, (334), 90 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:55,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:37:55,440 INFO L93 Difference]: Finished difference Result 7416 states and 19734 transitions. [2022-03-03 17:37:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-03 17:37:55,440 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 3.7111111111111112) internal successors, (334), 90 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:37:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:37:55,450 INFO L225 Difference]: With dead ends: 7416 [2022-03-03 17:37:55,451 INFO L226 Difference]: Without dead ends: 7167 [2022-03-03 17:37:55,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 217 SyntacticMatches, 12 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10077 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=2261, Invalid=28167, Unknown=22, NotChecked=0, Total=30450 [2022-03-03 17:37:55,452 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 2478 mSDsluCounter, 6990 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2478 SdHoareTripleChecker+Valid, 6751 SdHoareTripleChecker+Invalid, 5946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1331 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:37:55,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2478 Valid, 6751 Invalid, 5946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 4265 Invalid, 0 Unknown, 1331 Unchecked, 3.3s Time] [2022-03-03 17:37:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7167 states. [2022-03-03 17:37:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7167 to 3714. [2022-03-03 17:37:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3713 states have (on average 2.7018583355777) internal successors, (10032), 3713 states have internal predecessors, (10032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 10032 transitions. [2022-03-03 17:37:55,534 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 10032 transitions. Word has length 133 [2022-03-03 17:37:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:37:55,534 INFO L470 AbstractCegarLoop]: Abstraction has 3714 states and 10032 transitions. [2022-03-03 17:37:55,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 3.7111111111111112) internal successors, (334), 90 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:37:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 10032 transitions. [2022-03-03 17:37:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:37:55,539 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:37:55,539 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:37:55,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-03 17:37:55,755 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,SelfDestructingSolverStorable22 [2022-03-03 17:37:55,756 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:37:55,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:37:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2007663518, now seen corresponding path program 6 times [2022-03-03 17:37:55,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:37:55,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935357828] [2022-03-03 17:37:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:37:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:37:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:37:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:37:57,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:37:57,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935357828] [2022-03-03 17:37:57,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935357828] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:37:57,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807109168] [2022-03-03 17:37:57,250 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:37:57,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:37:57,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:37:57,251 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:37:57,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-03 17:37:57,384 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 17:37:57,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:37:57,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-03 17:37:57,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:37:59,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:37:59,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:37:59,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:37:59,410 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:37:59,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-03-03 17:38:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:38:00,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:38:01,360 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:38:01,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:38:01,364 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 66 treesize of output 60 [2022-03-03 17:38:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:38:10,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807109168] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:38:10,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:38:10,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 103 [2022-03-03 17:38:10,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345384746] [2022-03-03 17:38:10,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:38:10,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-03-03 17:38:10,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:38:10,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-03-03 17:38:10,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=805, Invalid=9688, Unknown=13, NotChecked=0, Total=10506 [2022-03-03 17:38:10,313 INFO L87 Difference]: Start difference. First operand 3714 states and 10032 transitions. Second operand has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:38:16,106 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_~x~0 4294967296))) (let ((.cse0 (= c_~y~0 0)) (.cse2 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse7 (= c_~s~0 c_~N~0)) (.cse6 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse3 (< c_~q_back~0 0)) (.cse4 (<= c_~n~0 c_~q_back~0)) (.cse5 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse1 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse8))) (and .cse0 (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (= c_~s~0 1) (or (and .cse1 (= c_~N~0 .cse2)) .cse3 .cse4 .cse5) (= c_~C~0 c_~x~0) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (or .cse6 (and .cse7 (= .cse8 (mod c_~y~0 4294967296)))) (or (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0)) (let ((.cse9 (+ c_~s~0 1))) (and (<= .cse9 (+ c_~N~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse0 (<= (+ |c_thread2Thread1of1ForFork1_~j~0#1| |c_thread1Thread1of1ForFork0_~i~0#1|) .cse9) (<= c_~x~0 c_~C~0) (<= c_~C~0 c_~x~0)))) (< 0 c_~N~0) (< 0 c_~n~0) (= c_~q~0.offset 0) (or (not (<= 0 c_~q_back~0)) (not (< c_~q_back~0 c_~n~0)) (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) .cse1) .cse5) (or .cse3 (and .cse1 (= (+ c_~s~0 .cse2) c_~N~0)) .cse4 .cse5) (<= 1 c_~q_back~0) (or (and .cse1 .cse7) .cse6) (or .cse3 .cse4 .cse5 (and .cse1 (forall ((v_ArrVal_433 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_433) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))) (<= c_~n~0 2)))) is different from false [2022-03-03 17:38:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:38:25,703 INFO L93 Difference]: Finished difference Result 6013 states and 15961 transitions. [2022-03-03 17:38:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-03 17:38:25,704 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:38:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:38:25,711 INFO L225 Difference]: With dead ends: 6013 [2022-03-03 17:38:25,711 INFO L226 Difference]: Without dead ends: 5557 [2022-03-03 17:38:25,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 213 SyntacticMatches, 21 SemanticMatches, 185 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 13185 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=2551, Invalid=31756, Unknown=107, NotChecked=368, Total=34782 [2022-03-03 17:38:25,713 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 2294 mSDsluCounter, 9111 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 8815 SdHoareTripleChecker+Invalid, 4292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2040 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:38:25,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2294 Valid, 8815 Invalid, 4292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2116 Invalid, 0 Unknown, 2040 Unchecked, 1.4s Time] [2022-03-03 17:38:25,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2022-03-03 17:38:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 3861. [2022-03-03 17:38:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3861 states, 3860 states have (on average 2.7015544041450776) internal successors, (10428), 3860 states have internal predecessors, (10428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:38:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3861 states to 3861 states and 10428 transitions. [2022-03-03 17:38:25,766 INFO L78 Accepts]: Start accepts. Automaton has 3861 states and 10428 transitions. Word has length 133 [2022-03-03 17:38:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:38:25,766 INFO L470 AbstractCegarLoop]: Abstraction has 3861 states and 10428 transitions. [2022-03-03 17:38:25,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.29126213592233) internal successors, (339), 103 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:38:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3861 states and 10428 transitions. [2022-03-03 17:38:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:38:25,772 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:38:25,772 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:38:25,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-03 17:38:25,988 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,SelfDestructingSolverStorable23 [2022-03-03 17:38:25,988 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:38:25,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:38:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash -725027718, now seen corresponding path program 7 times [2022-03-03 17:38:25,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:38:25,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750699739] [2022-03-03 17:38:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:38:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:38:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:38:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:38:27,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:38:27,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750699739] [2022-03-03 17:38:27,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750699739] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:38:27,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640986573] [2022-03-03 17:38:27,718 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 17:38:27,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:38:27,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:38:27,719 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:38:27,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-03 17:38:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:38:27,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-03 17:38:27,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:38:29,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:38:29,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:38:30,026 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-03 17:38:30,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-03-03 17:38:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:38:30,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:38:31,794 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:38:31,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:38:31,796 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 66 treesize of output 60 [2022-03-03 17:38:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:38:40,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640986573] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:38:40,800 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:38:40,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 36] total 102 [2022-03-03 17:38:40,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712475735] [2022-03-03 17:38:40,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:38:40,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-03-03 17:38:40,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:38:40,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-03-03 17:38:40,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=767, Invalid=9521, Unknown=14, NotChecked=0, Total=10302 [2022-03-03 17:38:40,801 INFO L87 Difference]: Start difference. First operand 3861 states and 10428 transitions. Second operand has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:38:56,814 WARN L228 SmtUtils]: Spent 6.67s on a formula simplification. DAG size of input: 121 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 17:39:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:39:20,865 INFO L93 Difference]: Finished difference Result 7186 states and 18841 transitions. [2022-03-03 17:39:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-03-03 17:39:20,865 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:39:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:39:20,876 INFO L225 Difference]: With dead ends: 7186 [2022-03-03 17:39:20,876 INFO L226 Difference]: Without dead ends: 7084 [2022-03-03 17:39:20,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 221 SyntacticMatches, 15 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13961 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=3304, Invalid=37226, Unknown=72, NotChecked=0, Total=40602 [2022-03-03 17:39:20,879 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 2353 mSDsluCounter, 8823 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2353 SdHoareTripleChecker+Valid, 8578 SdHoareTripleChecker+Invalid, 4354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1858 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 17:39:20,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2353 Valid, 8578 Invalid, 4354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2344 Invalid, 0 Unknown, 1858 Unchecked, 1.7s Time] [2022-03-03 17:39:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7084 states. [2022-03-03 17:39:20,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7084 to 3979. [2022-03-03 17:39:20,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3979 states, 3978 states have (on average 2.6902966314731023) internal successors, (10702), 3978 states have internal predecessors, (10702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:39:20,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 10702 transitions. [2022-03-03 17:39:20,973 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 10702 transitions. Word has length 133 [2022-03-03 17:39:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:39:20,974 INFO L470 AbstractCegarLoop]: Abstraction has 3979 states and 10702 transitions. [2022-03-03 17:39:20,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:39:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 10702 transitions. [2022-03-03 17:39:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:39:20,979 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:39:20,980 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:39:21,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-03 17:39:21,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-03 17:39:21,199 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:39:21,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:39:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1132991770, now seen corresponding path program 8 times [2022-03-03 17:39:21,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:39:21,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753029531] [2022-03-03 17:39:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:39:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:39:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:39:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:39:22,837 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:39:22,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753029531] [2022-03-03 17:39:22,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753029531] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:39:22,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3593117] [2022-03-03 17:39:22,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:39:22,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:39:22,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:39:22,839 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:39:22,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-03 17:39:22,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:39:22,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:39:22,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-03 17:39:22,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:39:24,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:39:24,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:39:25,347 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-03 17:39:25,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2022-03-03 17:39:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:39:26,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:39:27,419 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:39:27,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:39:27,423 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 66 treesize of output 60 [2022-03-03 17:39:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:39:37,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3593117] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:39:37,873 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:39:37,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 36] total 101 [2022-03-03 17:39:37,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353456258] [2022-03-03 17:39:37,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:39:37,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-03-03 17:39:37,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:39:37,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-03-03 17:39:37,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=9331, Unknown=11, NotChecked=0, Total=10100 [2022-03-03 17:39:37,875 INFO L87 Difference]: Start difference. First operand 3979 states and 10702 transitions. Second operand has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:39:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:39:58,472 INFO L93 Difference]: Finished difference Result 7745 states and 20329 transitions. [2022-03-03 17:39:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-03-03 17:39:58,472 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:39:58,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:39:58,482 INFO L225 Difference]: With dead ends: 7745 [2022-03-03 17:39:58,482 INFO L226 Difference]: Without dead ends: 7613 [2022-03-03 17:39:58,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 222 SyntacticMatches, 25 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14857 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=3469, Invalid=36260, Unknown=71, NotChecked=0, Total=39800 [2022-03-03 17:39:58,485 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 3259 mSDsluCounter, 10096 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3259 SdHoareTripleChecker+Valid, 9468 SdHoareTripleChecker+Invalid, 5955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3429 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:39:58,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3259 Valid, 9468 Invalid, 5955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2324 Invalid, 0 Unknown, 3429 Unchecked, 1.4s Time] [2022-03-03 17:39:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7613 states. [2022-03-03 17:39:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7613 to 3942. [2022-03-03 17:39:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3941 states have (on average 2.6962699822380105) internal successors, (10626), 3941 states have internal predecessors, (10626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:39:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 10626 transitions. [2022-03-03 17:39:58,557 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 10626 transitions. Word has length 133 [2022-03-03 17:39:58,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:39:58,557 INFO L470 AbstractCegarLoop]: Abstraction has 3942 states and 10626 transitions. [2022-03-03 17:39:58,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.3564356435643563) internal successors, (339), 101 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:39:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 10626 transitions. [2022-03-03 17:39:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:39:58,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:39:58,563 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:39:58,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-03 17:39:58,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-03 17:39:58,779 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:39:58,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:39:58,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2026816904, now seen corresponding path program 9 times [2022-03-03 17:39:58,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:39:58,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880763384] [2022-03-03 17:39:58,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:39:58,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:39:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:40:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:40:00,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:40:00,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880763384] [2022-03-03 17:40:00,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880763384] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:40:00,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202228343] [2022-03-03 17:40:00,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:40:00,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:40:00,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:40:00,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:40:00,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-03 17:40:00,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:40:00,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:40:00,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-03 17:40:00,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:40:01,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:40:01,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:40:02,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-03 17:40:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:40:02,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:40:04,220 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:40:04,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 108 [2022-03-03 17:40:04,224 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 80 treesize of output 68 [2022-03-03 17:40:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:40:05,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202228343] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:40:05,649 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:40:05,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30, 29] total 91 [2022-03-03 17:40:05,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848196854] [2022-03-03 17:40:05,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:40:05,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-03 17:40:05,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:40:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-03 17:40:05,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=7710, Unknown=14, NotChecked=0, Total=8190 [2022-03-03 17:40:05,651 INFO L87 Difference]: Start difference. First operand 3942 states and 10626 transitions. Second operand has 91 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:22,270 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-03 17:40:24,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-03 17:40:28,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-03 17:40:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:40:30,780 INFO L93 Difference]: Finished difference Result 6844 states and 18384 transitions. [2022-03-03 17:40:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-03-03 17:40:30,780 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:40:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:40:30,789 INFO L225 Difference]: With dead ends: 6844 [2022-03-03 17:40:30,790 INFO L226 Difference]: Without dead ends: 6641 [2022-03-03 17:40:30,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 225 SyntacticMatches, 6 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10809 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=2266, Invalid=30653, Unknown=23, NotChecked=0, Total=32942 [2022-03-03 17:40:30,791 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 2334 mSDsluCounter, 9334 mSDsCounter, 0 mSdLazyCounter, 7441 mSolverCounterSat, 327 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 8912 SdHoareTripleChecker+Invalid, 8484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 7441 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 713 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-03-03 17:40:30,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2334 Valid, 8912 Invalid, 8484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 7441 Invalid, 3 Unknown, 713 Unchecked, 11.8s Time] [2022-03-03 17:40:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6641 states. [2022-03-03 17:40:30,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6641 to 3876. [2022-03-03 17:40:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 3875 states have (on average 2.711225806451613) internal successors, (10506), 3875 states have internal predecessors, (10506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 10506 transitions. [2022-03-03 17:40:30,849 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 10506 transitions. Word has length 133 [2022-03-03 17:40:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:40:30,849 INFO L470 AbstractCegarLoop]: Abstraction has 3876 states and 10506 transitions. [2022-03-03 17:40:30,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 10506 transitions. [2022-03-03 17:40:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:40:30,855 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:40:30,855 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:40:30,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-03 17:40:31,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-03 17:40:31,071 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:40:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:40:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash 305725790, now seen corresponding path program 10 times [2022-03-03 17:40:31,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:40:31,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523910251] [2022-03-03 17:40:31,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:40:31,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:40:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:40:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:40:32,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:40:32,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523910251] [2022-03-03 17:40:32,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523910251] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:40:32,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865521702] [2022-03-03 17:40:32,912 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:40:32,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:40:32,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:40:32,917 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:40:32,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-03 17:40:33,115 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:40:33,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:40:33,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-03 17:40:33,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:40:35,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:40:35,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:40:35,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-03 17:40:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:40:36,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:40:37,581 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:40:37,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:40:37,585 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 66 treesize of output 60 [2022-03-03 17:40:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:40:48,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865521702] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:40:48,895 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:40:48,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38, 37] total 107 [2022-03-03 17:40:48,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165588906] [2022-03-03 17:40:48,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:40:48,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-03-03 17:40:48,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:40:48,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-03-03 17:40:48,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=10572, Unknown=12, NotChecked=0, Total=11342 [2022-03-03 17:40:48,896 INFO L87 Difference]: Start difference. First operand 3876 states and 10506 transitions. Second operand has 107 states, 107 states have (on average 3.308411214953271) internal successors, (354), 107 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:40:59,516 WARN L228 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 85 DAG size of output: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 17:41:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:41:20,316 INFO L93 Difference]: Finished difference Result 7695 states and 20633 transitions. [2022-03-03 17:41:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-03-03 17:41:20,317 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 3.308411214953271) internal successors, (354), 107 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:41:20,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:41:20,328 INFO L225 Difference]: With dead ends: 7695 [2022-03-03 17:41:20,329 INFO L226 Difference]: Without dead ends: 7137 [2022-03-03 17:41:20,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 219 SyntacticMatches, 14 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15957 ImplicationChecksByTransitivity, 40.4s TimeCoverageRelationStatistics Valid=3092, Invalid=40704, Unknown=94, NotChecked=0, Total=43890 [2022-03-03 17:41:20,331 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 2347 mSDsluCounter, 11401 mSDsCounter, 0 mSdLazyCounter, 5160 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 10702 SdHoareTripleChecker+Invalid, 9655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 5160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4315 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:41:20,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2347 Valid, 10702 Invalid, 9655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 5160 Invalid, 0 Unknown, 4315 Unchecked, 3.0s Time] [2022-03-03 17:41:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7137 states. [2022-03-03 17:41:20,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7137 to 4257. [2022-03-03 17:41:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4257 states, 4256 states have (on average 2.7084116541353382) internal successors, (11527), 4256 states have internal predecessors, (11527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:41:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 11527 transitions. [2022-03-03 17:41:20,398 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 11527 transitions. Word has length 133 [2022-03-03 17:41:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:41:20,399 INFO L470 AbstractCegarLoop]: Abstraction has 4257 states and 11527 transitions. [2022-03-03 17:41:20,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 3.308411214953271) internal successors, (354), 107 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:41:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 11527 transitions. [2022-03-03 17:41:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:41:20,405 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:41:20,405 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:41:20,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-03 17:41:20,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-03 17:41:20,619 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:41:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:41:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1588361590, now seen corresponding path program 11 times [2022-03-03 17:41:20,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:41:20,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330770658] [2022-03-03 17:41:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:41:20,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:41:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:41:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:41:22,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:41:22,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330770658] [2022-03-03 17:41:22,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330770658] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:41:22,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134165905] [2022-03-03 17:41:22,325 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:41:22,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:41:22,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:41:22,326 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:41:22,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-03 17:41:22,418 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-03 17:41:22,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:41:22,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 84 conjunts are in the unsatisfiable core [2022-03-03 17:41:22,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:41:22,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:41:22,902 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:41:22,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-03 17:41:23,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:41:23,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:41:24,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:41:24,965 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:41:24,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-03-03 17:41:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:41:25,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:41:26,878 WARN L838 $PredicateComparison]: unable to prove that (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_582 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_582) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) is different from false [2022-03-03 17:41:26,903 WARN L838 $PredicateComparison]: unable to prove that (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_582 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_582) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0)) is different from false [2022-03-03 17:41:26,916 WARN L838 $PredicateComparison]: unable to prove that (or (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_582 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_582) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0)) is different from false [2022-03-03 17:41:26,944 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse2 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse1 (+ .cse2 aux_mod_aux_mod_~C~0_30_61)) (.cse0 (* 4294967295 c_~x~0))) (or (<= (+ .cse0 c_~y~0 4294967296) .cse1) (= (+ (* (- 1) c_~y~0) .cse2 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse1 (+ .cse0 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_582 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_582) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0)) is different from false [2022-03-03 17:41:30,045 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:41:30,045 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 130 treesize of output 106 [2022-03-03 17:41:30,054 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:41:30,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 205 [2022-03-03 17:41:30,066 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:41:30,066 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 189 treesize of output 187 [2022-03-03 17:41:30,070 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 152 treesize of output 140 [2022-03-03 17:41:30,074 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 140 treesize of output 128 [2022-03-03 17:41:33,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-03 17:41:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:41:33,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134165905] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:41:33,506 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:41:33,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 39] total 109 [2022-03-03 17:41:33,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29775807] [2022-03-03 17:41:33,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:41:33,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-03-03 17:41:33,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:41:33,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-03-03 17:41:33,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=10192, Unknown=29, NotChecked=836, Total=11772 [2022-03-03 17:41:33,508 INFO L87 Difference]: Start difference. First operand 4257 states and 11527 transitions. Second operand has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:41:40,662 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0))) (.cse2 (= c_~s~0 c_~N~0)) (.cse0 (mod c_~x~0 4294967296)) (.cse3 (mod c_~y~0 4294967296))) (and (= c_~y~0 0) (or (and (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) (<= 1 c_~N~0) (<= c_~x~0 c_~C~0) (<= c_~C~0 c_~x~0)) (not (= (+ (- 1) |c_thread2Thread1of1ForFork1_~j~0#1|) 0))) (or (and (= c_~N~0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|)) (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse0)) (< c_~q_front~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (<= c_~n~0 c_~q_front~0)) (or .cse1 (and .cse2 (= .cse3 (mod (+ c_~C~0 c_~x~0) 4294967296)))) (= c_~s~0 0) (or (= |c_thread2Thread1of1ForFork1_~j~0#1| 1) (<= (* c_~n~0 4) (+ c_~q~0.offset 3 (* 4 c_~q_back~0)))) (or .cse1 (and .cse2 (= .cse0 .cse3))) (= c_~q~0.offset 0) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (and (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse6 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse5 (+ .cse6 aux_mod_aux_mod_~C~0_30_61)) (.cse4 (* 4294967295 c_~x~0))) (or (<= (+ .cse4 c_~y~0 4294967296) .cse5) (= (+ (* (- 1) c_~y~0) .cse6 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse5 (+ .cse4 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))) (forall ((v_ArrVal_582 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_582) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))))) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0)))) is different from false [2022-03-03 17:41:46,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:41:46,892 INFO L93 Difference]: Finished difference Result 5962 states and 15661 transitions. [2022-03-03 17:41:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-03-03 17:41:46,893 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:41:46,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:41:46,902 INFO L225 Difference]: With dead ends: 5962 [2022-03-03 17:41:46,903 INFO L226 Difference]: Without dead ends: 5764 [2022-03-03 17:41:46,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 211 SyntacticMatches, 6 SemanticMatches, 176 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 9719 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=2045, Invalid=27621, Unknown=110, NotChecked=1730, Total=31506 [2022-03-03 17:41:46,910 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 1496 mSDsluCounter, 10551 mSDsCounter, 0 mSdLazyCounter, 3250 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 10234 SdHoareTripleChecker+Invalid, 7557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4213 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:41:46,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1496 Valid, 10234 Invalid, 7557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3250 Invalid, 0 Unknown, 4213 Unchecked, 2.1s Time] [2022-03-03 17:41:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2022-03-03 17:41:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 4436. [2022-03-03 17:41:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4436 states, 4435 states have (on average 2.69695603156708) internal successors, (11961), 4435 states have internal predecessors, (11961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:41:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 11961 transitions. [2022-03-03 17:41:47,017 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 11961 transitions. Word has length 133 [2022-03-03 17:41:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:41:47,017 INFO L470 AbstractCegarLoop]: Abstraction has 4436 states and 11961 transitions. [2022-03-03 17:41:47,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 3.2477064220183487) internal successors, (354), 109 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:41:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 11961 transitions. [2022-03-03 17:41:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:41:47,024 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:41:47,024 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:41:47,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-03 17:41:47,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:41:47,236 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:41:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:41:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash 286572404, now seen corresponding path program 12 times [2022-03-03 17:41:47,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:41:47,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292373371] [2022-03-03 17:41:47,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:41:47,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:41:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:41:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:41:48,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:41:48,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292373371] [2022-03-03 17:41:48,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292373371] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:41:48,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246993250] [2022-03-03 17:41:48,837 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:41:48,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:41:48,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:41:48,839 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:41:48,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-03 17:41:48,953 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 17:41:48,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:41:48,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-03 17:41:48,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:41:51,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:41:51,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:41:51,506 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-03-03 17:41:51,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2022-03-03 17:41:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:41:52,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:41:53,524 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:41:53,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:41:53,527 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 66 treesize of output 60 [2022-03-03 17:42:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:42:07,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246993250] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:42:07,831 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:42:07,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 37] total 102 [2022-03-03 17:42:07,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634571484] [2022-03-03 17:42:07,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:42:07,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-03-03 17:42:07,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:42:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-03-03 17:42:07,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=9552, Unknown=10, NotChecked=0, Total=10302 [2022-03-03 17:42:07,833 INFO L87 Difference]: Start difference. First operand 4436 states and 11961 transitions. Second operand has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:42:21,709 WARN L228 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 17:42:38,881 WARN L228 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 17:42:42,970 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~s~0 c_~N~0)) (.cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse0 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| 0)))) (and (or .cse0 (and .cse1 (= (mod c_~y~0 4294967296) .cse2))) (or (and .cse1 (= (mod (+ c_~C~0 c_~y~0) 4294967296) .cse2)) .cse0) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0) (<= c_~n~0 c_~q_back~0) (and (forall ((v_ArrVal_611 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_611) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (forall ((aux_mod_aux_mod_~C~0_30_61 Int) (aux_div_aux_mod_~C~0_30_61 Int)) (let ((.cse5 (* aux_div_aux_mod_~C~0_30_61 4294967296))) (let ((.cse4 (+ .cse5 aux_mod_aux_mod_~C~0_30_61)) (.cse3 (* 4294967295 c_~x~0))) (or (<= (+ .cse3 c_~y~0 4294967296) .cse4) (= (+ (* (- 1) c_~y~0) .cse5 (* c_~x~0 (- 4294967295)) aux_mod_aux_mod_~C~0_30_61) aux_mod_aux_mod_~C~0_30_61) (>= aux_mod_aux_mod_~C~0_30_61 4294967296) (< .cse4 (+ .cse3 c_~y~0)) (> 0 aux_mod_aux_mod_~C~0_30_61))))))))) is different from false [2022-03-03 17:42:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:42:44,795 INFO L93 Difference]: Finished difference Result 6452 states and 17163 transitions. [2022-03-03 17:42:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-03 17:42:44,796 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:42:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:42:44,805 INFO L225 Difference]: With dead ends: 6452 [2022-03-03 17:42:44,805 INFO L226 Difference]: Without dead ends: 6096 [2022-03-03 17:42:44,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 224 SyntacticMatches, 11 SemanticMatches, 159 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8410 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=2054, Invalid=23373, Unknown=17, NotChecked=316, Total=25760 [2022-03-03 17:42:44,807 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 1519 mSDsluCounter, 7945 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 7622 SdHoareTripleChecker+Invalid, 3632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1770 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:42:44,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1519 Valid, 7622 Invalid, 3632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1799 Invalid, 0 Unknown, 1770 Unchecked, 1.1s Time] [2022-03-03 17:42:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6096 states. [2022-03-03 17:42:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6096 to 4576. [2022-03-03 17:42:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4576 states, 4575 states have (on average 2.7016393442622952) internal successors, (12360), 4575 states have internal predecessors, (12360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:42:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4576 states to 4576 states and 12360 transitions. [2022-03-03 17:42:44,919 INFO L78 Accepts]: Start accepts. Automaton has 4576 states and 12360 transitions. Word has length 133 [2022-03-03 17:42:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:42:44,920 INFO L470 AbstractCegarLoop]: Abstraction has 4576 states and 12360 transitions. [2022-03-03 17:42:44,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:42:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 12360 transitions. [2022-03-03 17:42:44,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:42:44,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:42:44,927 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:42:44,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-03 17:42:45,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:42:45,139 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:42:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:42:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash 393993568, now seen corresponding path program 13 times [2022-03-03 17:42:45,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:42:45,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606307787] [2022-03-03 17:42:45,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:42:45,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:42:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:42:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:42:47,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:42:47,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606307787] [2022-03-03 17:42:47,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606307787] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:42:47,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867822722] [2022-03-03 17:42:47,135 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 17:42:47,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:42:47,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:42:47,136 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:42:47,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-03 17:42:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:42:47,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-03 17:42:47,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:42:49,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:42:49,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:42:49,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-03 17:42:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:42:50,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:42:51,947 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:42:51,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2022-03-03 17:42:51,953 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 38 treesize of output 32 [2022-03-03 17:42:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:42:56,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867822722] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:42:56,810 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:42:56,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 41] total 116 [2022-03-03 17:42:56,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666989037] [2022-03-03 17:42:56,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:42:56,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2022-03-03 17:42:56,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:42:56,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2022-03-03 17:42:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=873, Invalid=12460, Unknown=7, NotChecked=0, Total=13340 [2022-03-03 17:42:56,813 INFO L87 Difference]: Start difference. First operand 4576 states and 12360 transitions. Second operand has 116 states, 116 states have (on average 3.0517241379310347) internal successors, (354), 116 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:43:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:43:27,990 INFO L93 Difference]: Finished difference Result 9370 states and 25199 transitions. [2022-03-03 17:43:27,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2022-03-03 17:43:27,991 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 116 states have (on average 3.0517241379310347) internal successors, (354), 116 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:43:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:43:28,006 INFO L225 Difference]: With dead ends: 9370 [2022-03-03 17:43:28,006 INFO L226 Difference]: Without dead ends: 8967 [2022-03-03 17:43:28,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 209 SyntacticMatches, 10 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18706 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=3811, Invalid=51082, Unknown=97, NotChecked=0, Total=54990 [2022-03-03 17:43:28,009 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 2802 mSDsluCounter, 10829 mSDsCounter, 0 mSdLazyCounter, 4083 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2802 SdHoareTripleChecker+Valid, 10112 SdHoareTripleChecker+Invalid, 9682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 4083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5406 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:43:28,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2802 Valid, 10112 Invalid, 9682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 4083 Invalid, 0 Unknown, 5406 Unchecked, 3.0s Time] [2022-03-03 17:43:28,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8967 states. [2022-03-03 17:43:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8967 to 5454. [2022-03-03 17:43:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5454 states, 5453 states have (on average 2.7153860260407114) internal successors, (14807), 5453 states have internal predecessors, (14807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:43:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5454 states to 5454 states and 14807 transitions. [2022-03-03 17:43:28,105 INFO L78 Accepts]: Start accepts. Automaton has 5454 states and 14807 transitions. Word has length 133 [2022-03-03 17:43:28,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:43:28,105 INFO L470 AbstractCegarLoop]: Abstraction has 5454 states and 14807 transitions. [2022-03-03 17:43:28,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 116 states have (on average 3.0517241379310347) internal successors, (354), 116 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:43:28,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5454 states and 14807 transitions. [2022-03-03 17:43:28,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:43:28,113 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:43:28,113 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:43:28,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-03 17:43:28,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:43:28,336 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:43:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:43:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash -491151136, now seen corresponding path program 14 times [2022-03-03 17:43:28,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:43:28,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300271854] [2022-03-03 17:43:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:43:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:43:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:43:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:43:30,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:43:30,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300271854] [2022-03-03 17:43:30,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300271854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:43:30,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403979499] [2022-03-03 17:43:30,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:43:30,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:43:30,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:43:30,105 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:43:30,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-03 17:43:30,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:43:30,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:43:30,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-03 17:43:30,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:43:32,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:43:32,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:43:32,841 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-03 17:43:32,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-03-03 17:43:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:43:33,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:43:34,804 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_669 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_669) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))) is different from false [2022-03-03 17:43:34,826 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_669 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_669) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))) is different from false [2022-03-03 17:43:34,838 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod c_~x~0 4294967296)) (forall ((v_ArrVal_669 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_669) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))) is different from false [2022-03-03 17:43:34,850 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (forall ((v_ArrVal_669 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_669) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~C~0 c_~y~0) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296)))) is different from false [2022-03-03 17:43:34,865 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:43:34,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 55 [2022-03-03 17:43:34,868 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 34 treesize of output 28 [2022-03-03 17:43:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:43:43,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403979499] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:43:43,942 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:43:43,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 38] total 104 [2022-03-03 17:43:43,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560341228] [2022-03-03 17:43:43,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:43:43,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-03-03 17:43:43,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:43:43,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-03-03 17:43:43,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=9236, Unknown=7, NotChecked=796, Total=10712 [2022-03-03 17:43:43,944 INFO L87 Difference]: Start difference. First operand 5454 states and 14807 transitions. Second operand has 104 states, 104 states have (on average 3.2596153846153846) internal successors, (339), 104 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:43:49,228 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ c_~C~0 c_~y~0) 4294967296))) (let ((.cse0 (= .cse5 (mod c_~x~0 4294967296))) (.cse1 (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (.cse4 (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (.cse2 (<= c_~n~0 (+ c_~q_front~0 1))) (.cse3 (<= c_~n~0 0))) (and (or (and .cse0 (= c_~N~0 .cse1)) .cse2 .cse3 .cse4) (or .cse2 .cse3 (and .cse0 (= (+ c_~s~0 .cse1) c_~N~0)) .cse4) (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) .cse2 .cse3 (and (forall ((v_ArrVal_669 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_669) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= .cse5 (mod (+ c_~C~0 c_~x~0) 4294967296)))) (= c_~x~0 0)))) is different from false [2022-03-03 17:43:55,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:43:55,146 INFO L93 Difference]: Finished difference Result 7863 states and 21094 transitions. [2022-03-03 17:43:55,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-03 17:43:55,147 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 3.2596153846153846) internal successors, (339), 104 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:43:55,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:43:55,158 INFO L225 Difference]: With dead ends: 7863 [2022-03-03 17:43:55,158 INFO L226 Difference]: Without dead ends: 7665 [2022-03-03 17:43:55,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 210 SyntacticMatches, 9 SemanticMatches, 169 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 8767 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=2229, Invalid=25138, Unknown=43, NotChecked=1660, Total=29070 [2022-03-03 17:43:55,161 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 2133 mSDsluCounter, 9809 mSDsCounter, 0 mSdLazyCounter, 3497 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 9262 SdHoareTripleChecker+Invalid, 6993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 3497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3322 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:43:55,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2133 Valid, 9262 Invalid, 6993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 3497 Invalid, 0 Unknown, 3322 Unchecked, 3.0s Time] [2022-03-03 17:43:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7665 states. [2022-03-03 17:43:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7665 to 5678. [2022-03-03 17:43:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 5677 states have (on average 2.714990311784393) internal successors, (15413), 5677 states have internal predecessors, (15413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:43:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 15413 transitions. [2022-03-03 17:43:55,255 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 15413 transitions. Word has length 133 [2022-03-03 17:43:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:43:55,255 INFO L470 AbstractCegarLoop]: Abstraction has 5678 states and 15413 transitions. [2022-03-03 17:43:55,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 3.2596153846153846) internal successors, (339), 104 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:43:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 15413 transitions. [2022-03-03 17:43:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:43:55,263 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:43:55,263 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:43:55,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-03 17:43:55,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:43:55,467 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:43:55,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:43:55,468 INFO L85 PathProgramCache]: Analyzing trace with hash -4654400, now seen corresponding path program 15 times [2022-03-03 17:43:55,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:43:55,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29617454] [2022-03-03 17:43:55,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:43:55,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:43:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:43:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:43:56,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:43:56,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29617454] [2022-03-03 17:43:56,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29617454] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:43:56,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594918694] [2022-03-03 17:43:56,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:43:56,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:43:56,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:43:56,997 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:43:56,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-03 17:43:57,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:43:57,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:43:57,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-03 17:43:57,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:43:58,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:43:58,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:43:58,334 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-03 17:43:58,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-03-03 17:43:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:43:58,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:43:59,586 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:43:59,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:43:59,589 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 66 treesize of output 60 [2022-03-03 17:44:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:44:05,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594918694] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:44:05,674 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:44:05,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 29, 27] total 84 [2022-03-03 17:44:05,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271163191] [2022-03-03 17:44:05,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:44:05,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-03-03 17:44:05,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:44:05,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-03-03 17:44:05,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=6545, Unknown=8, NotChecked=0, Total=6972 [2022-03-03 17:44:05,675 INFO L87 Difference]: Start difference. First operand 5678 states and 15413 transitions. Second operand has 84 states, 84 states have (on average 3.869047619047619) internal successors, (325), 84 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:44:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:44:11,538 INFO L93 Difference]: Finished difference Result 7594 states and 20432 transitions. [2022-03-03 17:44:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-03 17:44:11,538 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.869047619047619) internal successors, (325), 84 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:44:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:44:11,550 INFO L225 Difference]: With dead ends: 7594 [2022-03-03 17:44:11,550 INFO L226 Difference]: Without dead ends: 7312 [2022-03-03 17:44:11,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 228 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1363, Invalid=17533, Unknown=10, NotChecked=0, Total=18906 [2022-03-03 17:44:11,552 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 1664 mSDsluCounter, 7532 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 7281 SdHoareTripleChecker+Invalid, 3646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1211 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:44:11,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1664 Valid, 7281 Invalid, 3646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2379 Invalid, 0 Unknown, 1211 Unchecked, 1.6s Time] [2022-03-03 17:44:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7312 states. [2022-03-03 17:44:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7312 to 5864. [2022-03-03 17:44:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5864 states, 5863 states have (on average 2.7213030871567456) internal successors, (15955), 5863 states have internal predecessors, (15955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:44:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 15955 transitions. [2022-03-03 17:44:11,657 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 15955 transitions. Word has length 133 [2022-03-03 17:44:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:44:11,657 INFO L470 AbstractCegarLoop]: Abstraction has 5864 states and 15955 transitions. [2022-03-03 17:44:11,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.869047619047619) internal successors, (325), 84 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:44:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 15955 transitions. [2022-03-03 17:44:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:44:11,665 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:44:11,666 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:44:11,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-03 17:44:11,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:44:11,869 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:44:11,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:44:11,870 INFO L85 PathProgramCache]: Analyzing trace with hash 791484664, now seen corresponding path program 16 times [2022-03-03 17:44:11,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:44:11,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655241349] [2022-03-03 17:44:11,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:44:11,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:44:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:44:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:44:13,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:44:13,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655241349] [2022-03-03 17:44:13,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655241349] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:44:13,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525844073] [2022-03-03 17:44:13,486 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:44:13,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:44:13,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:44:13,487 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:44:13,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-03 17:44:13,585 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:44:13,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:44:13,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-03 17:44:13,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:44:15,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:44:15,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:44:15,993 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-03 17:44:15,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-03-03 17:44:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:44:16,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:44:17,874 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:44:17,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:44:17,877 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 66 treesize of output 60 [2022-03-03 17:44:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:44:29,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525844073] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:44:29,301 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:44:29,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 36] total 102 [2022-03-03 17:44:29,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050966482] [2022-03-03 17:44:29,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:44:29,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-03-03 17:44:29,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:44:29,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-03-03 17:44:29,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=9573, Unknown=6, NotChecked=0, Total=10302 [2022-03-03 17:44:29,303 INFO L87 Difference]: Start difference. First operand 5864 states and 15955 transitions. Second operand has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:44:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:44:40,339 INFO L93 Difference]: Finished difference Result 8769 states and 23533 transitions. [2022-03-03 17:44:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-03-03 17:44:40,339 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:44:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:44:40,353 INFO L225 Difference]: With dead ends: 8769 [2022-03-03 17:44:40,353 INFO L226 Difference]: Without dead ends: 8652 [2022-03-03 17:44:40,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 223 SyntacticMatches, 8 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8689 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=2024, Invalid=25025, Unknown=11, NotChecked=0, Total=27060 [2022-03-03 17:44:40,355 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 1606 mSDsluCounter, 11164 mSDsCounter, 0 mSdLazyCounter, 2876 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 10654 SdHoareTripleChecker+Invalid, 5592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2664 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:44:40,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1606 Valid, 10654 Invalid, 5592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2876 Invalid, 0 Unknown, 2664 Unchecked, 1.6s Time] [2022-03-03 17:44:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8652 states. [2022-03-03 17:44:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8652 to 6080. [2022-03-03 17:44:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6080 states, 6079 states have (on average 2.7116302023359107) internal successors, (16484), 6079 states have internal predecessors, (16484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:44:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6080 states to 6080 states and 16484 transitions. [2022-03-03 17:44:40,472 INFO L78 Accepts]: Start accepts. Automaton has 6080 states and 16484 transitions. Word has length 133 [2022-03-03 17:44:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:44:40,472 INFO L470 AbstractCegarLoop]: Abstraction has 6080 states and 16484 transitions. [2022-03-03 17:44:40,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:44:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 6080 states and 16484 transitions. [2022-03-03 17:44:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:44:40,480 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:44:40,480 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:44:40,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-03 17:44:40,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:44:40,696 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:44:40,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:44:40,697 INFO L85 PathProgramCache]: Analyzing trace with hash -510304522, now seen corresponding path program 17 times [2022-03-03 17:44:40,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:44:40,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515909049] [2022-03-03 17:44:40,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:44:40,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:44:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:44:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:44:42,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:44:42,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515909049] [2022-03-03 17:44:42,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515909049] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:44:42,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564245019] [2022-03-03 17:44:42,237 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:44:42,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:44:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:44:42,252 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:44:42,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-03 17:44:42,400 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-03 17:44:42,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:44:42,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-03 17:44:42,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:44:43,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:44:43,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:44:43,936 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-03 17:44:43,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-03-03 17:44:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:44:44,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:44:45,890 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:44:45,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 108 [2022-03-03 17:44:45,894 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 80 treesize of output 68 [2022-03-03 17:44:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:44:47,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564245019] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:44:47,474 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:44:47,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 30, 29] total 87 [2022-03-03 17:44:47,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953175970] [2022-03-03 17:44:47,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:44:47,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-03-03 17:44:47,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:44:47,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-03-03 17:44:47,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=7037, Unknown=5, NotChecked=0, Total=7482 [2022-03-03 17:44:47,476 INFO L87 Difference]: Start difference. First operand 6080 states and 16484 transitions. Second operand has 87 states, 87 states have (on average 3.735632183908046) internal successors, (325), 87 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:44:55,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:44:55,642 INFO L93 Difference]: Finished difference Result 8553 states and 22933 transitions. [2022-03-03 17:44:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-03 17:44:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 3.735632183908046) internal successors, (325), 87 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:44:55,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:44:55,653 INFO L225 Difference]: With dead ends: 8553 [2022-03-03 17:44:55,653 INFO L226 Difference]: Without dead ends: 8217 [2022-03-03 17:44:55,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 226 SyntacticMatches, 9 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7836 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1659, Invalid=23456, Unknown=7, NotChecked=0, Total=25122 [2022-03-03 17:44:55,655 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 1931 mSDsluCounter, 8029 mSDsCounter, 0 mSdLazyCounter, 2838 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1931 SdHoareTripleChecker+Valid, 7687 SdHoareTripleChecker+Invalid, 4629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1711 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-03 17:44:55,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1931 Valid, 7687 Invalid, 4629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2838 Invalid, 0 Unknown, 1711 Unchecked, 1.8s Time] [2022-03-03 17:44:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2022-03-03 17:44:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 6140. [2022-03-03 17:44:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6140 states, 6139 states have (on average 2.7180322528099037) internal successors, (16686), 6139 states have internal predecessors, (16686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:44:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 16686 transitions. [2022-03-03 17:44:55,736 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 16686 transitions. Word has length 133 [2022-03-03 17:44:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:44:55,736 INFO L470 AbstractCegarLoop]: Abstraction has 6140 states and 16686 transitions. [2022-03-03 17:44:55,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 3.735632183908046) internal successors, (325), 87 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:44:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 16686 transitions. [2022-03-03 17:44:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:44:55,743 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:44:55,743 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:44:55,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-03 17:44:55,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-03 17:44:55,960 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:44:55,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:44:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash -402883358, now seen corresponding path program 18 times [2022-03-03 17:44:55,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:44:55,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671750066] [2022-03-03 17:44:55,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:44:55,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:44:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:44:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:44:57,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:44:57,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671750066] [2022-03-03 17:44:57,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671750066] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:44:57,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471208559] [2022-03-03 17:44:57,536 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:44:57,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:44:57,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:44:57,538 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:44:57,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-03 17:44:57,635 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 17:44:57,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:44:57,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 81 conjunts are in the unsatisfiable core [2022-03-03 17:44:57,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:44:59,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:44:59,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-03 17:45:00,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:45:00,106 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:45:00,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-03-03 17:45:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:45:00,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:45:02,201 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_785 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_785) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296)))) is different from false [2022-03-03 17:45:02,222 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_#t~post1#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (forall ((v_ArrVal_785 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_785) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296)))) is different from false [2022-03-03 17:45:02,235 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (forall ((v_ArrVal_785 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_785) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)) (= (mod (+ c_~y~0 (* c_~C~0 2)) 4294967296) (mod (+ c_~C~0 c_~x~0) 4294967296)))) is different from false [2022-03-03 17:45:02,255 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0) (<= c_~n~0 (+ c_~q_front~0 1)) (<= c_~n~0 0) (and (forall ((~C~0 Int)) (let ((.cse0 (* 2 ~C~0))) (= (mod (+ c_~x~0 .cse0) 4294967296) (mod (+ c_~y~0 .cse0) 4294967296)))) (forall ((v_ArrVal_785 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_785) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) c_~N~0)))) is different from false [2022-03-03 17:45:02,280 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:45:02,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2022-03-03 17:45:02,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-03-03 17:45:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:45:05,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471208559] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:45:05,402 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:45:05,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 38] total 104 [2022-03-03 17:45:05,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267351052] [2022-03-03 17:45:05,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:45:05,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-03-03 17:45:05,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:45:05,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-03-03 17:45:05,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=9230, Unknown=4, NotChecked=796, Total=10712 [2022-03-03 17:45:05,404 INFO L87 Difference]: Start difference. First operand 6140 states and 16686 transitions. Second operand has 104 states, 104 states have (on average 3.2596153846153846) internal successors, (339), 104 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:45:31,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-03 17:45:33,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-03 17:45:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:45:36,015 INFO L93 Difference]: Finished difference Result 7605 states and 20333 transitions. [2022-03-03 17:45:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-03-03 17:45:36,015 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 3.2596153846153846) internal successors, (339), 104 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:45:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:45:36,027 INFO L225 Difference]: With dead ends: 7605 [2022-03-03 17:45:36,027 INFO L226 Difference]: Without dead ends: 7053 [2022-03-03 17:45:36,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 227 SyntacticMatches, 10 SemanticMatches, 166 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8715 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=2085, Invalid=24653, Unknown=10, NotChecked=1308, Total=28056 [2022-03-03 17:45:36,029 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 2296 mSDsluCounter, 9123 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 80 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 8534 SdHoareTripleChecker+Invalid, 7252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4705 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:45:36,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2296 Valid, 8534 Invalid, 7252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2466 Invalid, 1 Unknown, 4705 Unchecked, 6.3s Time] [2022-03-03 17:45:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7053 states. [2022-03-03 17:45:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7053 to 6076. [2022-03-03 17:45:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6076 states, 6075 states have (on average 2.7173662551440327) internal successors, (16508), 6075 states have internal predecessors, (16508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:45:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6076 states to 6076 states and 16508 transitions. [2022-03-03 17:45:36,156 INFO L78 Accepts]: Start accepts. Automaton has 6076 states and 16508 transitions. Word has length 133 [2022-03-03 17:45:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:45:36,156 INFO L470 AbstractCegarLoop]: Abstraction has 6076 states and 16508 transitions. [2022-03-03 17:45:36,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 3.2596153846153846) internal successors, (339), 104 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:45:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 6076 states and 16508 transitions. [2022-03-03 17:45:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:45:36,163 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:45:36,164 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:45:36,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-03 17:45:36,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-03 17:45:36,380 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:45:36,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:45:36,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1565162398, now seen corresponding path program 19 times [2022-03-03 17:45:36,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:45:36,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118107262] [2022-03-03 17:45:36,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:45:36,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:45:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:45:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:45:38,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:45:38,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118107262] [2022-03-03 17:45:38,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118107262] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:45:38,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192220543] [2022-03-03 17:45:38,033 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 17:45:38,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:45:38,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:45:38,035 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:45:38,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-03 17:45:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:45:38,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-03 17:45:38,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:45:40,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:45:40,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:45:40,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-03 17:45:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:45:41,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:45:42,821 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:45:42,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2022-03-03 17:45:42,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-03-03 17:45:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:45:51,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192220543] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:45:51,853 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:45:51,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 37] total 102 [2022-03-03 17:45:51,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225481049] [2022-03-03 17:45:51,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:45:51,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-03-03 17:45:51,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:45:51,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-03-03 17:45:51,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=752, Invalid=9544, Unknown=6, NotChecked=0, Total=10302 [2022-03-03 17:45:51,856 INFO L87 Difference]: Start difference. First operand 6076 states and 16508 transitions. Second operand has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:45:57,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:45:57,306 INFO L93 Difference]: Finished difference Result 8231 states and 22141 transitions. [2022-03-03 17:45:57,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-03-03 17:45:57,307 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-03 17:45:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:45:57,318 INFO L225 Difference]: With dead ends: 8231 [2022-03-03 17:45:57,318 INFO L226 Difference]: Without dead ends: 7989 [2022-03-03 17:45:57,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 215 SyntacticMatches, 5 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7324 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=1881, Invalid=19865, Unknown=10, NotChecked=0, Total=21756 [2022-03-03 17:45:57,320 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 1841 mSDsluCounter, 10410 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 9799 SdHoareTripleChecker+Invalid, 5077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2385 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:45:57,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1841 Valid, 9799 Invalid, 5077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2627 Invalid, 0 Unknown, 2385 Unchecked, 1.6s Time] [2022-03-03 17:45:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7989 states. [2022-03-03 17:45:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7989 to 6091. [2022-03-03 17:45:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6091 states, 6090 states have (on average 2.7182266009852216) internal successors, (16554), 6090 states have internal predecessors, (16554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:45:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6091 states to 6091 states and 16554 transitions. [2022-03-03 17:45:57,410 INFO L78 Accepts]: Start accepts. Automaton has 6091 states and 16554 transitions. Word has length 133 [2022-03-03 17:45:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:45:57,411 INFO L470 AbstractCegarLoop]: Abstraction has 6091 states and 16554 transitions. [2022-03-03 17:45:57,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.323529411764706) internal successors, (339), 102 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:45:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6091 states and 16554 transitions. [2022-03-03 17:45:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-03 17:45:57,418 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:45:57,418 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:45:57,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-03 17:45:57,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-03 17:45:57,644 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-03 17:45:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:45:57,644 INFO L85 PathProgramCache]: Analyzing trace with hash -282526598, now seen corresponding path program 20 times [2022-03-03 17:45:57,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:45:57,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302188150] [2022-03-03 17:45:57,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:45:57,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:45:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:45:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:45:59,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:45:59,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302188150] [2022-03-03 17:45:59,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302188150] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:45:59,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677059108] [2022-03-03 17:45:59,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:45:59,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:45:59,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:45:59,511 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:45:59,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-03 17:45:59,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:45:59,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:45:59,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-03 17:45:59,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:46:01,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:46:01,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-03 17:46:02,148 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 Received shutdown request... [2022-03-03 17:46:02,710 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-03 17:46:02,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-03 17:46:02,718 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 17:46:02,718 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 17:46:02,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:46:02,911 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 134 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. [2022-03-03 17:46:02,912 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-03 17:46:02,912 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-03 17:46:02,914 INFO L732 BasicCegarLoop]: Path program histogram: [20, 12, 3, 1, 1, 1] [2022-03-03 17:46:02,916 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 17:46:02,916 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 17:46:02,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:46:02 BasicIcfg [2022-03-03 17:46:02,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 17:46:02,918 INFO L158 Benchmark]: Toolchain (without parser) took 860142.23ms. Allocated memory was 220.2MB in the beginning and 701.5MB in the end (delta: 481.3MB). Free memory was 194.2MB in the beginning and 248.6MB in the end (delta: -54.4MB). Peak memory consumption was 426.8MB. Max. memory is 8.0GB. [2022-03-03 17:46:02,918 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 220.2MB. Free memory is still 182.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 17:46:02,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.32ms. Allocated memory is still 220.2MB. Free memory was 193.9MB in the beginning and 192.6MB in the end (delta: 1.3MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-03-03 17:46:02,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.84ms. Allocated memory is still 220.2MB. Free memory was 192.6MB in the beginning and 190.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 17:46:02,918 INFO L158 Benchmark]: Boogie Preprocessor took 34.83ms. Allocated memory is still 220.2MB. Free memory was 190.7MB in the beginning and 189.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 17:46:02,918 INFO L158 Benchmark]: RCFGBuilder took 481.59ms. Allocated memory is still 220.2MB. Free memory was 189.0MB in the beginning and 168.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-03-03 17:46:02,918 INFO L158 Benchmark]: TraceAbstraction took 859296.90ms. Allocated memory was 220.2MB in the beginning and 701.5MB in the end (delta: 481.3MB). Free memory was 167.6MB in the beginning and 248.6MB in the end (delta: -81.0MB). Peak memory consumption was 401.0MB. Max. memory is 8.0GB. [2022-03-03 17:46:02,919 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 220.2MB. Free memory is still 182.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 280.32ms. Allocated memory is still 220.2MB. Free memory was 193.9MB in the beginning and 192.6MB in the end (delta: 1.3MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.84ms. Allocated memory is still 220.2MB. Free memory was 192.6MB in the beginning and 190.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.83ms. Allocated memory is still 220.2MB. Free memory was 190.7MB in the beginning and 189.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 481.59ms. Allocated memory is still 220.2MB. Free memory was 189.0MB in the beginning and 168.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 859296.90ms. Allocated memory was 220.2MB in the beginning and 701.5MB in the end (delta: 481.3MB). Free memory was 167.6MB in the beginning and 248.6MB in the end (delta: -81.0MB). Peak memory consumption was 401.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 134 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 134 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 134 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 159 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 859.2s, OverallIterations: 38, TraceHistogramMax: 2, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.2s, AutomataDifference: 569.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 50629 SdHoareTripleChecker+Valid, 58.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50629 mSDsluCounter, 208614 SdHoareTripleChecker+Invalid, 53.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 61210 IncrementalHoareTripleChecker+Unchecked, 216665 mSDsCounter, 3281 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69807 IncrementalHoareTripleChecker+Invalid, 134302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3281 mSolverCounterUnsat, 7009 mSDtfsCounter, 69807 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9314 GetRequests, 4935 SyntacticMatches, 342 SemanticMatches, 4037 ConstructedPredicates, 34 IntricatePredicates, 3 DeprecatedPredicates, 265852 ImplicationChecksByTransitivity, 685.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6140occurred in iteration=35, InterpolantAutomatonStates: 2606, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 56938 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 273.2s InterpolantComputationTime, 7520 NumberOfCodeBlocks, 7499 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 10343 ConstructedInterpolants, 1488 QuantifiedInterpolants, 243299 SizeOfPredicates, 771 NumberOfNonLiveVariables, 6701 ConjunctsInSsa, 1377 ConjunctsInUnsatCore, 81 InterpolantComputations, 15 PerfectInterpolantSequences, 104/939 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown