/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 15:51:32,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 15:51:32,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 15:51:32,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 15:51:32,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 15:51:32,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 15:51:32,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 15:51:32,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 15:51:32,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 15:51:32,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 15:51:32,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 15:51:32,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 15:51:32,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 15:51:32,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 15:51:32,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 15:51:32,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 15:51:32,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 15:51:32,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 15:51:32,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 15:51:32,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 15:51:32,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 15:51:32,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 15:51:32,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 15:51:32,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 15:51:32,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 15:51:32,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 15:51:32,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 15:51:32,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 15:51:32,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 15:51:32,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 15:51:32,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 15:51:32,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 15:51:32,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 15:51:32,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 15:51:32,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 15:51:32,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 15:51:32,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 15:51:32,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 15:51:32,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 15:51:32,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 15:51:32,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 15:51:32,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 15:51:32,345 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 15:51:32,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 15:51:32,346 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 15:51:32,346 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 15:51:32,347 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 15:51:32,347 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 15:51:32,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 15:51:32,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 15:51:32,347 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 15:51:32,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 15:51:32,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 15:51:32,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 15:51:32,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 15:51:32,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 15:51:32,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 15:51:32,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 15:51:32,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 15:51:32,348 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 15:51:32,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 15:51:32,349 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 15:51:32,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 15:51:32,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 15:51:32,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 15:51:32,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 15:51:32,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 15:51:32,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 15:51:32,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 15:51:32,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 15:51:32,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 15:51:32,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 15:51:32,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 15:51:32,350 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 15:51:32,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 15:51:32,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-01 15:51:32,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 15:51:32,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 15:51:32,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 15:51:32,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 15:51:32,536 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 15:51:32,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-03-01 15:51:32,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607e443c8/be02d0c5c4084f5e878ff14fbe0a10a3/FLAG720640f65 [2022-03-01 15:51:32,927 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 15:51:32,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-03-01 15:51:32,932 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607e443c8/be02d0c5c4084f5e878ff14fbe0a10a3/FLAG720640f65 [2022-03-01 15:51:32,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607e443c8/be02d0c5c4084f5e878ff14fbe0a10a3 [2022-03-01 15:51:32,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 15:51:32,943 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 15:51:32,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 15:51:32,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 15:51:32,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 15:51:32,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 03:51:32" (1/1) ... [2022-03-01 15:51:32,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17506788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:32, skipping insertion in model container [2022-03-01 15:51:32,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 03:51:32" (1/1) ... [2022-03-01 15:51:32,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 15:51:32,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 15:51:33,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-03-01 15:51:33,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 15:51:33,126 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 15:51:33,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-03-01 15:51:33,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 15:51:33,152 INFO L208 MainTranslator]: Completed translation [2022-03-01 15:51:33,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33 WrapperNode [2022-03-01 15:51:33,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 15:51:33,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 15:51:33,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 15:51:33,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 15:51:33,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33" (1/1) ... [2022-03-01 15:51:33,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33" (1/1) ... [2022-03-01 15:51:33,180 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-03-01 15:51:33,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 15:51:33,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 15:51:33,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 15:51:33,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 15:51:33,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33" (1/1) ... [2022-03-01 15:51:33,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33" (1/1) ... [2022-03-01 15:51:33,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33" (1/1) ... [2022-03-01 15:51:33,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33" (1/1) ... [2022-03-01 15:51:33,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33" (1/1) ... [2022-03-01 15:51:33,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33" (1/1) ... [2022-03-01 15:51:33,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33" (1/1) ... [2022-03-01 15:51:33,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 15:51:33,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 15:51:33,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 15:51:33,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 15:51:33,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33" (1/1) ... [2022-03-01 15:51:33,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 15:51:33,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:51:33,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 15:51:33,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 15:51:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 15:51:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 15:51:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 15:51:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 15:51:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-01 15:51:33,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-01 15:51:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-01 15:51:33,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-01 15:51:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-01 15:51:33,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-01 15:51:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-01 15:51:33,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-01 15:51:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 15:51:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-01 15:51:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-01 15:51:33,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-01 15:51:33,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 15:51:33,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 15:51:33,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 15:51:33,271 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 15:51:33,326 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 15:51:33,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 15:51:33,542 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 15:51:33,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 15:51:33,635 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-01 15:51:33,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 03:51:33 BoogieIcfgContainer [2022-03-01 15:51:33,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 15:51:33,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 15:51:33,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 15:51:33,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 15:51:33,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 03:51:32" (1/3) ... [2022-03-01 15:51:33,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b58e6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 03:51:33, skipping insertion in model container [2022-03-01 15:51:33,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:51:33" (2/3) ... [2022-03-01 15:51:33,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b58e6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 03:51:33, skipping insertion in model container [2022-03-01 15:51:33,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 03:51:33" (3/3) ... [2022-03-01 15:51:33,651 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2022-03-01 15:51:33,654 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 15:51:33,654 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 15:51:33,654 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-01 15:51:33,654 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 15:51:33,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,711 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,711 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,711 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,712 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,712 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,712 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,713 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,714 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,714 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,714 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,714 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,714 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,714 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,714 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,715 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,715 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,715 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,715 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,715 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,715 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,717 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,717 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,717 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,717 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,717 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,717 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,718 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,718 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,718 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,718 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,718 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,718 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,718 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,718 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,719 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,720 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,720 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,720 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,720 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,720 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,720 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,720 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,720 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,721 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,721 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,721 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,721 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,722 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,723 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,724 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,725 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,725 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,726 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,726 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,726 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,728 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,728 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,728 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,728 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,729 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,729 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,729 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,729 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,729 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,729 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,730 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,730 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,730 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,730 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,730 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,730 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,730 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,731 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,731 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,731 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,731 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,731 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,731 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,731 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,731 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,732 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,732 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:51:33,735 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-01 15:51:33,795 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 15:51:33,799 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 15:51:33,799 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-01 15:51:33,807 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 172 transitions, 376 flow [2022-03-01 15:51:34,590 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-01 15:51:34,888 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:51:34,895 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-01 15:51:34,896 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:51:34,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:51:34,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1420994164, now seen corresponding path program 1 times [2022-03-01 15:51:34,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:51:34,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145201578] [2022-03-01 15:51:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:51:34,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:51:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:51:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:51:35,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:51:35,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145201578] [2022-03-01 15:51:35,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145201578] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:51:35,098 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:51:35,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 15:51:35,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539373998] [2022-03-01 15:51:35,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:51:35,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 15:51:35,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:51:35,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 15:51:35,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 15:51:35,175 INFO L87 Difference]: Start difference. First operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:51:35,673 INFO L93 Difference]: Finished difference Result 26140 states and 111710 transitions. [2022-03-01 15:51:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 15:51:35,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-03-01 15:51:35,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:51:35,975 INFO L225 Difference]: With dead ends: 26140 [2022-03-01 15:51:35,975 INFO L226 Difference]: Without dead ends: 26136 [2022-03-01 15:51:35,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 15:51:35,981 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:51:35,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 15:51:36,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26136 states. [2022-03-01 15:51:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26136 to 26136. [2022-03-01 15:51:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26136 states, 26135 states have (on average 4.274191696958102) internal successors, (111706), 26135 states have internal predecessors, (111706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26136 states to 26136 states and 111706 transitions. [2022-03-01 15:51:37,239 INFO L78 Accepts]: Start accepts. Automaton has 26136 states and 111706 transitions. Word has length 121 [2022-03-01 15:51:37,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:51:37,239 INFO L470 AbstractCegarLoop]: Abstraction has 26136 states and 111706 transitions. [2022-03-01 15:51:37,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 26136 states and 111706 transitions. [2022-03-01 15:51:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-01 15:51:37,350 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:51:37,351 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-01 15:51:37,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 15:51:37,351 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:51:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:51:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash -507464182, now seen corresponding path program 1 times [2022-03-01 15:51:37,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:51:37,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632630836] [2022-03-01 15:51:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:51:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:51:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:51:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:51:37,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:51:37,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632630836] [2022-03-01 15:51:37,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632630836] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:51:37,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:51:37,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 15:51:37,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954467433] [2022-03-01 15:51:37,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:51:37,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 15:51:37,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:51:37,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 15:51:37,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-03-01 15:51:37,582 INFO L87 Difference]: Start difference. First operand 26136 states and 111706 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:51:37,964 INFO L93 Difference]: Finished difference Result 35136 states and 150562 transitions. [2022-03-01 15:51:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 15:51:37,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-03-01 15:51:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:51:38,206 INFO L225 Difference]: With dead ends: 35136 [2022-03-01 15:51:38,207 INFO L226 Difference]: Without dead ends: 35136 [2022-03-01 15:51:38,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-03-01 15:51:38,210 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 352 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:51:38,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 319 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 15:51:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35136 states. [2022-03-01 15:51:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35136 to 28386. [2022-03-01 15:51:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28386 states, 28385 states have (on average 4.277611414479479) internal successors, (121420), 28385 states have internal predecessors, (121420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28386 states to 28386 states and 121420 transitions. [2022-03-01 15:51:39,881 INFO L78 Accepts]: Start accepts. Automaton has 28386 states and 121420 transitions. Word has length 121 [2022-03-01 15:51:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:51:39,881 INFO L470 AbstractCegarLoop]: Abstraction has 28386 states and 121420 transitions. [2022-03-01 15:51:39,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 28386 states and 121420 transitions. [2022-03-01 15:51:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-01 15:51:39,961 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:51:39,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:51:39,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 15:51:39,961 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:51:39,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:51:39,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1313580435, now seen corresponding path program 1 times [2022-03-01 15:51:39,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:51:39,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730484045] [2022-03-01 15:51:39,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:51:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:51:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:51:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:51:40,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:51:40,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730484045] [2022-03-01 15:51:40,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730484045] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:51:40,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:51:40,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 15:51:40,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735820734] [2022-03-01 15:51:40,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:51:40,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 15:51:40,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:51:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 15:51:40,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-01 15:51:40,084 INFO L87 Difference]: Start difference. First operand 28386 states and 121420 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:51:40,600 INFO L93 Difference]: Finished difference Result 37401 states and 158042 transitions. [2022-03-01 15:51:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-01 15:51:40,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-03-01 15:51:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:51:40,874 INFO L225 Difference]: With dead ends: 37401 [2022-03-01 15:51:40,874 INFO L226 Difference]: Without dead ends: 28392 [2022-03-01 15:51:40,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-03-01 15:51:40,880 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 425 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:51:40,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 475 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:51:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28392 states. [2022-03-01 15:51:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28392 to 28387. [2022-03-01 15:51:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28387 states, 28386 states have (on average 4.277495948707109) internal successors, (121421), 28386 states have internal predecessors, (121421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28387 states to 28387 states and 121421 transitions. [2022-03-01 15:51:41,940 INFO L78 Accepts]: Start accepts. Automaton has 28387 states and 121421 transitions. Word has length 126 [2022-03-01 15:51:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:51:41,940 INFO L470 AbstractCegarLoop]: Abstraction has 28387 states and 121421 transitions. [2022-03-01 15:51:41,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 28387 states and 121421 transitions. [2022-03-01 15:51:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-01 15:51:42,012 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:51:42,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:51:42,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 15:51:42,013 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:51:42,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:51:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1766570838, now seen corresponding path program 1 times [2022-03-01 15:51:42,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:51:42,014 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101174607] [2022-03-01 15:51:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:51:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:51:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:51:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:51:42,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:51:42,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101174607] [2022-03-01 15:51:42,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101174607] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:51:42,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37822500] [2022-03-01 15:51:42,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:51:42,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:51:42,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:51:42,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:51:42,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-01 15:51:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:51:42,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-01 15:51:42,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:51:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:51:42,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:51:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:51:42,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37822500] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 15:51:42,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 15:51:42,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-01 15:51:42,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454048888] [2022-03-01 15:51:42,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:51:42,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 15:51:42,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:51:42,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 15:51:42,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-01 15:51:42,923 INFO L87 Difference]: Start difference. First operand 28387 states and 121421 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:43,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:51:43,181 INFO L93 Difference]: Finished difference Result 30943 states and 132410 transitions. [2022-03-01 15:51:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 15:51:43,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-03-01 15:51:43,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:51:43,285 INFO L225 Difference]: With dead ends: 30943 [2022-03-01 15:51:43,285 INFO L226 Difference]: Without dead ends: 30943 [2022-03-01 15:51:43,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-01 15:51:43,286 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 280 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:51:43,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 368 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 15:51:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2022-03-01 15:51:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 30943. [2022-03-01 15:51:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30943 states, 30942 states have (on average 4.279296748755737) internal successors, (132410), 30942 states have internal predecessors, (132410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30943 states to 30943 states and 132410 transitions. [2022-03-01 15:51:44,331 INFO L78 Accepts]: Start accepts. Automaton has 30943 states and 132410 transitions. Word has length 133 [2022-03-01 15:51:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:51:44,331 INFO L470 AbstractCegarLoop]: Abstraction has 30943 states and 132410 transitions. [2022-03-01 15:51:44,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30943 states and 132410 transitions. [2022-03-01 15:51:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-01 15:51:44,414 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:51:44,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:51:44,446 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-01 15:51:44,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:51:44,631 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:51:44,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:51:44,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1027911653, now seen corresponding path program 1 times [2022-03-01 15:51:44,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:51:44,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626586587] [2022-03-01 15:51:44,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:51:44,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:51:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:51:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:51:44,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:51:44,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626586587] [2022-03-01 15:51:44,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626586587] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:51:44,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849139134] [2022-03-01 15:51:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:51:44,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:51:44,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:51:44,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:51:44,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-01 15:51:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:51:44,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-01 15:51:44,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:51:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:51:45,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:51:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:51:45,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849139134] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 15:51:45,219 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 15:51:45,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-01 15:51:45,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881139747] [2022-03-01 15:51:45,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:51:45,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 15:51:45,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:51:45,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 15:51:45,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-01 15:51:45,221 INFO L87 Difference]: Start difference. First operand 30943 states and 132410 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:51:45,753 INFO L93 Difference]: Finished difference Result 34267 states and 146807 transitions. [2022-03-01 15:51:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 15:51:45,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-03-01 15:51:45,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:51:45,883 INFO L225 Difference]: With dead ends: 34267 [2022-03-01 15:51:45,884 INFO L226 Difference]: Without dead ends: 34267 [2022-03-01 15:51:45,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-01 15:51:45,884 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 240 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:51:45,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 410 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:51:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34267 states. [2022-03-01 15:51:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34267 to 34267. [2022-03-01 15:51:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34267 states, 34266 states have (on average 4.284334325570536) internal successors, (146807), 34266 states have internal predecessors, (146807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34267 states to 34267 states and 146807 transitions. [2022-03-01 15:51:46,964 INFO L78 Accepts]: Start accepts. Automaton has 34267 states and 146807 transitions. Word has length 138 [2022-03-01 15:51:46,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:51:46,968 INFO L470 AbstractCegarLoop]: Abstraction has 34267 states and 146807 transitions. [2022-03-01 15:51:46,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 34267 states and 146807 transitions. [2022-03-01 15:51:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:51:47,047 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:51:47,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:51:47,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-01 15:51:47,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:51:47,264 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:51:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:51:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash 334563494, now seen corresponding path program 1 times [2022-03-01 15:51:47,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:51:47,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045942120] [2022-03-01 15:51:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:51:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:51:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:51:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:51:47,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:51:47,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045942120] [2022-03-01 15:51:47,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045942120] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:51:47,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24966768] [2022-03-01 15:51:47,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:51:47,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:51:47,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:51:47,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:51:47,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-01 15:51:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:51:47,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-01 15:51:47,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:51:48,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 15:51:48,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:51:48,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:51:48,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-01 15:51:48,482 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-01 15:51:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:51:48,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:51:48,812 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-03-01 15:51:48,913 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse2)) (.cse3 (+ .cse0 1))) (and (or .cse1 (<= .cse2 .cse3)) (or (not .cse1) (<= c_~min~0 .cse3)))))))) is different from false [2022-03-01 15:51:48,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (+ .cse0 1)) (.cse2 (< c_~min~0 .cse3))) (and (or (<= c_~min~0 .cse1) (not .cse2)) (or (<= .cse3 .cse1) .cse2))))))) is different from false [2022-03-01 15:51:48,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-03-01 15:51:49,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-03-01 15:51:49,031 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (or (<= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-03-01 15:51:49,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= 2147483647 .cse0) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ .cse0 1)))))) is different from false [2022-03-01 15:51:49,053 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= 2147483647 .cse0) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse0 1)))))) is different from false [2022-03-01 15:51:49,092 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:51:49,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 48 [2022-03-01 15:51:49,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 383 treesize of output 343 [2022-03-01 15:51:49,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2022-03-01 15:51:49,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2022-03-01 15:51:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-01 15:51:49,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24966768] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:51:49,209 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:51:49,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 41 [2022-03-01 15:51:49,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661201160] [2022-03-01 15:51:49,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:51:49,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-01 15:51:49,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:51:49,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-01 15:51:49,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=956, Unknown=8, NotChecked=552, Total=1640 [2022-03-01 15:51:49,210 INFO L87 Difference]: Start difference. First operand 34267 states and 146807 transitions. Second operand has 41 states, 41 states have (on average 9.146341463414634) internal successors, (375), 41 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:51:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:51:56,509 INFO L93 Difference]: Finished difference Result 402126 states and 1738565 transitions. [2022-03-01 15:51:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-01 15:51:56,510 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 9.146341463414634) internal successors, (375), 41 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:51:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:51:57,904 INFO L225 Difference]: With dead ends: 402126 [2022-03-01 15:51:57,904 INFO L226 Difference]: Without dead ends: 194037 [2022-03-01 15:51:57,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 265 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1800 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1749, Invalid=5931, Unknown=8, NotChecked=1432, Total=9120 [2022-03-01 15:51:57,906 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 2175 mSDsluCounter, 5810 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2175 SdHoareTripleChecker+Valid, 5713 SdHoareTripleChecker+Invalid, 6770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4677 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:51:57,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2175 Valid, 5713 Invalid, 6770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1978 Invalid, 0 Unknown, 4677 Unchecked, 1.3s Time] [2022-03-01 15:51:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194037 states. [2022-03-01 15:52:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194037 to 35853. [2022-03-01 15:52:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35853 states, 35852 states have (on average 4.236778980252148) internal successors, (151897), 35852 states have internal predecessors, (151897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35853 states to 35853 states and 151897 transitions. [2022-03-01 15:52:01,793 INFO L78 Accepts]: Start accepts. Automaton has 35853 states and 151897 transitions. Word has length 143 [2022-03-01 15:52:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:01,793 INFO L470 AbstractCegarLoop]: Abstraction has 35853 states and 151897 transitions. [2022-03-01 15:52:01,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.146341463414634) internal successors, (375), 41 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 35853 states and 151897 transitions. [2022-03-01 15:52:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:52:01,881 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:02,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:52:02,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-01 15:52:02,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:02,584 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:02,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:02,585 INFO L85 PathProgramCache]: Analyzing trace with hash 940179670, now seen corresponding path program 2 times [2022-03-01 15:52:02,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:02,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999802956] [2022-03-01 15:52:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:02,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:02,944 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:02,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999802956] [2022-03-01 15:52:02,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999802956] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:02,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048548602] [2022-03-01 15:52:02,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:52:02,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:02,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:52:02,952 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:52:02,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-01 15:52:03,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:52:03,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:52:03,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 15:52:03,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:52:03,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:52:03,125 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 15:52:03,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-01 15:52:03,282 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:52:03,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:52:03,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:52:03,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-01 15:52:03,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 14 treesize of output 16 [2022-03-01 15:52:03,692 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-01 15:52:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:52:03,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:52:04,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-03-01 15:52:04,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-03-01 15:52:04,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse2)) (.cse3 (+ .cse0 1))) (and (or .cse1 (<= .cse2 .cse3)) (or (not .cse1) (<= c_~min~0 .cse3)))))))) is different from false [2022-03-01 15:52:04,198 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (+ .cse3 1)) (.cse0 (< c_~min~0 .cse1))) (and (or .cse0 (<= .cse1 .cse2)) (or (<= c_~min~0 .cse2) (not .cse0))))) (<= 2147483647 .cse3)))) is different from false [2022-03-01 15:52:04,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 215 [2022-03-01 15:52:04,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 199 [2022-03-01 15:52:04,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 183 [2022-03-01 15:52:05,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-01 15:52:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-03-01 15:52:05,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048548602] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:52:05,144 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:52:05,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 20] total 43 [2022-03-01 15:52:05,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887027910] [2022-03-01 15:52:05,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:52:05,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-01 15:52:05,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:05,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-01 15:52:05,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1341, Unknown=4, NotChecked=308, Total=1806 [2022-03-01 15:52:05,146 INFO L87 Difference]: Start difference. First operand 35853 states and 151897 transitions. Second operand has 43 states, 43 states have (on average 8.325581395348838) internal successors, (358), 43 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:14,922 INFO L93 Difference]: Finished difference Result 448371 states and 1931078 transitions. [2022-03-01 15:52:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-01 15:52:14,923 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 8.325581395348838) internal successors, (358), 43 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:52:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:16,864 INFO L225 Difference]: With dead ends: 448371 [2022-03-01 15:52:16,865 INFO L226 Difference]: Without dead ends: 267623 [2022-03-01 15:52:16,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 261 SyntacticMatches, 6 SemanticMatches, 132 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4724 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3983, Invalid=12799, Unknown=4, NotChecked=1036, Total=17822 [2022-03-01 15:52:16,875 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 3000 mSDsluCounter, 5351 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 5200 SdHoareTripleChecker+Invalid, 4743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2485 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:16,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3000 Valid, 5200 Invalid, 4743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2025 Invalid, 0 Unknown, 2485 Unchecked, 1.3s Time] [2022-03-01 15:52:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267623 states. [2022-03-01 15:52:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267623 to 36609. [2022-03-01 15:52:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36609 states, 36608 states have (on average 4.219733391608392) internal successors, (154476), 36608 states have internal predecessors, (154476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36609 states to 36609 states and 154476 transitions. [2022-03-01 15:52:22,025 INFO L78 Accepts]: Start accepts. Automaton has 36609 states and 154476 transitions. Word has length 143 [2022-03-01 15:52:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:22,025 INFO L470 AbstractCegarLoop]: Abstraction has 36609 states and 154476 transitions. [2022-03-01 15:52:22,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 8.325581395348838) internal successors, (358), 43 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 36609 states and 154476 transitions. [2022-03-01 15:52:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:52:22,117 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:22,117 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:52:22,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-01 15:52:22,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:22,334 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:22,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:22,334 INFO L85 PathProgramCache]: Analyzing trace with hash -263687870, now seen corresponding path program 3 times [2022-03-01 15:52:22,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:22,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203152439] [2022-03-01 15:52:22,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:22,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:22,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:22,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203152439] [2022-03-01 15:52:22,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203152439] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:22,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452232173] [2022-03-01 15:52:22,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:52:22,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:22,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:52:22,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:52:23,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-01 15:52:23,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:52:23,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:52:23,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-01 15:52:23,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:52:24,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:52:24,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-01 15:52:24,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:52:24,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-01 15:52:24,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-01 15:52:24,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:52:24,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:52:24,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-03-01 15:52:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:24,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:52:24,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-03-01 15:52:24,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_279 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 .cse2 v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 .cse2) (+ v_ArrVal_278 1))))))) is different from false [2022-03-01 15:52:24,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_279 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1))) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2022-03-01 15:52:24,883 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-03-01 15:52:24,959 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-03-01 15:52:25,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse4 (select .cse5 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse3)) (.cse2 (+ .cse0 1))) (and (or (not .cse1) (<= c_~min~0 .cse2)) (or .cse1 (<= .cse3 .cse2))))) (not (<= (select .cse4 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-03-01 15:52:25,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse5 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse5 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (+ .cse0 1)) (.cse2 (< c_~min~0 .cse3))) (and (or .cse2 (<= .cse3 .cse4)) (or (<= c_~min~0 .cse4) (not .cse2)))))))))) is different from false [2022-03-01 15:52:25,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 279 [2022-03-01 15:52:25,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 203 [2022-03-01 15:52:25,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-03-01 15:52:25,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-03-01 15:52:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-01 15:52:26,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452232173] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:52:26,079 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:52:26,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 49 [2022-03-01 15:52:26,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345407516] [2022-03-01 15:52:26,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:52:26,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-01 15:52:26,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:26,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-01 15:52:26,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1554, Unknown=7, NotChecked=602, Total=2352 [2022-03-01 15:52:26,080 INFO L87 Difference]: Start difference. First operand 36609 states and 154476 transitions. Second operand has 49 states, 49 states have (on average 6.73469387755102) internal successors, (330), 49 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:34,983 INFO L93 Difference]: Finished difference Result 411059 states and 1780051 transitions. [2022-03-01 15:52:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-01 15:52:34,983 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 6.73469387755102) internal successors, (330), 49 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:52:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:37,131 INFO L225 Difference]: With dead ends: 411059 [2022-03-01 15:52:37,132 INFO L226 Difference]: Without dead ends: 275631 [2022-03-01 15:52:37,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 259 SyntacticMatches, 11 SemanticMatches, 114 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3176 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2630, Invalid=9163, Unknown=7, NotChecked=1540, Total=13340 [2022-03-01 15:52:37,134 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 5458 mSDsluCounter, 5362 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5458 SdHoareTripleChecker+Valid, 5392 SdHoareTripleChecker+Invalid, 7603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5196 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:37,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5458 Valid, 5392 Invalid, 7603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 2052 Invalid, 0 Unknown, 5196 Unchecked, 1.2s Time] [2022-03-01 15:52:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275631 states. [2022-03-01 15:52:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275631 to 35828. [2022-03-01 15:52:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35828 states, 35827 states have (on average 4.233622686800458) internal successors, (151678), 35827 states have internal predecessors, (151678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35828 states to 35828 states and 151678 transitions. [2022-03-01 15:52:42,936 INFO L78 Accepts]: Start accepts. Automaton has 35828 states and 151678 transitions. Word has length 143 [2022-03-01 15:52:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:42,937 INFO L470 AbstractCegarLoop]: Abstraction has 35828 states and 151678 transitions. [2022-03-01 15:52:42,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.73469387755102) internal successors, (330), 49 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 35828 states and 151678 transitions. [2022-03-01 15:52:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:52:43,125 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:43,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:52:43,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-01 15:52:43,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:43,341 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1870998198, now seen corresponding path program 4 times [2022-03-01 15:52:43,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:43,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658694034] [2022-03-01 15:52:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:43,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-01 15:52:43,436 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:43,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658694034] [2022-03-01 15:52:43,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658694034] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:52:43,436 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:52:43,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 15:52:43,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361115104] [2022-03-01 15:52:43,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:52:43,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 15:52:43,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:43,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 15:52:43,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 15:52:43,437 INFO L87 Difference]: Start difference. First operand 35828 states and 151678 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:44,382 INFO L93 Difference]: Finished difference Result 51233 states and 218839 transitions. [2022-03-01 15:52:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 15:52:44,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:52:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:44,537 INFO L225 Difference]: With dead ends: 51233 [2022-03-01 15:52:44,538 INFO L226 Difference]: Without dead ends: 32549 [2022-03-01 15:52:44,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-01 15:52:44,538 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:44,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 698 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:52:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32549 states. [2022-03-01 15:52:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32549 to 32426. [2022-03-01 15:52:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32426 states, 32425 states have (on average 4.1830377794911335) internal successors, (135635), 32425 states have internal predecessors, (135635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32426 states to 32426 states and 135635 transitions. [2022-03-01 15:52:45,398 INFO L78 Accepts]: Start accepts. Automaton has 32426 states and 135635 transitions. Word has length 143 [2022-03-01 15:52:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:45,398 INFO L470 AbstractCegarLoop]: Abstraction has 32426 states and 135635 transitions. [2022-03-01 15:52:45,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 32426 states and 135635 transitions. [2022-03-01 15:52:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:52:45,492 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:45,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:52:45,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 15:52:45,492 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:45,492 INFO L85 PathProgramCache]: Analyzing trace with hash -342153556, now seen corresponding path program 5 times [2022-03-01 15:52:45,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:45,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976324982] [2022-03-01 15:52:45,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:45,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:52:45,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:45,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976324982] [2022-03-01 15:52:45,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976324982] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:45,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103651543] [2022-03-01 15:52:45,629 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:52:45,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:52:45,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:52:45,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-01 15:52:45,724 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 15:52:45,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:52:45,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-01 15:52:45,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:52:45,940 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-01 15:52:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:52:46,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:52:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:52:46,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103651543] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:52:46,605 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:52:46,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 9] total 23 [2022-03-01 15:52:46,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039240752] [2022-03-01 15:52:46,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:52:46,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 15:52:46,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:46,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 15:52:46,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-03-01 15:52:46,607 INFO L87 Difference]: Start difference. First operand 32426 states and 135635 transitions. Second operand has 23 states, 23 states have (on average 12.73913043478261) internal successors, (293), 23 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:52:50,089 INFO L93 Difference]: Finished difference Result 262615 states and 1127592 transitions. [2022-03-01 15:52:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-01 15:52:50,090 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 12.73913043478261) internal successors, (293), 23 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:52:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:52:50,988 INFO L225 Difference]: With dead ends: 262615 [2022-03-01 15:52:50,988 INFO L226 Difference]: Without dead ends: 118025 [2022-03-01 15:52:50,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1111, Invalid=3445, Unknown=0, NotChecked=0, Total=4556 [2022-03-01 15:52:50,989 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 1694 mSDsluCounter, 3788 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 3823 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:52:50,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1694 Valid, 3823 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 15:52:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118025 states. [2022-03-01 15:52:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118025 to 36452. [2022-03-01 15:52:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36452 states, 36451 states have (on average 4.1564017448080985) internal successors, (151505), 36451 states have internal predecessors, (151505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36452 states to 36452 states and 151505 transitions. [2022-03-01 15:52:53,247 INFO L78 Accepts]: Start accepts. Automaton has 36452 states and 151505 transitions. Word has length 143 [2022-03-01 15:52:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:52:53,247 INFO L470 AbstractCegarLoop]: Abstraction has 36452 states and 151505 transitions. [2022-03-01 15:52:53,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.73913043478261) internal successors, (293), 23 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:52:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 36452 states and 151505 transitions. [2022-03-01 15:52:53,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:52:53,683 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:52:53,683 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:52:53,700 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-01 15:52:53,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:53,884 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:52:53,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:52:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash 627705186, now seen corresponding path program 6 times [2022-03-01 15:52:53,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:52:53,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702389950] [2022-03-01 15:52:53,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:52:53,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:52:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:52:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:54,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:52:54,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702389950] [2022-03-01 15:52:54,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702389950] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:52:54,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680987373] [2022-03-01 15:52:54,207 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:52:54,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:52:54,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:52:54,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:52:54,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-01 15:52:54,316 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:52:54,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:52:54,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-01 15:52:54,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:52:54,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:52:54,372 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 15:52:54,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-01 15:52:54,427 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:52:54,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:52:54,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-01 15:52:54,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-01 15:52:54,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-03-01 15:52:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:52:54,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:52:55,213 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_392 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_392) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 2))) (<= 2147483647 c_~max~0)) is different from false [2022-03-01 15:52:55,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-03-01 15:52:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-01 15:52:55,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680987373] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:52:55,433 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:52:55,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 42 [2022-03-01 15:52:55,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453353235] [2022-03-01 15:52:55,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:52:55,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-01 15:52:55,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:52:55,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-01 15:52:55,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1451, Unknown=1, NotChecked=78, Total=1722 [2022-03-01 15:52:55,436 INFO L87 Difference]: Start difference. First operand 36452 states and 151505 transitions. Second operand has 42 states, 42 states have (on average 8.333333333333334) internal successors, (350), 42 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:00,474 INFO L93 Difference]: Finished difference Result 255878 states and 1090627 transitions. [2022-03-01 15:53:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-01 15:53:00,475 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 8.333333333333334) internal successors, (350), 42 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:53:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:01,713 INFO L225 Difference]: With dead ends: 255878 [2022-03-01 15:53:01,713 INFO L226 Difference]: Without dead ends: 178885 [2022-03-01 15:53:01,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 277 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1725, Invalid=7020, Unknown=1, NotChecked=184, Total=8930 [2022-03-01 15:53:01,715 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 2623 mSDsluCounter, 5672 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2623 SdHoareTripleChecker+Valid, 5605 SdHoareTripleChecker+Invalid, 2662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 995 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:01,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2623 Valid, 5605 Invalid, 2662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1545 Invalid, 0 Unknown, 995 Unchecked, 0.7s Time] [2022-03-01 15:53:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178885 states. [2022-03-01 15:53:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178885 to 36165. [2022-03-01 15:53:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36165 states, 36164 states have (on average 4.155375511558456) internal successors, (150275), 36164 states have internal predecessors, (150275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36165 states to 36165 states and 150275 transitions. [2022-03-01 15:53:04,716 INFO L78 Accepts]: Start accepts. Automaton has 36165 states and 150275 transitions. Word has length 143 [2022-03-01 15:53:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:04,716 INFO L470 AbstractCegarLoop]: Abstraction has 36165 states and 150275 transitions. [2022-03-01 15:53:04,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 8.333333333333334) internal successors, (350), 42 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 36165 states and 150275 transitions. [2022-03-01 15:53:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:53:04,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:04,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:53:04,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-01 15:53:05,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:05,004 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash 296544674, now seen corresponding path program 7 times [2022-03-01 15:53:05,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:05,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817260988] [2022-03-01 15:53:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:05,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:05,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817260988] [2022-03-01 15:53:05,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817260988] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:05,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652266881] [2022-03-01 15:53:05,697 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 15:53:05,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:05,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:05,698 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:53:05,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-01 15:53:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:05,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-01 15:53:05,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:06,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:53:06,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-01 15:53:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-01 15:53:06,132 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:53:06,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 63 treesize of output 43 [2022-03-01 15:53:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:06,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:09,531 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_441 Int) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_439 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_439) c_~A~0.base))) (let ((.cse0 (select (store .cse1 c_~A~0.offset v_ArrVal_441) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< v_ArrVal_441 .cse0) (<= .cse0 (+ c_~max~0 1)) (not (<= (+ v_ArrVal_441 1) (select .cse1 c_~A~0.offset))))))) (<= 2147483647 c_~max~0)) is different from false [2022-03-01 15:53:09,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2022-03-01 15:53:09,641 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:53:09,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 88 [2022-03-01 15:53:09,650 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:53:09,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 119 [2022-03-01 15:53:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-01 15:53:09,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652266881] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:09,922 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:09,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 40 [2022-03-01 15:53:09,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102050216] [2022-03-01 15:53:09,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:09,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-01 15:53:09,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:09,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-01 15:53:09,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1341, Unknown=5, NotChecked=74, Total=1560 [2022-03-01 15:53:09,923 INFO L87 Difference]: Start difference. First operand 36165 states and 150275 transitions. Second operand has 40 states, 40 states have (on average 8.05) internal successors, (322), 40 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:12,457 INFO L93 Difference]: Finished difference Result 121880 states and 520157 transitions. [2022-03-01 15:53:12,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-01 15:53:12,457 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 8.05) internal successors, (322), 40 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:53:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:12,792 INFO L225 Difference]: With dead ends: 121880 [2022-03-01 15:53:12,792 INFO L226 Difference]: Without dead ends: 81564 [2022-03-01 15:53:12,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 270 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=804, Invalid=3887, Unknown=5, NotChecked=134, Total=4830 [2022-03-01 15:53:12,793 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 1948 mSDsluCounter, 4486 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1948 SdHoareTripleChecker+Valid, 4505 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 474 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:12,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1948 Valid, 4505 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1092 Invalid, 0 Unknown, 474 Unchecked, 0.4s Time] [2022-03-01 15:53:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81564 states. [2022-03-01 15:53:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81564 to 35905. [2022-03-01 15:53:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35905 states, 35904 states have (on average 4.15371546345811) internal successors, (149135), 35904 states have internal predecessors, (149135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35905 states to 35905 states and 149135 transitions. [2022-03-01 15:53:14,824 INFO L78 Accepts]: Start accepts. Automaton has 35905 states and 149135 transitions. Word has length 143 [2022-03-01 15:53:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:14,824 INFO L470 AbstractCegarLoop]: Abstraction has 35905 states and 149135 transitions. [2022-03-01 15:53:14,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 8.05) internal successors, (322), 40 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 35905 states and 149135 transitions. [2022-03-01 15:53:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:53:14,911 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:14,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:53:14,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-01 15:53:15,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-01 15:53:15,128 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:15,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash 929095160, now seen corresponding path program 8 times [2022-03-01 15:53:15,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:15,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292791343] [2022-03-01 15:53:15,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:15,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:15,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:15,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292791343] [2022-03-01 15:53:15,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292791343] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:15,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026024417] [2022-03-01 15:53:15,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:53:15,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:15,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:15,734 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:53:15,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-01 15:53:15,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:53:15,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:53:15,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-01 15:53:15,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:15,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:53:15,918 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-01 15:53:15,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-01 15:53:16,141 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-01 15:53:16,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:53:16,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-01 15:53:16,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-03-01 15:53:16,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-01 15:53:16,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 17 treesize of output 9 [2022-03-01 15:53:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:53:16,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:17,109 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)))) is different from false [2022-03-01 15:53:17,157 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (or (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 .cse1 v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (not (<= (+ v_ArrVal_489 1) (select .cse0 .cse1))))))) is different from false [2022-03-01 15:53:17,176 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (or (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (not (<= (+ v_ArrVal_489 1) (select .cse0 c_~A~0.offset))))))) is different from false [2022-03-01 15:53:17,197 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_488))) (let ((.cse0 (select .cse1 c_~A~0.base))) (or (not (<= (+ v_ArrVal_489 1) (select .cse0 c_~A~0.offset))) (<= (select (select (store (store .cse1 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))))))) is different from false [2022-03-01 15:53:17,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 81 [2022-03-01 15:53:17,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-03-01 15:53:17,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-03-01 15:53:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-01 15:53:17,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026024417] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:17,560 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:17,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 45 [2022-03-01 15:53:17,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060090678] [2022-03-01 15:53:17,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:17,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-01 15:53:17,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:17,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-01 15:53:17,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1498, Unknown=4, NotChecked=324, Total=1980 [2022-03-01 15:53:17,561 INFO L87 Difference]: Start difference. First operand 35905 states and 149135 transitions. Second operand has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:22,579 INFO L93 Difference]: Finished difference Result 210464 states and 905661 transitions. [2022-03-01 15:53:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-01 15:53:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:53:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:23,416 INFO L225 Difference]: With dead ends: 210464 [2022-03-01 15:53:23,416 INFO L226 Difference]: Without dead ends: 107528 [2022-03-01 15:53:23,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 262 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1826, Invalid=6196, Unknown=4, NotChecked=716, Total=8742 [2022-03-01 15:53:23,417 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 2995 mSDsluCounter, 6823 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2995 SdHoareTripleChecker+Valid, 6777 SdHoareTripleChecker+Invalid, 5204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2706 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:23,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2995 Valid, 6777 Invalid, 5204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2359 Invalid, 0 Unknown, 2706 Unchecked, 1.2s Time] [2022-03-01 15:53:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107528 states. [2022-03-01 15:53:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107528 to 30968. [2022-03-01 15:53:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30968 states, 30967 states have (on average 4.143798236832757) internal successors, (128321), 30967 states have internal predecessors, (128321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30968 states to 30968 states and 128321 transitions. [2022-03-01 15:53:25,259 INFO L78 Accepts]: Start accepts. Automaton has 30968 states and 128321 transitions. Word has length 143 [2022-03-01 15:53:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:25,259 INFO L470 AbstractCegarLoop]: Abstraction has 30968 states and 128321 transitions. [2022-03-01 15:53:25,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 30968 states and 128321 transitions. [2022-03-01 15:53:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-01 15:53:25,331 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:25,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:53:25,348 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-01 15:53:25,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-01 15:53:25,548 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:25,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1049396362, now seen corresponding path program 9 times [2022-03-01 15:53:25,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:25,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935951733] [2022-03-01 15:53:25,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:25,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-01 15:53:25,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:25,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935951733] [2022-03-01 15:53:25,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935951733] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:25,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425213523] [2022-03-01 15:53:25,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:53:25,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:25,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:25,611 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:53:25,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-01 15:53:25,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:53:25,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:53:25,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-01 15:53:25,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-01 15:53:25,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-01 15:53:26,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425213523] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:26,168 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:26,168 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-03-01 15:53:26,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748646256] [2022-03-01 15:53:26,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:26,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 15:53:26,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:26,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 15:53:26,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-01 15:53:26,170 INFO L87 Difference]: Start difference. First operand 30968 states and 128321 transitions. Second operand has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:26,751 INFO L93 Difference]: Finished difference Result 41375 states and 173574 transitions. [2022-03-01 15:53:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 15:53:26,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-03-01 15:53:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:26,838 INFO L225 Difference]: With dead ends: 41375 [2022-03-01 15:53:26,838 INFO L226 Difference]: Without dead ends: 24774 [2022-03-01 15:53:26,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-03-01 15:53:26,838 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 42 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:26,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 890 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:53:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24774 states. [2022-03-01 15:53:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24774 to 24764. [2022-03-01 15:53:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24764 states, 24763 states have (on average 4.126277106974115) internal successors, (102179), 24763 states have internal predecessors, (102179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24764 states to 24764 states and 102179 transitions. [2022-03-01 15:53:27,513 INFO L78 Accepts]: Start accepts. Automaton has 24764 states and 102179 transitions. Word has length 143 [2022-03-01 15:53:27,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:27,513 INFO L470 AbstractCegarLoop]: Abstraction has 24764 states and 102179 transitions. [2022-03-01 15:53:27,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 24764 states and 102179 transitions. [2022-03-01 15:53:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-01 15:53:27,567 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:27,567 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:53:27,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-01 15:53:27,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-01 15:53:27,783 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:27,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash 225436057, now seen corresponding path program 10 times [2022-03-01 15:53:27,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:27,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200749674] [2022-03-01 15:53:27,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:27,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:53:27,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:27,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200749674] [2022-03-01 15:53:27,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200749674] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:27,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943089618] [2022-03-01 15:53:27,902 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 15:53:27,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:27,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:27,903 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:53:27,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-01 15:53:28,000 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 15:53:28,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:53:28,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-01 15:53:28,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:53:28,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:53:28,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943089618] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:28,470 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:28,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-03-01 15:53:28,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61031510] [2022-03-01 15:53:28,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:28,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-01 15:53:28,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:28,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-01 15:53:28,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-03-01 15:53:28,471 INFO L87 Difference]: Start difference. First operand 24764 states and 102179 transitions. Second operand has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:29,082 INFO L93 Difference]: Finished difference Result 26364 states and 106354 transitions. [2022-03-01 15:53:29,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 15:53:29,082 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-03-01 15:53:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:29,167 INFO L225 Difference]: With dead ends: 26364 [2022-03-01 15:53:29,167 INFO L226 Difference]: Without dead ends: 24776 [2022-03-01 15:53:29,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=305, Invalid=955, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 15:53:29,169 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 988 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:29,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [988 Valid, 1819 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 15:53:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24776 states. [2022-03-01 15:53:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24776 to 24771. [2022-03-01 15:53:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24771 states, 24770 states have (on average 4.125393621316108) internal successors, (102186), 24770 states have internal predecessors, (102186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24771 states to 24771 states and 102186 transitions. [2022-03-01 15:53:29,840 INFO L78 Accepts]: Start accepts. Automaton has 24771 states and 102186 transitions. Word has length 148 [2022-03-01 15:53:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:29,840 INFO L470 AbstractCegarLoop]: Abstraction has 24771 states and 102186 transitions. [2022-03-01 15:53:29,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24771 states and 102186 transitions. [2022-03-01 15:53:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-03-01 15:53:29,894 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:29,895 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:53:29,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-01 15:53:30,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-01 15:53:30,123 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:30,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash 174308802, now seen corresponding path program 11 times [2022-03-01 15:53:30,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:30,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845051761] [2022-03-01 15:53:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:30,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-01 15:53:30,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:30,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845051761] [2022-03-01 15:53:30,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845051761] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:30,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056215620] [2022-03-01 15:53:30,233 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 15:53:30,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:30,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:30,234 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:53:30,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-01 15:53:30,346 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-01 15:53:30,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:53:30,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 15:53:30,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-01 15:53:30,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-01 15:53:30,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056215620] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:30,734 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:30,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-03-01 15:53:30,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076048236] [2022-03-01 15:53:30,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:30,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-01 15:53:30,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-01 15:53:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-03-01 15:53:30,735 INFO L87 Difference]: Start difference. First operand 24771 states and 102186 transitions. Second operand has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:31,668 INFO L93 Difference]: Finished difference Result 40910 states and 170712 transitions. [2022-03-01 15:53:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 15:53:31,669 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-03-01 15:53:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:31,816 INFO L225 Difference]: With dead ends: 40910 [2022-03-01 15:53:31,816 INFO L226 Difference]: Without dead ends: 40910 [2022-03-01 15:53:31,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 15:53:31,817 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 1011 mSDsluCounter, 2956 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:31,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1011 Valid, 2870 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 15:53:31,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40910 states. [2022-03-01 15:53:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40910 to 34779. [2022-03-01 15:53:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34779 states, 34778 states have (on average 4.162574041060441) internal successors, (144766), 34778 states have internal predecessors, (144766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34779 states to 34779 states and 144766 transitions. [2022-03-01 15:53:33,016 INFO L78 Accepts]: Start accepts. Automaton has 34779 states and 144766 transitions. Word has length 155 [2022-03-01 15:53:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:33,016 INFO L470 AbstractCegarLoop]: Abstraction has 34779 states and 144766 transitions. [2022-03-01 15:53:33,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 34779 states and 144766 transitions. [2022-03-01 15:53:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-01 15:53:33,092 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:33,092 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:53:33,109 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-01 15:53:33,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-01 15:53:33,309 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:33,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1506013595, now seen corresponding path program 12 times [2022-03-01 15:53:33,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:33,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114616472] [2022-03-01 15:53:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:53:33,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:33,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114616472] [2022-03-01 15:53:33,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114616472] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:33,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853271159] [2022-03-01 15:53:33,395 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-01 15:53:33,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:33,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:33,397 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:53:33,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-01 15:53:33,528 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-01 15:53:33,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:53:33,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 15:53:33,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-01 15:53:33,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-01 15:53:33,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853271159] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:53:33,989 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:53:33,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-03-01 15:53:33,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957719388] [2022-03-01 15:53:33,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:53:33,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-01 15:53:33,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:53:33,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-01 15:53:33,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-03-01 15:53:33,990 INFO L87 Difference]: Start difference. First operand 34779 states and 144766 transitions. Second operand has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:53:35,159 INFO L93 Difference]: Finished difference Result 59610 states and 250107 transitions. [2022-03-01 15:53:35,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-01 15:53:35,160 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-03-01 15:53:35,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:53:35,383 INFO L225 Difference]: With dead ends: 59610 [2022-03-01 15:53:35,383 INFO L226 Difference]: Without dead ends: 59610 [2022-03-01 15:53:35,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-03-01 15:53:35,384 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 902 mSDsluCounter, 2101 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:53:35,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [902 Valid, 2107 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 15:53:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59610 states. [2022-03-01 15:53:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59610 to 49659. [2022-03-01 15:53:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49659 states, 49658 states have (on average 4.2040758790124455) internal successors, (208766), 49658 states have internal predecessors, (208766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49659 states to 49659 states and 208766 transitions. [2022-03-01 15:53:37,131 INFO L78 Accepts]: Start accepts. Automaton has 49659 states and 208766 transitions. Word has length 160 [2022-03-01 15:53:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:53:37,131 INFO L470 AbstractCegarLoop]: Abstraction has 49659 states and 208766 transitions. [2022-03-01 15:53:37,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:53:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 49659 states and 208766 transitions. [2022-03-01 15:53:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-03-01 15:53:37,255 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:53:37,255 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:53:37,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-01 15:53:37,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-01 15:53:37,472 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:53:37,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:53:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1462933140, now seen corresponding path program 13 times [2022-03-01 15:53:37,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:53:37,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429795817] [2022-03-01 15:53:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:53:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:53:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-01 15:53:37,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:53:37,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429795817] [2022-03-01 15:53:37,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429795817] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:53:37,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256277806] [2022-03-01 15:53:37,822 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-01 15:53:37,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:53:37,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:53:37,823 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:53:37,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-01 15:53:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:53:37,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-01 15:53:37,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:53:37,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:53:37,996 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 15:53:37,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-01 15:53:38,028 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 15:53:38,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-03-01 15:53:38,273 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-01 15:53:38,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-03-01 15:53:38,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-03-01 15:53:38,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:53:38,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-03-01 15:53:38,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:53:38,795 INFO L353 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2022-03-01 15:53:38,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 65 [2022-03-01 15:53:38,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:53:38,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-03-01 15:53:38,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-03-01 15:53:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-03-01 15:53:39,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:53:41,477 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))))) is different from false [2022-03-01 15:53:51,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_746 1))) (<= c_~min~0 (+ .cse0 1)) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1))))) is different from false [2022-03-01 15:53:51,211 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_746 1))) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2022-03-01 15:53:52,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse2 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 (+ .cse0 1)))) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse2 c_~A~0.offset) (+ v_ArrVal_746 1))))))) is different from false [2022-03-01 15:53:55,776 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse8 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse6 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse2 (+ .cse0 1)) (.cse3 (< c_~min~0 .cse6))) (and (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 .cse2))) (not .cse3)) (or (and (forall ((v_subst_2 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse5 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (< (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) .cse5) (<= .cse5 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1)))))) (or (<= .cse6 .cse2) (forall ((v_subst_1 Int)) (not (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (< (select .cse7 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) (select .cse7 (+ c_~A~0.offset (* 4 v_subst_1))))))))) .cse3)))) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse8 c_~A~0.offset) (+ v_ArrVal_746 1))))))) is different from false [2022-03-01 15:53:58,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse8 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (+ .cse0 1)) (.cse3 (< c_~min~0 .cse4))) (and (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 .cse2))) (not .cse3)) (or (and (or (<= .cse4 .cse2) (forall ((v_subst_1 Int)) (not (let ((.cse5 (select |c_#memory_int| c_~A~0.base))) (< (select .cse5 c_~A~0.offset) (select .cse5 (+ c_~A~0.offset (* 4 v_subst_1)))))))) (forall ((v_subst_2 Int)) (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (let ((.cse6 (select .cse7 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (<= .cse6 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1)) (< (select .cse7 c_~A~0.offset) .cse6)))))) .cse3)))) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse8 c_~A~0.offset) (+ v_ArrVal_746 1))))))) is different from false [2022-03-01 15:53:59,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 880 treesize of output 824 [2022-03-01 15:53:59,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 980 treesize of output 972 [2022-03-01 15:53:59,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1050 treesize of output 1046 [2022-03-01 15:53:59,941 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:53:59,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1124 treesize of output 1016 [2022-03-01 15:54:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 8 not checked. [2022-03-01 15:54:00,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256277806] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:54:00,999 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:54:01,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 24] total 61 [2022-03-01 15:54:01,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954808955] [2022-03-01 15:54:01,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:54:01,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-01 15:54:01,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:54:01,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-01 15:54:01,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2725, Unknown=16, NotChecked=666, Total=3660 [2022-03-01 15:54:01,003 INFO L87 Difference]: Start difference. First operand 49659 states and 208766 transitions. Second operand has 61 states, 61 states have (on average 6.704918032786885) internal successors, (409), 61 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:54:04,001 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ .cse0 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 c_~min~0) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse1 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1))))))))) is different from false [2022-03-01 15:54:06,122 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ .cse0 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 c_~min~0) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse1 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1))))))))) is different from false [2022-03-01 15:54:08,324 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (<= 1 |c_thread3Thread1of1ForFork3_~i~2#1|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)))))))) is different from false [2022-03-01 15:54:10,404 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (<= 1 |c_thread3Thread1of1ForFork3_~i~2#1|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (<= c_~min~0 (+ c_~max~0 1)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)))))))) is different from false [2022-03-01 15:54:12,555 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (and (<= c_~min~0 (+ (select .cse0 .cse1) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse2 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse2) (<= c_~min~0 (+ .cse2 1))))))))) is different from false [2022-03-01 15:54:14,966 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (and (<= c_~min~0 (+ (select .cse0 .cse1) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (= .cse1 0) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse2 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse2) (<= c_~min~0 (+ .cse2 1))))))))) is different from false [2022-03-01 15:54:17,177 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (= c_~v_assert~0 1) (<= 1 |c_thread3Thread1of1ForFork3_~i~2#1|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (<= c_~min~0 (+ c_~max~0 1)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)))))))) is different from false [2022-03-01 15:54:19,576 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (and (<= c_~min~0 (+ (select .cse0 .cse1) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse2 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse2) (<= c_~min~0 (+ .cse2 1))))))))) is different from false [2022-03-01 15:55:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:55:14,025 INFO L93 Difference]: Finished difference Result 594963 states and 2543856 transitions. [2022-03-01 15:55:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-01 15:55:14,025 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 6.704918032786885) internal successors, (409), 61 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-03-01 15:55:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:55:19,275 INFO L225 Difference]: With dead ends: 594963 [2022-03-01 15:55:19,276 INFO L226 Difference]: Without dead ends: 460115 [2022-03-01 15:55:19,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 321 SyntacticMatches, 13 SemanticMatches, 115 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 3169 ImplicationChecksByTransitivity, 77.1s TimeCoverageRelationStatistics Valid=1112, Invalid=9394, Unknown=56, NotChecked=3010, Total=13572 [2022-03-01 15:55:19,285 INFO L933 BasicCegarLoop]: 473 mSDtfsCounter, 2490 mSDsluCounter, 16260 mSDsCounter, 0 mSdLazyCounter, 4116 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2490 SdHoareTripleChecker+Valid, 15171 SdHoareTripleChecker+Invalid, 12439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 4116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8236 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:55:19,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2490 Valid, 15171 Invalid, 12439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 4116 Invalid, 0 Unknown, 8236 Unchecked, 1.7s Time] [2022-03-01 15:55:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460115 states. [2022-03-01 15:55:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460115 to 59569. [2022-03-01 15:55:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59569 states, 59568 states have (on average 4.063876578028472) internal successors, (242077), 59568 states have internal predecessors, (242077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:55:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59569 states to 59569 states and 242077 transitions. [2022-03-01 15:55:29,692 INFO L78 Accepts]: Start accepts. Automaton has 59569 states and 242077 transitions. Word has length 165 [2022-03-01 15:55:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:55:29,692 INFO L470 AbstractCegarLoop]: Abstraction has 59569 states and 242077 transitions. [2022-03-01 15:55:29,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 6.704918032786885) internal successors, (409), 61 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:55:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 59569 states and 242077 transitions. [2022-03-01 15:55:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-03-01 15:55:29,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:55:29,838 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:55:29,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-01 15:55:30,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:55:30,052 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:55:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:55:30,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1708599012, now seen corresponding path program 14 times [2022-03-01 15:55:30,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:55:30,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120095972] [2022-03-01 15:55:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:55:30,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:55:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:55:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-03-01 15:55:30,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:55:30,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120095972] [2022-03-01 15:55:30,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120095972] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:55:30,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848018866] [2022-03-01 15:55:30,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:55:30,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:55:30,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:55:30,950 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:55:30,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-01 15:55:31,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:55:31,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:55:31,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-01 15:55:31,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:55:31,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:55:31,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-03-01 15:55:31,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:55:31,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-03-01 15:55:31,871 INFO L353 Elim1Store]: treesize reduction 84, result has 29.4 percent of original size [2022-03-01 15:55:31,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 58 [2022-03-01 15:55:32,006 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-03-01 15:55:32,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-03-01 15:55:32,046 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:55:32,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-03-01 15:55:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:55:32,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:55:35,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (or (forall ((thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int)) (let ((.cse1 (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (< .cse0 (select .cse1 c_~A~0.offset)) (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0))))) (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_59|)))) is different from false [2022-03-01 15:55:46,643 WARN L838 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse3 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse1 (store (store .cse2 .cse3 v_ArrVal_803) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (< .cse0 (select .cse1 c_~A~0.offset)) (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| (+ |c_thread3Thread1of1ForFork3_~i~2#1| 1)) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse2 .cse3) (+ v_ArrVal_803 1)))))))) is different from false [2022-03-01 15:55:51,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_802 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base))) (let ((.cse1 (store (store .cse2 c_~A~0.offset v_ArrVal_803) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (< .cse0 (select .cse1 c_~A~0.offset)) (not (<= (select .cse2 c_~A~0.offset) (+ v_ArrVal_803 1))) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| 1)))))) is different from false [2022-03-01 15:55:51,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base))) (let ((.cse1 (store (store .cse2 c_~A~0.offset v_ArrVal_803) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (< .cse0 (select .cse1 c_~A~0.offset)) (not (<= (select .cse2 c_~A~0.offset) (+ v_ArrVal_803 1))) (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| 1)))))) is different from false [2022-03-01 15:55:52,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base))) (let ((.cse1 (store (store .cse2 c_~A~0.offset v_ArrVal_803) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (< .cse0 (select .cse1 c_~A~0.offset)) (not (<= (select .cse2 c_~A~0.offset) (+ v_ArrVal_803 1))) (and (or (<= c_~min~0 (+ .cse0 1)) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse3) (<= .cse3 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) c_~A~0.offset v_ArrVal_803) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805) (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))) 1)))))) (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| 1)))))) is different from false [2022-03-01 15:55:57,716 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base))) (let ((.cse1 (store (store .cse9 c_~A~0.offset v_ArrVal_803) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (< .cse0 (select .cse1 c_~A~0.offset)) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse2 (< c_~min~0 .cse3)) (.cse4 (+ .cse0 1))) (and (or .cse2 (and (or (<= .cse3 .cse4) (forall ((v_subst_4 Int)) (not (let ((.cse5 (select |c_#memory_int| c_~A~0.base))) (< (select .cse5 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) (select .cse5 (+ c_~A~0.offset (* 4 v_subst_4)))))))) (forall ((v_subst_3 Int)) (let ((.cse6 (select |c_#memory_int| c_~A~0.base))) (let ((.cse7 (select .cse6 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< (select .cse6 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) .cse7) (<= .cse7 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) c_~A~0.offset v_ArrVal_803) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805) (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))) 1)))))))) (or (not .cse2) (and (or (<= c_~min~0 .cse4) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse8 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse8) (<= .cse8 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) c_~A~0.offset v_ArrVal_803) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805) (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))) 1)))))))))) (not (<= (select .cse9 c_~A~0.offset) (+ v_ArrVal_803 1))) (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| 1)))))) is different from false [2022-03-01 15:56:02,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int) (v_ArrVal_803 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base))) (let ((.cse8 (store (store .cse9 c_~A~0.offset v_ArrVal_803) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse7 (select .cse8 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (< c_~min~0 .cse3)) (.cse0 (+ .cse7 1))) (and (or (and (or (<= c_~min~0 .cse0) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) c_~A~0.offset v_ArrVal_803) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805) (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))) 1)))))) (not .cse2)) (or .cse2 (and (or (<= .cse3 .cse0) (forall ((v_subst_4 Int)) (not (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (< (select .cse4 c_~A~0.offset) (select .cse4 (+ c_~A~0.offset (* 4 v_subst_4)))))))) (forall ((v_subst_3 Int)) (let ((.cse5 (select |c_#memory_int| c_~A~0.base))) (let ((.cse6 (select .cse5 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< (select .cse5 c_~A~0.offset) .cse6) (<= .cse6 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_802) c_~A~0.base) c_~A~0.offset v_ArrVal_803) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805) (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))) 1))))))))))) (< .cse7 (select .cse8 c_~A~0.offset)) (not (<= (select .cse9 c_~A~0.offset) (+ v_ArrVal_803 1))) (<= 2147483647 .cse7) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| 1)))))) is different from false [2022-03-01 15:56:04,864 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 641 treesize of output 605 [2022-03-01 15:56:04,876 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:56:04,876 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 955 treesize of output 935 [2022-03-01 15:56:04,913 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:56:04,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1775 treesize of output 1669 [2022-03-01 15:56:04,935 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:56:04,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2321 treesize of output 2269 [2022-03-01 15:56:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 11 not checked. [2022-03-01 15:56:28,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848018866] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:56:28,581 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:56:28,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 25] total 56 [2022-03-01 15:56:28,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271196059] [2022-03-01 15:56:28,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:56:28,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-01 15:56:28,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:56:28,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-01 15:56:28,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2132, Unknown=22, NotChecked=700, Total=3080 [2022-03-01 15:56:28,582 INFO L87 Difference]: Start difference. First operand 59569 states and 242077 transitions. Second operand has 56 states, 56 states have (on average 6.589285714285714) internal successors, (369), 56 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:56:31,651 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse3 (+ c_~A~0.base 1)) (.cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse6 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (< .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (or (forall ((thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int)) (let ((.cse5 (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse4 (select .cse5 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (< .cse4 (select .cse5 c_~A~0.offset)) (<= c_~min~0 (+ .cse4 1)) (<= 2147483647 .cse4))))) (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_59|)))) (<= .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (< .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-03-01 15:56:32,519 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.base 1)) (.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse3 (+ |c_#StackHeapBarrier| 1))) (and (< .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~min~0) (< .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse5 (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse4 (select .cse5 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (< .cse4 (select .cse5 c_~A~0.offset)) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| (+ |c_thread3Thread1of1ForFork3_~i~2#1| 1)) (<= c_~min~0 (+ .cse4 1)) (<= 2147483647 .cse4))))) (<= .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-03-01 15:56:34,525 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (or (forall ((thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int)) (let ((.cse2 (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (< .cse1 (select .cse2 c_~A~0.offset)) (<= c_~min~0 (+ .cse1 1)) (<= 2147483647 .cse1))))) (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_59|)))) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0))) is different from false [2022-03-01 15:56:36,532 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (or (forall ((thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int)) (let ((.cse2 (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (< .cse1 (select .cse2 c_~A~0.offset)) (<= c_~min~0 (+ .cse1 1)) (<= 2147483647 .cse1))))) (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_59|)))) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0))) is different from false [2022-03-01 15:56:37,211 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.base 1)) (.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse3 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (< .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse5 (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse4 (select .cse5 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (< .cse4 (select .cse5 c_~A~0.offset)) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| (+ |c_thread3Thread1of1ForFork3_~i~2#1| 1)) (<= c_~min~0 (+ .cse4 1)) (<= 2147483647 .cse4))))) (<= .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-03-01 15:56:38,212 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.base 1)) (.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse3 (+ |c_#StackHeapBarrier| 1))) (and (< .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_thread1Thread1of1ForFork0_~i~0 0) (= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~min~0) (< .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((thread2Thread1of1ForFork2_~i~1 Int) (v_ArrVal_805 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse5 (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_805))) (let ((.cse4 (select .cse5 (+ c_~A~0.offset (* thread2Thread1of1ForFork2_~i~1 4))))) (or (< .cse4 (select .cse5 c_~A~0.offset)) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| (+ |c_thread3Thread1of1ForFork3_~i~2#1| 1)) (<= c_~min~0 (+ .cse4 1)) (<= 2147483647 .cse4))))) (<= .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-03-01 15:56:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:56:42,591 INFO L93 Difference]: Finished difference Result 358916 states and 1498345 transitions. [2022-03-01 15:56:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-01 15:56:42,591 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 6.589285714285714) internal successors, (369), 56 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-03-01 15:56:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:56:44,270 INFO L225 Difference]: With dead ends: 358916 [2022-03-01 15:56:44,271 INFO L226 Difference]: Without dead ends: 260858 [2022-03-01 15:56:44,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 317 SyntacticMatches, 14 SemanticMatches, 91 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 1981 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=805, Invalid=5539, Unknown=28, NotChecked=2184, Total=8556 [2022-03-01 15:56:44,272 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 2166 mSDsluCounter, 7987 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 7285 SdHoareTripleChecker+Invalid, 7994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5806 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:56:44,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2166 Valid, 7285 Invalid, 7994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2103 Invalid, 0 Unknown, 5806 Unchecked, 0.9s Time] [2022-03-01 15:56:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260858 states. [2022-03-01 15:56:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260858 to 106002. [2022-03-01 15:56:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106002 states, 106001 states have (on average 3.9169913491382156) internal successors, (415205), 106001 states have internal predecessors, (415205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:56:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106002 states to 106002 states and 415205 transitions. [2022-03-01 15:56:50,611 INFO L78 Accepts]: Start accepts. Automaton has 106002 states and 415205 transitions. Word has length 165 [2022-03-01 15:56:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:56:50,611 INFO L470 AbstractCegarLoop]: Abstraction has 106002 states and 415205 transitions. [2022-03-01 15:56:50,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 6.589285714285714) internal successors, (369), 56 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:56:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 106002 states and 415205 transitions. [2022-03-01 15:56:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-03-01 15:56:50,899 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:56:50,899 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:56:50,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-01 15:56:51,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:56:51,115 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-01 15:56:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:56:51,116 INFO L85 PathProgramCache]: Analyzing trace with hash -919857504, now seen corresponding path program 15 times [2022-03-01 15:56:51,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:56:51,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502402548] [2022-03-01 15:56:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:56:51,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:56:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:56:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-01 15:56:51,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:56:51,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502402548] [2022-03-01 15:56:51,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502402548] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:56:51,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849933031] [2022-03-01 15:56:51,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:56:51,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:56:51,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:56:51,458 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-01 15:56:51,464 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-01 15:56:51,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-01 15:56:51,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:56:51,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-01 15:56:51,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:56:52,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:56:52,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-03-01 15:56:52,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:56:52,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-03-01 15:56:52,904 INFO L353 Elim1Store]: treesize reduction 24, result has 53.8 percent of original size [2022-03-01 15:56:52,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-03-01 15:56:52,963 INFO L353 Elim1Store]: treesize reduction 20, result has 54.5 percent of original size [2022-03-01 15:56:52,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 60 [2022-03-01 15:56:53,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:56:53,144 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:56:53,144 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 66 treesize of output 29 [2022-03-01 15:56:53,424 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 40 treesize of output 22 [2022-03-01 15:56:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-01 15:56:53,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:56:53,643 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 50 treesize of output 26 [2022-03-01 15:57:12,110 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_862 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_64| Int) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_864 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_862) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_64| 4)) v_ArrVal_864) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_862 1))) (<= |v_thread3Thread1of1ForFork3_~i~2#1_64| 0))))) is different from false [2022-03-01 15:57:15,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_862 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_64| Int) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_864 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_862) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_64| 4)) v_ArrVal_864) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_862 1))) (<= |v_thread3Thread1of1ForFork3_~i~2#1_64| 0))))) is different from false [2022-03-01 15:57:16,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_862 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_64| Int) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_864 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_862) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_64| 4)) v_ArrVal_864) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_862 1))) (and (or (<= c_~min~0 (+ .cse0 1)) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (<= .cse2 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) c_~A~0.base) c_~A~0.offset v_ArrVal_862) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_64| 4)) v_ArrVal_864) c_~A~0.offset) 1)) (< c_~min~0 .cse2))))) (<= |v_thread3Thread1of1ForFork3_~i~2#1_64| 0))))) is different from false [2022-03-01 15:57:19,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_862 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_64| Int) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_864 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) c_~A~0.base))) (let ((.cse7 (select (store (store .cse8 c_~A~0.offset v_ArrVal_862) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_64| 4)) v_ArrVal_864) c_~A~0.offset))) (or (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse0 (< c_~min~0 .cse2)) (.cse3 (+ .cse7 1))) (and (or .cse0 (and (or (forall ((v_subst_6 Int)) (not (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (< (select .cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) (select .cse1 (+ c_~A~0.offset (* 4 v_subst_6))))))) (<= .cse2 .cse3)) (forall ((v_subst_5 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse5 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_5))))) (or (< (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) .cse5) (<= .cse5 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) c_~A~0.base) c_~A~0.offset v_ArrVal_862) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_64| 4)) v_ArrVal_864) c_~A~0.offset) 1)))))))) (or (not .cse0) (and (or (<= c_~min~0 .cse3) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse6 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (<= .cse6 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) c_~A~0.base) c_~A~0.offset v_ArrVal_862) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_64| 4)) v_ArrVal_864) c_~A~0.offset) 1)) (< c_~min~0 .cse6))))))))) (<= 2147483647 .cse7) (not (<= (select .cse8 c_~A~0.offset) (+ v_ArrVal_862 1))) (<= |v_thread3Thread1of1ForFork3_~i~2#1_64| 0))))) is different from false [2022-03-01 15:57:22,725 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_862 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_64| Int) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_864 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) c_~A~0.base))) (let ((.cse7 (select (store (store .cse8 c_~A~0.offset v_ArrVal_862) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_64| 4)) v_ArrVal_864) c_~A~0.offset))) (or (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (< c_~min~0 .cse4)) (.cse5 (+ .cse7 1))) (and (or .cse0 (and (forall ((v_subst_5 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (select .cse1 (+ c_~A~0.offset (* 4 v_subst_5))))) (or (< (select .cse1 c_~A~0.offset) .cse2) (<= .cse2 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) c_~A~0.base) c_~A~0.offset v_ArrVal_862) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_64| 4)) v_ArrVal_864) c_~A~0.offset) 1)))))) (or (forall ((v_subst_6 Int)) (not (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (< (select .cse3 c_~A~0.offset) (select .cse3 (+ c_~A~0.offset (* 4 v_subst_6))))))) (<= .cse4 .cse5)))) (or (not .cse0) (and (or (<= c_~min~0 .cse5) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse6 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (<= .cse6 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) c_~A~0.base) c_~A~0.offset v_ArrVal_862) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_64| 4)) v_ArrVal_864) c_~A~0.offset) 1)) (< c_~min~0 .cse6))))))))) (<= 2147483647 .cse7) (not (<= (select .cse8 c_~A~0.offset) (+ v_ArrVal_862 1))) (<= |v_thread3Thread1of1ForFork3_~i~2#1_64| 0))))) is different from false [2022-03-01 15:57:24,318 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 436 treesize of output 404 [2022-03-01 15:57:24,321 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 443 treesize of output 441 [2022-03-01 15:57:24,325 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 519 treesize of output 515 [2022-03-01 15:57:24,341 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:57:24,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 554 treesize of output 512 [2022-03-01 15:57:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 7 not checked. [2022-03-01 15:57:25,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849933031] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:57:25,020 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:57:25,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 30, 30] total 69 [2022-03-01 15:57:25,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999585148] [2022-03-01 15:57:25,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:57:25,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-03-01 15:57:25,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-03-01 15:57:25,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3690, Unknown=16, NotChecked=640, Total=4692 [2022-03-01 15:57:25,021 INFO L87 Difference]: Start difference. First operand 106002 states and 415205 transitions. Second operand has 69 states, 69 states have (on average 5.318840579710145) internal successors, (367), 69 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:59:18,423 WARN L228 SmtUtils]: Spent 58.03s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-01 16:03:02,436 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (forall ((|thread3Thread1of1ForFork3_~i~2#1| Int)) (or (<= |thread3Thread1of1ForFork3_~i~2#1| 0) (forall ((v_ArrVal_864 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)) v_ArrVal_864) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or (<= c_~min~0 (+ .cse1 1)) (= (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|) 0)) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= c_~min~0 (+ c_~max~0 1)) (= .cse1 c_~max~0))) is different from false Received shutdown request... [2022-03-01 16:05:01,577 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 16:05:01,585 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-01 16:05:02,597 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-01 16:05:02,786 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-01 16:05:02,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-03-01 16:05:02,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2022-03-01 16:05:02,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 329 SyntacticMatches, 15 SemanticMatches, 315 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 38844 ImplicationChecksByTransitivity, 403.1s TimeCoverageRelationStatistics Valid=14391, Invalid=81882, Unknown=161, NotChecked=3738, Total=100172 [2022-03-01 16:05:02,821 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 5910 mSDsluCounter, 9960 mSDsCounter, 0 mSdLazyCounter, 3998 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5910 SdHoareTripleChecker+Valid, 9647 SdHoareTripleChecker+Invalid, 9559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 3998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4683 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:05:02,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5910 Valid, 9647 Invalid, 9559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 3998 Invalid, 0 Unknown, 4683 Unchecked, 2.3s Time] [2022-03-01 16:05:02,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-01 16:05:02,822 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:242) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-01 16:05:02,826 INFO L158 Benchmark]: Toolchain (without parser) took 809880.08ms. Allocated memory was 164.6MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 113.5MB in the beginning and 6.9GB in the end (delta: -6.8GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-03-01 16:05:02,826 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 164.6MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 16:05:02,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.20ms. Allocated memory was 164.6MB in the beginning and 198.2MB in the end (delta: 33.6MB). Free memory was 113.3MB in the beginning and 173.3MB in the end (delta: -60.0MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-03-01 16:05:02,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.24ms. Allocated memory is still 198.2MB. Free memory was 173.3MB in the beginning and 171.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 16:05:02,826 INFO L158 Benchmark]: Boogie Preprocessor took 23.47ms. Allocated memory is still 198.2MB. Free memory was 171.3MB in the beginning and 169.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-01 16:05:02,826 INFO L158 Benchmark]: RCFGBuilder took 431.65ms. Allocated memory is still 198.2MB. Free memory was 169.6MB in the beginning and 148.2MB in the end (delta: 21.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-03-01 16:05:02,826 INFO L158 Benchmark]: TraceAbstraction took 809185.69ms. Allocated memory was 198.2MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 147.6MB in the beginning and 6.9GB in the end (delta: -6.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-03-01 16:05:02,827 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 164.6MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.20ms. Allocated memory was 164.6MB in the beginning and 198.2MB in the end (delta: 33.6MB). Free memory was 113.3MB in the beginning and 173.3MB in the end (delta: -60.0MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.24ms. Allocated memory is still 198.2MB. Free memory was 173.3MB in the beginning and 171.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.47ms. Allocated memory is still 198.2MB. Free memory was 171.3MB in the beginning and 169.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 431.65ms. Allocated memory is still 198.2MB. Free memory was 169.6MB in the beginning and 148.2MB in the end (delta: 21.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 809185.69ms. Allocated memory was 198.2MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 147.6MB in the beginning and 6.9GB in the end (delta: -6.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown