/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a [2022-02-18 14:43:55,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-18 14:43:55,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-18 14:43:55,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-18 14:43:55,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-18 14:43:55,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-18 14:43:55,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-18 14:43:55,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-18 14:43:55,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-18 14:43:55,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-18 14:43:55,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-18 14:43:55,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-18 14:43:55,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-18 14:43:55,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-18 14:43:55,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-18 14:43:55,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-18 14:43:55,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-18 14:43:55,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-18 14:43:55,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-18 14:43:55,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-18 14:43:55,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-18 14:43:55,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-18 14:43:55,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-18 14:43:55,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-18 14:43:55,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-18 14:43:55,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-18 14:43:55,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-18 14:43:55,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-18 14:43:55,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-18 14:43:55,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-18 14:43:55,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-18 14:43:55,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-18 14:43:55,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-18 14:43:55,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-18 14:43:55,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-18 14:43:55,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-18 14:43:55,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-18 14:43:55,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-18 14:43:55,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-18 14:43:55,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-18 14:43:55,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-18 14:43:55,278 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-18 14:43:55,296 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-18 14:43:55,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-18 14:43:55,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-18 14:43:55,296 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-18 14:43:55,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-18 14:43:55,297 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-18 14:43:55,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-18 14:43:55,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-18 14:43:55,297 INFO L138 SettingsManager]: * Use SBE=true [2022-02-18 14:43:55,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-18 14:43:55,297 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-18 14:43:55,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-18 14:43:55,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-18 14:43:55,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-18 14:43:55,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-18 14:43:55,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-18 14:43:55,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-18 14:43:55,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-18 14:43:55,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-18 14:43:55,298 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-18 14:43:55,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-18 14:43:55,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-18 14:43:55,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-18 14:43:55,298 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-18 14:43:55,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-18 14:43:55,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-18 14:43:55,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-18 14:43:55,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-18 14:43:55,301 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-18 14:43:55,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-18 14:43:55,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-18 14:43:55,301 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-18 14:43:55,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-18 14:43:55,301 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-18 14:43:55,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-18 14:43:55,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-18 14:43:55,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-18 14:43:55,498 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-18 14:43:55,499 INFO L275 PluginConnector]: CDTParser initialized [2022-02-18 14:43:55,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-02-18 14:43:55,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9525bc5/f9036512b8614a8393bb1e2da192a1f8/FLAGce3cb1e2e [2022-02-18 14:43:55,892 INFO L306 CDTParser]: Found 1 translation units. [2022-02-18 14:43:55,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-02-18 14:43:55,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9525bc5/f9036512b8614a8393bb1e2da192a1f8/FLAGce3cb1e2e [2022-02-18 14:43:55,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9525bc5/f9036512b8614a8393bb1e2da192a1f8 [2022-02-18 14:43:55,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-18 14:43:55,920 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-18 14:43:55,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-18 14:43:55,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-18 14:43:55,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-18 14:43:55,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:43:55" (1/1) ... [2022-02-18 14:43:55,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6183453e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:55, skipping insertion in model container [2022-02-18 14:43:55,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 02:43:55" (1/1) ... [2022-02-18 14:43:55,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-18 14:43:55,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-18 14:43:56,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-02-18 14:43:56,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-18 14:43:56,167 INFO L203 MainTranslator]: Completed pre-run [2022-02-18 14:43:56,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-02-18 14:43:56,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-18 14:43:56,190 INFO L208 MainTranslator]: Completed translation [2022-02-18 14:43:56,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56 WrapperNode [2022-02-18 14:43:56,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-18 14:43:56,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-18 14:43:56,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-18 14:43:56,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-18 14:43:56,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56" (1/1) ... [2022-02-18 14:43:56,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56" (1/1) ... [2022-02-18 14:43:56,230 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-02-18 14:43:56,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-18 14:43:56,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-18 14:43:56,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-18 14:43:56,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-18 14:43:56,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56" (1/1) ... [2022-02-18 14:43:56,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56" (1/1) ... [2022-02-18 14:43:56,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56" (1/1) ... [2022-02-18 14:43:56,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56" (1/1) ... [2022-02-18 14:43:56,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56" (1/1) ... [2022-02-18 14:43:56,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56" (1/1) ... [2022-02-18 14:43:56,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56" (1/1) ... [2022-02-18 14:43:56,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-18 14:43:56,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-18 14:43:56,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-18 14:43:56,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-18 14:43:56,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56" (1/1) ... [2022-02-18 14:43:56,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-18 14:43:56,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:43:56,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-18 14:43:56,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-18 14:43:56,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-18 14:43:56,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-18 14:43:56,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-18 14:43:56,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-18 14:43:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-18 14:43:56,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-18 14:43:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-18 14:43:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-18 14:43:56,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-18 14:43:56,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-18 14:43:56,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-18 14:43:56,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-18 14:43:56,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-18 14:43:56,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-18 14:43:56,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-18 14:43:56,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-18 14:43:56,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-18 14:43:56,311 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-18 14:43:56,367 INFO L234 CfgBuilder]: Building ICFG [2022-02-18 14:43:56,367 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-18 14:43:56,598 INFO L275 CfgBuilder]: Performing block encoding [2022-02-18 14:43:56,640 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-18 14:43:56,640 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-18 14:43:56,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:43:56 BoogieIcfgContainer [2022-02-18 14:43:56,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-18 14:43:56,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-18 14:43:56,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-18 14:43:56,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-18 14:43:56,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 02:43:55" (1/3) ... [2022-02-18 14:43:56,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750f52b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:43:56, skipping insertion in model container [2022-02-18 14:43:56,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 02:43:56" (2/3) ... [2022-02-18 14:43:56,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750f52b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 02:43:56, skipping insertion in model container [2022-02-18 14:43:56,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 02:43:56" (3/3) ... [2022-02-18 14:43:56,647 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-02-18 14:43:56,650 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-18 14:43:56,650 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-18 14:43:56,650 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-18 14:43:56,650 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-18 14:43:56,691 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,692 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,692 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,692 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,692 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,693 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,693 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,693 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,694 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,694 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,694 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,694 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,695 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,695 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,695 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,695 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,695 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,695 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,695 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,695 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,696 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,696 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,696 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,696 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,696 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,696 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,696 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,697 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,697 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,697 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,697 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,697 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,697 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,697 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,697 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,698 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,698 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,698 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,698 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,698 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,698 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,699 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,699 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,699 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,699 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,699 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,699 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,699 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,699 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,700 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,700 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,700 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,700 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,700 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,700 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,700 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,701 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,701 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,701 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,701 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,701 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,701 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,701 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,701 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,702 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,702 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,702 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,702 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,702 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,702 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,703 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,703 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,703 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,705 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,706 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,706 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,706 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,707 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,710 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,711 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,711 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,714 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,720 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,721 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,721 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,722 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,722 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,722 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,722 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,722 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 14:43:56,725 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-02-18 14:43:56,755 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-18 14:43:56,761 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-02-18 14:43:56,762 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-18 14:43:56,775 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 159 transitions, 342 flow [2022-02-18 14:43:56,957 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-18 14:43:57,003 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:43:57,003 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] [2022-02-18 14:43:57,004 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-18 14:43:57,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:43:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2094363978, now seen corresponding path program 1 times [2022-02-18 14:43:57,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:43:57,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402651735] [2022-02-18 14:43:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:43:57,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:43:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:43:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:43:57,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:43:57,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402651735] [2022-02-18 14:43:57,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402651735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:43:57,224 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:43:57,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-18 14:43:57,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947057719] [2022-02-18 14:43:57,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:43:57,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-18 14:43:57,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:43:57,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-18 14:43:57,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-18 14:43:57,258 INFO L87 Difference]: Start difference. First operand has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 0 states have call successors, (0), 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 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:43:57,329 INFO L93 Difference]: Finished difference Result 3813 states and 13373 transitions. [2022-02-18 14:43:57,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-18 14:43:57,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-02-18 14:43:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:43:57,369 INFO L225 Difference]: With dead ends: 3813 [2022-02-18 14:43:57,369 INFO L226 Difference]: Without dead ends: 3809 [2022-02-18 14:43:57,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-18 14:43:57,372 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-18 14:43:57,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 14:43:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2022-02-18 14:43:57,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3809. [2022-02-18 14:43:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3809 states, 3808 states have (on average 3.510766806722689) internal successors, (13369), 3808 states have internal predecessors, (13369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 13369 transitions. [2022-02-18 14:43:57,569 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 13369 transitions. Word has length 109 [2022-02-18 14:43:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:43:57,569 INFO L470 AbstractCegarLoop]: Abstraction has 3809 states and 13369 transitions. [2022-02-18 14:43:57,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 13369 transitions. [2022-02-18 14:43:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-18 14:43:57,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:43:57,578 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] [2022-02-18 14:43:57,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-18 14:43:57,579 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-18 14:43:57,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:43:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2012101173, now seen corresponding path program 1 times [2022-02-18 14:43:57,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:43:57,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399986423] [2022-02-18 14:43:57,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:43:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:43:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:43:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:43:57,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:43:57,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399986423] [2022-02-18 14:43:57,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399986423] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:43:57,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:43:57,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-18 14:43:57,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856513071] [2022-02-18 14:43:57,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:43:57,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-18 14:43:57,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:43:57,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-18 14:43:57,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-18 14:43:57,734 INFO L87 Difference]: Start difference. First operand 3809 states and 13369 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:43:57,848 INFO L93 Difference]: Finished difference Result 7071 states and 25089 transitions. [2022-02-18 14:43:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-18 14:43:57,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-02-18 14:43:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:43:57,884 INFO L225 Difference]: With dead ends: 7071 [2022-02-18 14:43:57,884 INFO L226 Difference]: Without dead ends: 7071 [2022-02-18 14:43:57,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-18 14:43:57,886 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 181 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-18 14:43:57,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 212 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 14:43:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2022-02-18 14:43:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 4978. [2022-02-18 14:43:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4978 states, 4977 states have (on average 3.5173799477596948) internal successors, (17506), 4977 states have internal predecessors, (17506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 17506 transitions. [2022-02-18 14:43:58,076 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 17506 transitions. Word has length 109 [2022-02-18 14:43:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:43:58,078 INFO L470 AbstractCegarLoop]: Abstraction has 4978 states and 17506 transitions. [2022-02-18 14:43:58,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 17506 transitions. [2022-02-18 14:43:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-18 14:43:58,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:43:58,095 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] [2022-02-18 14:43:58,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-18 14:43:58,095 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-18 14:43:58,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:43:58,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1404457087, now seen corresponding path program 1 times [2022-02-18 14:43:58,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:43:58,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899276474] [2022-02-18 14:43:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:43:58,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:43:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:43:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:43:58,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:43:58,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899276474] [2022-02-18 14:43:58,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899276474] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:43:58,315 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 14:43:58,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-18 14:43:58,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299501813] [2022-02-18 14:43:58,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:43:58,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-18 14:43:58,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:43:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-18 14:43:58,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-02-18 14:43:58,317 INFO L87 Difference]: Start difference. First operand 4978 states and 17506 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:43:58,515 INFO L93 Difference]: Finished difference Result 4994 states and 17522 transitions. [2022-02-18 14:43:58,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-18 14:43:58,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-02-18 14:43:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:43:58,560 INFO L225 Difference]: With dead ends: 4994 [2022-02-18 14:43:58,560 INFO L226 Difference]: Without dead ends: 4984 [2022-02-18 14:43:58,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=59, Unknown=0, NotChecked=0, Total=110 [2022-02-18 14:43:58,561 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 249 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:43:58,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 379 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 14:43:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2022-02-18 14:43:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4979. [2022-02-18 14:43:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4979 states, 4978 states have (on average 3.5168742466854157) internal successors, (17507), 4978 states have internal predecessors, (17507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4979 states to 4979 states and 17507 transitions. [2022-02-18 14:43:58,696 INFO L78 Accepts]: Start accepts. Automaton has 4979 states and 17507 transitions. Word has length 109 [2022-02-18 14:43:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:43:58,696 INFO L470 AbstractCegarLoop]: Abstraction has 4979 states and 17507 transitions. [2022-02-18 14:43:58,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 17507 transitions. [2022-02-18 14:43:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-02-18 14:43:58,710 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:43:58,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 14:43:58,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-18 14:43:58,711 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-18 14:43:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:43:58,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1972009608, now seen corresponding path program 1 times [2022-02-18 14:43:58,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:43:58,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359546130] [2022-02-18 14:43:58,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:43:58,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:43:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:43:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:43:58,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:43:58,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359546130] [2022-02-18 14:43:58,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359546130] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:43:58,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822772944] [2022-02-18 14:43:58,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:43:58,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:43:58,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:43:58,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:43:58,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-18 14:43:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:43:58,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-18 14:43:58,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:43:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:43:59,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:43:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:43:59,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822772944] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-18 14:43:59,467 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-18 14:43:59,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-02-18 14:43:59,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27055691] [2022-02-18 14:43:59,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:43:59,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-18 14:43:59,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:43:59,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-18 14:43:59,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-02-18 14:43:59,471 INFO L87 Difference]: Start difference. First operand 4979 states and 17507 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:43:59,577 INFO L93 Difference]: Finished difference Result 5483 states and 19328 transitions. [2022-02-18 14:43:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-18 14:43:59,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-02-18 14:43:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:43:59,595 INFO L225 Difference]: With dead ends: 5483 [2022-02-18 14:43:59,596 INFO L226 Difference]: Without dead ends: 5483 [2022-02-18 14:43:59,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 224 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-02-18 14:43:59,597 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 190 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-18 14:43:59,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 383 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 14:43:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2022-02-18 14:43:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5483. [2022-02-18 14:43:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5483 states, 5482 states have (on average 3.5257205399489235) internal successors, (19328), 5482 states have internal predecessors, (19328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 19328 transitions. [2022-02-18 14:43:59,718 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 19328 transitions. Word has length 116 [2022-02-18 14:43:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:43:59,718 INFO L470 AbstractCegarLoop]: Abstraction has 5483 states and 19328 transitions. [2022-02-18 14:43:59,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:43:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 19328 transitions. [2022-02-18 14:43:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-18 14:43:59,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:43:59,763 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-02-18 14:43:59,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-18 14:43:59,963 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-02-18 14:43:59,964 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-18 14:43:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:43:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1653076207, now seen corresponding path program 1 times [2022-02-18 14:43:59,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:43:59,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695141839] [2022-02-18 14:43:59,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:43:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:43:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:44:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:44:00,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:44:00,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695141839] [2022-02-18 14:44:00,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695141839] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:44:00,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563712774] [2022-02-18 14:44:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:44:00,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:44:00,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:44:00,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:44:00,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-18 14:44:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:44:00,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-18 14:44:00,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:44:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:44:00,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:44:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:44:00,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563712774] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-18 14:44:00,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-18 14:44:00,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-02-18 14:44:00,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783985735] [2022-02-18 14:44:00,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:44:00,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-18 14:44:00,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:44:00,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-18 14:44:00,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-02-18 14:44:00,585 INFO L87 Difference]: Start difference. First operand 5483 states and 19328 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 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-02-18 14:44:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:44:00,802 INFO L93 Difference]: Finished difference Result 8369 states and 29751 transitions. [2022-02-18 14:44:00,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-18 14:44:00,803 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 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-02-18 14:44:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:44:00,831 INFO L225 Difference]: With dead ends: 8369 [2022-02-18 14:44:00,831 INFO L226 Difference]: Without dead ends: 8369 [2022-02-18 14:44:00,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2022-02-18 14:44:00,832 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 548 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:44:00,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 694 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 14:44:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2022-02-18 14:44:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 5615. [2022-02-18 14:44:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5615 states, 5614 states have (on average 3.521197007481297) internal successors, (19768), 5614 states have internal predecessors, (19768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:44:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 19768 transitions. [2022-02-18 14:44:01,007 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 19768 transitions. Word has length 121 [2022-02-18 14:44:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:44:01,008 INFO L470 AbstractCegarLoop]: Abstraction has 5615 states and 19768 transitions. [2022-02-18 14:44:01,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 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-02-18 14:44:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 19768 transitions. [2022-02-18 14:44:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-18 14:44:01,025 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:44:01,025 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-02-18 14:44:01,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-18 14:44:01,239 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-02-18 14:44:01,239 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-18 14:44:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:44:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1659282011, now seen corresponding path program 2 times [2022-02-18 14:44:01,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:44:01,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242446798] [2022-02-18 14:44:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:44:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:44:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:44:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:44:01,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:44:01,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242446798] [2022-02-18 14:44:01,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242446798] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:44:01,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669288246] [2022-02-18 14:44:01,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 14:44:01,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:44:01,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:44:01,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:44:01,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-18 14:44:01,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-18 14:44:01,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:44:01,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-18 14:44:01,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:44:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-18 14:44:01,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-18 14:44:01,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669288246] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 14:44:01,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-18 14:44:01,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-02-18 14:44:01,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463287127] [2022-02-18 14:44:01,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 14:44:01,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-18 14:44:01,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:44:01,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-18 14:44:01,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-02-18 14:44:01,752 INFO L87 Difference]: Start difference. First operand 5615 states and 19768 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-02-18 14:44:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:44:01,972 INFO L93 Difference]: Finished difference Result 5306 states and 18640 transitions. [2022-02-18 14:44:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-18 14:44:01,973 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-02-18 14:44:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:44:01,992 INFO L225 Difference]: With dead ends: 5306 [2022-02-18 14:44:01,992 INFO L226 Difference]: Without dead ends: 5306 [2022-02-18 14:44:01,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-02-18 14:44:01,993 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 192 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 14:44:01,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 412 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 14:44:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2022-02-18 14:44:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 4584. [2022-02-18 14:44:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 4583 states have (on average 3.5339297403447523) internal successors, (16196), 4583 states have internal predecessors, (16196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:44:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 16196 transitions. [2022-02-18 14:44:02,133 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 16196 transitions. Word has length 121 [2022-02-18 14:44:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:44:02,134 INFO L470 AbstractCegarLoop]: Abstraction has 4584 states and 16196 transitions. [2022-02-18 14:44:02,134 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-02-18 14:44:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 16196 transitions. [2022-02-18 14:44:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-18 14:44:02,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:44:02,145 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-02-18 14:44:02,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-18 14:44:02,345 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-02-18 14:44:02,346 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-18 14:44:02,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:44:02,346 INFO L85 PathProgramCache]: Analyzing trace with hash 611662898, now seen corresponding path program 1 times [2022-02-18 14:44:02,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:44:02,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33638026] [2022-02-18 14:44:02,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:44:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:44:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:44:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:44:03,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:44:03,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33638026] [2022-02-18 14:44:03,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33638026] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:44:03,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155842482] [2022-02-18 14:44:03,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:44:03,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:44:03,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:44:03,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:44:03,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-18 14:44:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:44:03,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-18 14:44:03,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:44:03,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-18 14:44:03,358 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-18 14:44:03,358 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-02-18 14:44:03,874 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-18 14:44:03,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-18 14:44:05,101 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 27 treesize of output 27 [2022-02-18 14:44:05,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:44:05,377 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 27 treesize of output 27 [2022-02-18 14:44:05,614 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:44:05,615 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 58 treesize of output 42 [2022-02-18 14:44:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:44:06,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:44:06,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_174 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse0) (not (< .cse0 c_~min3~0)) (not (< .cse0 c_~min2~0))))) (or (forall ((v_ArrVal_174 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-18 14:44:07,291 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (or (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0) (not (< .cse0 c_~min3~0)))))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-18 14:44:07,643 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:44:07,643 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 335 treesize of output 295 [2022-02-18 14:44:07,651 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 256 treesize of output 244 [2022-02-18 14:44:07,656 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 244 treesize of output 238 [2022-02-18 14:44:07,662 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 238 treesize of output 202 [2022-02-18 14:44:07,671 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 202 treesize of output 184 [2022-02-18 14:44:10,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-18 14:44:10,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-18 14:44:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-18 14:44:10,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155842482] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:44:10,927 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:44:10,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32, 33] total 83 [2022-02-18 14:44:10,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812580206] [2022-02-18 14:44:10,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:44:10,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-02-18 14:44:10,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:44:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-02-18 14:44:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=5661, Unknown=2, NotChecked=318, Total=6806 [2022-02-18 14:44:10,930 INFO L87 Difference]: Start difference. First operand 4584 states and 16196 transitions. Second operand has 83 states, 83 states have (on average 4.156626506024097) internal successors, (345), 83 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-02-18 14:44:14,487 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< (+ c_thread3Thread1of1ForFork1_~i~2 1) c_~N~0) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))))) (let ((.cse0 (< .cse1 c_~min3~0))) (and (or (not .cse0) (not (< .cse1 c_~min2~0)) (= c_~min1~0 .cse1)) (or .cse0 (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0))))))) (forall ((~M~0 Int)) (or (and (or (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0))) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse2 c_~min2~0)) (= c_~min1~0 .cse2) (not (< .cse2 c_~min3~0)))))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-02-18 14:44:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:44:19,475 INFO L93 Difference]: Finished difference Result 24010 states and 84293 transitions. [2022-02-18 14:44:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-02-18 14:44:19,475 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 4.156626506024097) internal successors, (345), 83 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 126 [2022-02-18 14:44:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:44:19,548 INFO L225 Difference]: With dead ends: 24010 [2022-02-18 14:44:19,548 INFO L226 Difference]: Without dead ends: 23992 [2022-02-18 14:44:19,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 198 SyntacticMatches, 10 SemanticMatches, 164 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3528, Invalid=22887, Unknown=3, NotChecked=972, Total=27390 [2022-02-18 14:44:19,553 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 4123 mSDsluCounter, 9498 mSDsCounter, 0 mSdLazyCounter, 4985 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4123 SdHoareTripleChecker+Valid, 8812 SdHoareTripleChecker+Invalid, 7688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 4985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2438 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-18 14:44:19,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4123 Valid, 8812 Invalid, 7688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 4985 Invalid, 0 Unknown, 2438 Unchecked, 2.5s Time] [2022-02-18 14:44:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23992 states. [2022-02-18 14:44:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23992 to 8543. [2022-02-18 14:44:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8543 states, 8542 states have (on average 3.5312573167876375) internal successors, (30164), 8542 states have internal predecessors, (30164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:44:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8543 states to 8543 states and 30164 transitions. [2022-02-18 14:44:19,885 INFO L78 Accepts]: Start accepts. Automaton has 8543 states and 30164 transitions. Word has length 126 [2022-02-18 14:44:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:44:19,885 INFO L470 AbstractCegarLoop]: Abstraction has 8543 states and 30164 transitions. [2022-02-18 14:44:19,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 4.156626506024097) internal successors, (345), 83 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-02-18 14:44:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 8543 states and 30164 transitions. [2022-02-18 14:44:19,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-18 14:44:19,907 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:44:19,907 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-02-18 14:44:19,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-18 14:44:20,123 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-02-18 14:44:20,123 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-18 14:44:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:44:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash 4018812, now seen corresponding path program 1 times [2022-02-18 14:44:20,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:44:20,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760881043] [2022-02-18 14:44:20,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:44:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:44:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:44:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:44:20,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:44:20,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760881043] [2022-02-18 14:44:20,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760881043] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:44:20,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577736420] [2022-02-18 14:44:20,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:44:20,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:44:20,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:44:20,993 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:44:20,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-18 14:44:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:44:21,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-18 14:44:21,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:44:21,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-18 14:44:21,165 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-18 14:44:21,165 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-02-18 14:44:21,217 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-18 14:44:21,217 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-02-18 14:44:21,813 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-18 14:44:21,813 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 18 treesize of output 18 [2022-02-18 14:44:22,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-18 14:44:22,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-18 14:44:22,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:44:22,948 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 35 treesize of output 33 [2022-02-18 14:44:23,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:44:23,298 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 35 treesize of output 33 [2022-02-18 14:44:23,514 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:44:23,514 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 69 treesize of output 45 [2022-02-18 14:44:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:44:24,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:44:26,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (and (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0)))) (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)) (< c_~min3~0 c_~min2~0))) (< 0 ~M~0) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (= c_~min2~0 c_~min1~0) .cse1) (or (not .cse1) (= c_~min2~0 .cse2))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-18 14:44:32,518 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0)))) (or (< c_~min3~0 c_~min2~0) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0)))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse2 (< .cse1 c_~min1~0))) (and (or (= c_~min2~0 .cse1) (not .cse2)) (or (= c_~min2~0 c_~min1~0) .cse2)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-18 14:44:33,871 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse0 c_~min2~0) (not (< .cse0 c_~min3~0)))))) (< 0 ~M~0) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (not .cse1) (= c_~min2~0 .cse2)) (or (= c_~min2~0 c_~min1~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-18 14:44:34,573 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0))))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (not .cse1) (= c_~min2~0 .cse2)) (or (= c_~min2~0 c_~min1~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-18 14:44:38,146 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:44:38,146 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 177 treesize of output 117 [2022-02-18 14:44:38,163 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:44:38,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1631 treesize of output 1571 [2022-02-18 14:44:38,178 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:44:38,179 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 1571 treesize of output 1517 [2022-02-18 14:44:38,197 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 1406 treesize of output 1310 [2022-02-18 14:44:38,211 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 1310 treesize of output 1118 [2022-02-18 14:44:38,221 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 1118 treesize of output 1070 [2022-02-18 14:44:38,232 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 1070 treesize of output 1046 [2022-02-18 14:44:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:44:41,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577736420] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:44:41,551 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:44:41,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35, 36] total 90 [2022-02-18 14:44:41,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597161256] [2022-02-18 14:44:41,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:44:41,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-02-18 14:44:41,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:44:41,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-02-18 14:44:41,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1108, Invalid=6200, Unknown=18, NotChecked=684, Total=8010 [2022-02-18 14:44:41,554 INFO L87 Difference]: Start difference. First operand 8543 states and 30164 transitions. Second operand has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:44:44,633 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse1 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse1 c_~min3~0)) (< .cse1 c_~min2~0))))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse2 (< .cse3 c_~min1~0))) (and (or (not .cse2) (= c_~min2~0 .cse3)) (or (= c_~min2~0 c_~min1~0) .cse2)))) (< (+ ~M~0 1) c_~N~0))))) (and (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0) .cse0)) is different from false [2022-02-18 14:45:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:45:10,264 INFO L93 Difference]: Finished difference Result 28011 states and 98643 transitions. [2022-02-18 14:45:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2022-02-18 14:45:10,264 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 states have internal predecessors, (335), 0 states have call successors, (0), 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-02-18 14:45:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:45:10,343 INFO L225 Difference]: With dead ends: 28011 [2022-02-18 14:45:10,344 INFO L226 Difference]: Without dead ends: 27561 [2022-02-18 14:45:10,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 213 SyntacticMatches, 31 SemanticMatches, 226 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 21850 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=6684, Invalid=42751, Unknown=91, NotChecked=2230, Total=51756 [2022-02-18 14:45:10,349 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 4138 mSDsluCounter, 14401 mSDsCounter, 0 mSdLazyCounter, 4836 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 13382 SdHoareTripleChecker+Invalid, 12571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 4836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7583 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-18 14:45:10,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4138 Valid, 13382 Invalid, 12571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 4836 Invalid, 0 Unknown, 7583 Unchecked, 2.2s Time] [2022-02-18 14:45:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27561 states. [2022-02-18 14:45:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27561 to 10928. [2022-02-18 14:45:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10928 states, 10927 states have (on average 3.5326256062963304) internal successors, (38601), 10927 states have internal predecessors, (38601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:45:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10928 states to 10928 states and 38601 transitions. [2022-02-18 14:45:10,758 INFO L78 Accepts]: Start accepts. Automaton has 10928 states and 38601 transitions. Word has length 126 [2022-02-18 14:45:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:45:10,758 INFO L470 AbstractCegarLoop]: Abstraction has 10928 states and 38601 transitions. [2022-02-18 14:45:10,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:45:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 10928 states and 38601 transitions. [2022-02-18 14:45:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-18 14:45:10,780 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:45:10,780 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-02-18 14:45:10,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-18 14:45:10,997 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-02-18 14:45:10,997 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-18 14:45:10,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:45:10,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1583376580, now seen corresponding path program 2 times [2022-02-18 14:45:10,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:45:10,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713334747] [2022-02-18 14:45:10,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:45:10,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:45:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:45:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:45:11,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:45:11,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713334747] [2022-02-18 14:45:11,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713334747] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:45:11,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938183599] [2022-02-18 14:45:11,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-18 14:45:11,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:45:11,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:45:11,993 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:45:11,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-18 14:45:12,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-18 14:45:12,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:45:12,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-18 14:45:12,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:45:12,130 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-18 14:45:12,166 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-18 14:45:12,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-18 14:45:12,407 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-18 14:45:12,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-02-18 14:45:13,065 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 35 treesize of output 33 [2022-02-18 14:45:13,367 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 35 treesize of output 33 [2022-02-18 14:45:13,616 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:45:13,616 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 69 treesize of output 45 [2022-02-18 14:45:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:45:14,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:45:15,289 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:45:15,290 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 259 treesize of output 227 [2022-02-18 14:45:15,296 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 188 treesize of output 164 [2022-02-18 14:45:15,300 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 164 treesize of output 158 [2022-02-18 14:45:15,306 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 158 treesize of output 146 [2022-02-18 14:45:15,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 134 [2022-02-18 14:45:16,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-02-18 14:45:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:45:16,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938183599] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:45:16,908 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:45:16,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 27, 27] total 75 [2022-02-18 14:45:16,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326047091] [2022-02-18 14:45:16,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:45:16,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-02-18 14:45:16,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:45:16,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-02-18 14:45:16,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=927, Invalid=4614, Unknown=9, NotChecked=0, Total=5550 [2022-02-18 14:45:16,910 INFO L87 Difference]: Start difference. First operand 10928 states and 38601 transitions. Second operand has 75 states, 75 states have (on average 4.466666666666667) internal successors, (335), 75 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:45:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:45:30,886 INFO L93 Difference]: Finished difference Result 34659 states and 121124 transitions. [2022-02-18 14:45:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2022-02-18 14:45:30,887 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 4.466666666666667) internal successors, (335), 75 states have internal predecessors, (335), 0 states have call successors, (0), 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-02-18 14:45:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:45:31,013 INFO L225 Difference]: With dead ends: 34659 [2022-02-18 14:45:31,014 INFO L226 Difference]: Without dead ends: 34159 [2022-02-18 14:45:31,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 234 SyntacticMatches, 5 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19109 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=5760, Invalid=42843, Unknown=17, NotChecked=0, Total=48620 [2022-02-18 14:45:31,017 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 3482 mSDsluCounter, 12571 mSDsCounter, 0 mSdLazyCounter, 6095 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3482 SdHoareTripleChecker+Valid, 11755 SdHoareTripleChecker+Invalid, 9765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 6095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3540 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-18 14:45:31,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3482 Valid, 11755 Invalid, 9765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 6095 Invalid, 0 Unknown, 3540 Unchecked, 2.8s Time] [2022-02-18 14:45:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34159 states. [2022-02-18 14:45:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34159 to 10640. [2022-02-18 14:45:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10640 states, 10639 states have (on average 3.54591596954601) internal successors, (37725), 10639 states have internal predecessors, (37725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:45:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10640 states to 10640 states and 37725 transitions. [2022-02-18 14:45:31,590 INFO L78 Accepts]: Start accepts. Automaton has 10640 states and 37725 transitions. Word has length 126 [2022-02-18 14:45:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:45:31,591 INFO L470 AbstractCegarLoop]: Abstraction has 10640 states and 37725 transitions. [2022-02-18 14:45:31,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.466666666666667) internal successors, (335), 75 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:45:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 10640 states and 37725 transitions. [2022-02-18 14:45:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-18 14:45:31,618 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:45:31,618 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-02-18 14:45:31,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-18 14:45:31,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:45:31,831 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-18 14:45:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:45:31,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1602735180, now seen corresponding path program 3 times [2022-02-18 14:45:31,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:45:31,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832294281] [2022-02-18 14:45:31,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:45:31,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:45:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:45:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:45:32,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:45:32,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832294281] [2022-02-18 14:45:32,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832294281] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:45:32,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945835981] [2022-02-18 14:45:32,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-18 14:45:32,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:45:32,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:45:32,812 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:45:32,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-18 14:45:32,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-18 14:45:32,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:45:32,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-18 14:45:32,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:45:32,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-18 14:45:32,999 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-18 14:45:32,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-18 14:45:33,259 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-18 14:45:33,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-02-18 14:45:33,995 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 35 treesize of output 33 [2022-02-18 14:45:34,339 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 35 treesize of output 33 [2022-02-18 14:45:34,545 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:45:34,545 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 69 treesize of output 45 [2022-02-18 14:45:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:45:35,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:45:36,178 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:45:36,178 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 419 treesize of output 371 [2022-02-18 14:45:36,184 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 332 treesize of output 320 [2022-02-18 14:45:36,189 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 320 treesize of output 296 [2022-02-18 14:45:36,193 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 296 treesize of output 290 [2022-02-18 14:45:36,200 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 290 treesize of output 242 [2022-02-18 14:45:37,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-02-18 14:45:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-18 14:45:37,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945835981] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 14:45:37,726 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 14:45:37,726 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 27] total 72 [2022-02-18 14:45:37,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602135802] [2022-02-18 14:45:37,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 14:45:37,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-02-18 14:45:37,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 14:45:37,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-02-18 14:45:37,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=4269, Unknown=10, NotChecked=0, Total=5112 [2022-02-18 14:45:37,730 INFO L87 Difference]: Start difference. First operand 10640 states and 37725 transitions. Second operand has 72 states, 72 states have (on average 4.638888888888889) internal successors, (334), 72 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:45:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 14:45:46,270 INFO L93 Difference]: Finished difference Result 27343 states and 96464 transitions. [2022-02-18 14:45:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-02-18 14:45:46,271 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 4.638888888888889) internal successors, (334), 72 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-02-18 14:45:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 14:45:46,393 INFO L225 Difference]: With dead ends: 27343 [2022-02-18 14:45:46,393 INFO L226 Difference]: Without dead ends: 27299 [2022-02-18 14:45:46,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10090 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=3488, Invalid=23509, Unknown=63, NotChecked=0, Total=27060 [2022-02-18 14:45:46,395 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 2179 mSDsluCounter, 9254 mSDsCounter, 0 mSdLazyCounter, 4660 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2179 SdHoareTripleChecker+Valid, 9127 SdHoareTripleChecker+Invalid, 6233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 4660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1466 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-18 14:45:46,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2179 Valid, 9127 Invalid, 6233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 4660 Invalid, 0 Unknown, 1466 Unchecked, 1.9s Time] [2022-02-18 14:45:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27299 states. [2022-02-18 14:45:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27299 to 11081. [2022-02-18 14:45:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11081 states, 11080 states have (on average 3.5409747292418774) internal successors, (39234), 11080 states have internal predecessors, (39234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:45:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11081 states to 11081 states and 39234 transitions. [2022-02-18 14:45:46,675 INFO L78 Accepts]: Start accepts. Automaton has 11081 states and 39234 transitions. Word has length 126 [2022-02-18 14:45:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 14:45:46,675 INFO L470 AbstractCegarLoop]: Abstraction has 11081 states and 39234 transitions. [2022-02-18 14:45:46,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.638888888888889) internal successors, (334), 72 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-18 14:45:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 11081 states and 39234 transitions. [2022-02-18 14:45:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-18 14:45:46,694 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 14:45:46,694 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-02-18 14:45:46,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-18 14:45:46,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:45:46,895 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-18 14:45:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 14:45:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash 653191920, now seen corresponding path program 4 times [2022-02-18 14:45:46,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 14:45:46,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562533591] [2022-02-18 14:45:46,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 14:45:46,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 14:45:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 14:45:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:45:47,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 14:45:47,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562533591] [2022-02-18 14:45:47,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562533591] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 14:45:47,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680479652] [2022-02-18 14:45:47,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-18 14:45:47,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 14:45:47,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 14:45:47,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-18 14:45:47,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-18 14:45:47,832 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-18 14:45:47,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-18 14:45:47,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 59 conjunts are in the unsatisfiable core [2022-02-18 14:45:47,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 14:45:47,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-18 14:45:48,362 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-18 14:45:48,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-18 14:45:48,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-18 14:45:49,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-18 14:45:49,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-18 14:45:49,579 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 35 treesize of output 33 [2022-02-18 14:45:49,844 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 35 treesize of output 33 [2022-02-18 14:45:50,092 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-02-18 14:45:50,092 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 69 treesize of output 36 [2022-02-18 14:45:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 14:45:50,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 14:45:51,199 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 (Array Int Int))) (or (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_322) c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (< .cse1 c_~min1~0))) (and (or (= c_~min2~0 c_~min1~0) .cse0) (or (= c_~min2~0 .cse1) (not .cse0))))) (and (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse2 c_~min3~0)) (< .cse2 c_~min2~0)))) (or (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0)) (< c_~min3~0 c_~min2~0))))) is different from false [2022-02-18 14:45:51,566 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_322 (Array Int Int))) (or (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_322) c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (< .cse1 c_~min1~0))) (and (or (= c_~min2~0 c_~min1~0) .cse0) (or (= c_~min2~0 .cse1) (not .cse0))))) (and (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse2 c_~min3~0)) (< .cse2 c_~min2~0)))) (or (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0)) (< c_~min3~0 c_~min2~0))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2022-02-18 14:45:51,673 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_322 (Array Int Int))) (or (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_322) c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (< .cse1 c_~min1~0))) (and (or (= c_~min2~0 c_~min1~0) .cse0) (or (= c_~min2~0 .cse1) (not .cse0))))) (and (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse2 c_~min3~0)) (< .cse2 c_~min2~0)))) (or (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min3~0)) (< c_~min3~0 c_~min2~0))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-02-18 14:45:59,104 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:45:59,104 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 177 treesize of output 117 [2022-02-18 14:45:59,124 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:45:59,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1923 treesize of output 1847 [2022-02-18 14:45:59,145 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-18 14:45:59,145 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 1847 treesize of output 1781 [2022-02-18 14:45:59,171 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 1670 treesize of output 1478 [2022-02-18 14:45:59,185 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 1478 treesize of output 1430 [2022-02-18 14:45:59,199 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 1430 treesize of output 1334 [2022-02-18 14:45:59,215 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 1334 treesize of output 1238 [2022-02-18 14:45:59,224 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-18 14:45:59,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-18 14:45:59,431 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,SelfDestructingSolverStorable10 [2022-02-18 14:45:59,432 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-18 14:45:59,435 INFO L158 Benchmark]: Toolchain (without parser) took 123514.86ms. Allocated memory was 178.3MB in the beginning and 1.1GB in the end (delta: 900.7MB). Free memory was 122.1MB in the beginning and 317.9MB in the end (delta: -195.8MB). Peak memory consumption was 704.6MB. Max. memory is 8.0GB. [2022-02-18 14:45:59,435 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-18 14:45:59,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.88ms. Allocated memory was 178.3MB in the beginning and 240.1MB in the end (delta: 61.9MB). Free memory was 121.8MB in the beginning and 209.5MB in the end (delta: -87.7MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-02-18 14:45:59,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.75ms. Allocated memory is still 240.1MB. Free memory was 209.5MB in the beginning and 207.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-18 14:45:59,435 INFO L158 Benchmark]: Boogie Preprocessor took 24.35ms. Allocated memory is still 240.1MB. Free memory was 207.7MB in the beginning and 206.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-18 14:45:59,435 INFO L158 Benchmark]: RCFGBuilder took 386.46ms. Allocated memory is still 240.1MB. Free memory was 206.1MB in the beginning and 187.8MB in the end (delta: 18.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-02-18 14:45:59,436 INFO L158 Benchmark]: TraceAbstraction took 122791.23ms. Allocated memory was 240.1MB in the beginning and 1.1GB in the end (delta: 838.9MB). Free memory was 187.2MB in the beginning and 317.9MB in the end (delta: -130.7MB). Peak memory consumption was 709.1MB. Max. memory is 8.0GB. [2022-02-18 14:45:59,436 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.88ms. Allocated memory was 178.3MB in the beginning and 240.1MB in the end (delta: 61.9MB). Free memory was 121.8MB in the beginning and 209.5MB in the end (delta: -87.7MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.75ms. Allocated memory is still 240.1MB. Free memory was 209.5MB in the beginning and 207.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.35ms. Allocated memory is still 240.1MB. Free memory was 207.7MB in the beginning and 206.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 386.46ms. Allocated memory is still 240.1MB. Free memory was 206.1MB in the beginning and 187.8MB in the end (delta: 18.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 122791.23ms. Allocated memory was 240.1MB in the beginning and 1.1GB in the end (delta: 838.9MB). Free memory was 187.2MB in the beginning and 317.9MB in the end (delta: -130.7MB). Peak memory consumption was 709.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-18 14:45:59,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...