/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 02:02:20,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 02:02:20,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 02:02:20,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 02:02:20,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 02:02:20,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 02:02:20,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 02:02:20,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 02:02:20,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 02:02:20,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 02:02:20,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 02:02:20,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 02:02:20,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 02:02:20,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 02:02:20,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 02:02:20,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 02:02:20,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 02:02:20,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 02:02:20,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 02:02:20,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 02:02:20,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 02:02:20,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 02:02:20,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 02:02:20,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 02:02:20,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 02:02:20,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 02:02:20,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 02:02:20,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 02:02:20,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 02:02:20,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 02:02:20,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 02:02:20,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 02:02:20,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 02:02:20,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 02:02:20,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 02:02:20,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 02:02:20,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 02:02:20,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 02:02:20,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 02:02:20,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 02:02:20,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 02:02:20,524 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-01-18 02:02:20,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 02:02:20,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 02:02:20,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 02:02:20,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 02:02:20,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 02:02:20,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 02:02:20,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 02:02:20,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 02:02:20,551 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 02:02:20,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 02:02:20,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 02:02:20,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 02:02:20,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 02:02:20,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 02:02:20,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 02:02:20,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 02:02:20,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 02:02:20,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 02:02:20,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 02:02:20,552 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 02:02:20,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 02:02:20,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 02:02:20,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 02:02:20,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 02:02:20,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 02:02:20,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:02:20,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 02:02:20,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 02:02:20,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 02:02:20,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 02:02:20,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 02:02:20,553 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 02:02:20,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 02:02:20,553 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-01-18 02:02:20,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 02:02:20,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 02:02:20,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 02:02:20,730 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 02:02:20,733 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 02:02:20,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-01-18 02:02:20,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86183c918/a967e70b463243bd999c7a2bf1596242/FLAGe12af0e09 [2022-01-18 02:02:21,169 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 02:02:21,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-01-18 02:02:21,174 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86183c918/a967e70b463243bd999c7a2bf1596242/FLAGe12af0e09 [2022-01-18 02:02:21,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86183c918/a967e70b463243bd999c7a2bf1596242 [2022-01-18 02:02:21,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 02:02:21,194 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 02:02:21,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 02:02:21,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 02:02:21,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 02:02:21,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f88734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21, skipping insertion in model container [2022-01-18 02:02:21,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 02:02:21,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 02:02:21,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-01-18 02:02:21,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:02:21,450 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 02:02:21,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-01-18 02:02:21,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 02:02:21,499 INFO L208 MainTranslator]: Completed translation [2022-01-18 02:02:21,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21 WrapperNode [2022-01-18 02:02:21,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 02:02:21,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 02:02:21,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 02:02:21,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 02:02:21,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,544 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-01-18 02:02:21,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 02:02:21,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 02:02:21,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 02:02:21,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 02:02:21,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 02:02:21,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 02:02:21,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 02:02:21,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 02:02:21,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21" (1/1) ... [2022-01-18 02:02:21,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 02:02:21,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:02:21,610 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-01-18 02:02:21,618 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-01-18 02:02:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 02:02:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 02:02:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 02:02:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 02:02:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 02:02:21,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 02:02:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 02:02:21,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 02:02:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 02:02:21,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 02:02:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-18 02:02:21,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-18 02:02:21,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 02:02:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 02:02:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 02:02:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 02:02:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 02:02:21,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 02:02:21,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 02:02:21,638 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 02:02:21,728 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 02:02:21,730 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 02:02:21,921 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 02:02:21,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 02:02:21,971 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-18 02:02:21,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:02:21 BoogieIcfgContainer [2022-01-18 02:02:21,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 02:02:21,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 02:02:21,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 02:02:21,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 02:02:21,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 02:02:21" (1/3) ... [2022-01-18 02:02:21,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2414624e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:02:21, skipping insertion in model container [2022-01-18 02:02:21,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 02:02:21" (2/3) ... [2022-01-18 02:02:21,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2414624e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:02:21, skipping insertion in model container [2022-01-18 02:02:21,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:02:21" (3/3) ... [2022-01-18 02:02:21,980 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2022-01-18 02:02:21,984 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 02:02:21,984 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 02:02:21,984 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 02:02:21,984 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 02:02:22,032 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,032 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,033 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,033 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,033 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,033 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,033 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,034 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,034 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,035 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,035 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,038 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,038 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,038 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,038 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,038 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,040 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,040 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,040 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,041 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,041 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,042 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,042 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,042 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,042 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,042 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,043 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,044 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,045 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,045 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,045 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,045 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,046 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,046 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,046 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,046 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,046 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,046 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,047 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,049 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,049 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,049 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,049 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,049 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,049 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,050 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,050 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,050 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,050 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,051 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,051 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,051 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,051 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,053 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,054 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,055 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,055 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,055 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,055 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,055 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,055 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,055 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,056 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,056 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,056 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,056 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,056 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,056 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,057 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 02:02:22,060 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-18 02:02:22,087 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 02:02:22,092 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, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 02:02:22,093 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-18 02:02:22,101 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 172 transitions, 376 flow [2022-01-18 02:02:22,903 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-18 02:02:23,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:02:23,199 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-01-18 02:02:23,200 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:02:23,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:02:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1420994164, now seen corresponding path program 1 times [2022-01-18 02:02:23,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:02:23,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933705992] [2022-01-18 02:02:23,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:02:23,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:02:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:02:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:02:23,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:02:23,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933705992] [2022-01-18 02:02:23,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933705992] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:02:23,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:02:23,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 02:02:23,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81052694] [2022-01-18 02:02:23,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:02:23,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 02:02:23,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:02:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 02:02:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 02:02:23,502 INFO L87 Difference]: Start difference. First operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:02:23,928 INFO L93 Difference]: Finished difference Result 26140 states and 111710 transitions. [2022-01-18 02:02:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 02:02:23,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-18 02:02:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:02:24,221 INFO L225 Difference]: With dead ends: 26140 [2022-01-18 02:02:24,221 INFO L226 Difference]: Without dead ends: 26136 [2022-01-18 02:02:24,222 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-01-18 02:02:24,225 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:02:24,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 02:02:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26136 states. [2022-01-18 02:02:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26136 to 26136. [2022-01-18 02:02:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26136 states, 26135 states have (on average 4.274191696958102) internal successors, (111706), 26135 states have internal predecessors, (111706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26136 states to 26136 states and 111706 transitions. [2022-01-18 02:02:25,422 INFO L78 Accepts]: Start accepts. Automaton has 26136 states and 111706 transitions. Word has length 121 [2022-01-18 02:02:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:02:25,423 INFO L470 AbstractCegarLoop]: Abstraction has 26136 states and 111706 transitions. [2022-01-18 02:02:25,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 26136 states and 111706 transitions. [2022-01-18 02:02:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-18 02:02:25,512 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:02:25,512 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-01-18 02:02:25,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 02:02:25,514 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:02:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:02:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash -507464182, now seen corresponding path program 1 times [2022-01-18 02:02:25,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:02:25,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726220202] [2022-01-18 02:02:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:02:25,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:02:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:02:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:02:25,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:02:25,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726220202] [2022-01-18 02:02:25,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726220202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:02:25,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:02:25,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 02:02:25,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459056974] [2022-01-18 02:02:25,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:02:25,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 02:02:25,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:02:25,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 02:02:25,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-18 02:02:25,886 INFO L87 Difference]: Start difference. First operand 26136 states and 111706 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:02:26,418 INFO L93 Difference]: Finished difference Result 35136 states and 150562 transitions. [2022-01-18 02:02:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 02:02:26,419 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-01-18 02:02:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:02:26,669 INFO L225 Difference]: With dead ends: 35136 [2022-01-18 02:02:26,670 INFO L226 Difference]: Without dead ends: 35136 [2022-01-18 02:02:26,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-01-18 02:02:26,671 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 352 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:02:26,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 319 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:02:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35136 states. [2022-01-18 02:02:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35136 to 28386. [2022-01-18 02:02:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28386 states, 28385 states have (on average 4.277611414479479) internal successors, (121420), 28385 states have internal predecessors, (121420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28386 states to 28386 states and 121420 transitions. [2022-01-18 02:02:27,924 INFO L78 Accepts]: Start accepts. Automaton has 28386 states and 121420 transitions. Word has length 121 [2022-01-18 02:02:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:02:27,924 INFO L470 AbstractCegarLoop]: Abstraction has 28386 states and 121420 transitions. [2022-01-18 02:02:27,924 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-01-18 02:02:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 28386 states and 121420 transitions. [2022-01-18 02:02:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-18 02:02:28,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:02:28,042 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-01-18 02:02:28,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 02:02:28,043 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:02:28,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:02:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1313580435, now seen corresponding path program 1 times [2022-01-18 02:02:28,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:02:28,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827408929] [2022-01-18 02:02:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:02:28,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:02:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:02:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 02:02:28,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:02:28,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827408929] [2022-01-18 02:02:28,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827408929] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:02:28,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:02:28,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 02:02:28,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577745699] [2022-01-18 02:02:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:02:28,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 02:02:28,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:02:28,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 02:02:28,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-18 02:02:28,139 INFO L87 Difference]: Start difference. First operand 28386 states and 121420 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:02:28,476 INFO L93 Difference]: Finished difference Result 37401 states and 158042 transitions. [2022-01-18 02:02:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 02:02:28,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-01-18 02:02:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:02:28,592 INFO L225 Difference]: With dead ends: 37401 [2022-01-18 02:02:28,593 INFO L226 Difference]: Without dead ends: 28392 [2022-01-18 02:02:28,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-18 02:02:28,594 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 425 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:02:28,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 475 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:02:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28392 states. [2022-01-18 02:02:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28392 to 28387. [2022-01-18 02:02:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28387 states, 28386 states have (on average 4.277495948707109) internal successors, (121421), 28386 states have internal predecessors, (121421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28387 states to 28387 states and 121421 transitions. [2022-01-18 02:02:29,788 INFO L78 Accepts]: Start accepts. Automaton has 28387 states and 121421 transitions. Word has length 126 [2022-01-18 02:02:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:02:29,788 INFO L470 AbstractCegarLoop]: Abstraction has 28387 states and 121421 transitions. [2022-01-18 02:02:29,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 28387 states and 121421 transitions. [2022-01-18 02:02:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-18 02:02:29,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:02:29,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:02:29,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 02:02:29,860 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:02:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:02:29,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1766570838, now seen corresponding path program 1 times [2022-01-18 02:02:29,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:02:29,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888712068] [2022-01-18 02:02:29,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:02:29,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:02:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:02:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:02:29,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:02:29,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888712068] [2022-01-18 02:02:29,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888712068] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:02:29,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787221708] [2022-01-18 02:02:29,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:02:29,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:02:29,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:02:29,936 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-01-18 02:02:29,958 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-01-18 02:02:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:02:30,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 02:02:30,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:02:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:02:30,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:02:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:02:30,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787221708] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 02:02:30,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 02:02:30,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 02:02:30,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871239011] [2022-01-18 02:02:30,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:02:30,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 02:02:30,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:02:30,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 02:02:30,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 02:02:30,567 INFO L87 Difference]: Start difference. First operand 28387 states and 121421 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:02:31,067 INFO L93 Difference]: Finished difference Result 30943 states and 132410 transitions. [2022-01-18 02:02:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 02:02:31,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-01-18 02:02:31,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:02:31,229 INFO L225 Difference]: With dead ends: 30943 [2022-01-18 02:02:31,229 INFO L226 Difference]: Without dead ends: 30943 [2022-01-18 02:02:31,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-01-18 02:02:31,236 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 280 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:02:31,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 368 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:02:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2022-01-18 02:02:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 30943. [2022-01-18 02:02:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30943 states, 30942 states have (on average 4.279296748755737) internal successors, (132410), 30942 states have internal predecessors, (132410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30943 states to 30943 states and 132410 transitions. [2022-01-18 02:02:32,166 INFO L78 Accepts]: Start accepts. Automaton has 30943 states and 132410 transitions. Word has length 133 [2022-01-18 02:02:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:02:32,166 INFO L470 AbstractCegarLoop]: Abstraction has 30943 states and 132410 transitions. [2022-01-18 02:02:32,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 30943 states and 132410 transitions. [2022-01-18 02:02:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 02:02:32,250 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:02:32,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:02:32,268 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-01-18 02:02:32,451 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-01-18 02:02:32,452 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:02:32,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:02:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1027911653, now seen corresponding path program 1 times [2022-01-18 02:02:32,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:02:32,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624556134] [2022-01-18 02:02:32,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:02:32,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:02:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:02:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:02:32,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:02:32,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624556134] [2022-01-18 02:02:32,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624556134] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:02:32,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760599353] [2022-01-18 02:02:32,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:02:32,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:02:32,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:02:32,568 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-01-18 02:02:32,591 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-01-18 02:02:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:02:32,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 02:02:32,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:02:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:02:32,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:02:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:02:33,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760599353] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 02:02:33,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 02:02:33,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 02:02:33,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201524158] [2022-01-18 02:02:33,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:02:33,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 02:02:33,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:02:33,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 02:02:33,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 02:02:33,079 INFO L87 Difference]: Start difference. First operand 30943 states and 132410 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:02:33,392 INFO L93 Difference]: Finished difference Result 34267 states and 146807 transitions. [2022-01-18 02:02:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 02:02:33,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-01-18 02:02:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:02:33,861 INFO L225 Difference]: With dead ends: 34267 [2022-01-18 02:02:33,861 INFO L226 Difference]: Without dead ends: 34267 [2022-01-18 02:02:33,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-01-18 02:02:33,862 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 240 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:02:33,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 410 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 02:02:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34267 states. [2022-01-18 02:02:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34267 to 34267. [2022-01-18 02:02:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34267 states, 34266 states have (on average 4.284334325570536) internal successors, (146807), 34266 states have internal predecessors, (146807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34267 states to 34267 states and 146807 transitions. [2022-01-18 02:02:34,971 INFO L78 Accepts]: Start accepts. Automaton has 34267 states and 146807 transitions. Word has length 138 [2022-01-18 02:02:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:02:34,971 INFO L470 AbstractCegarLoop]: Abstraction has 34267 states and 146807 transitions. [2022-01-18 02:02:34,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 34267 states and 146807 transitions. [2022-01-18 02:02:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:02:35,056 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:02:35,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:02:35,074 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-01-18 02:02:35,267 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-01-18 02:02:35,267 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:02:35,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:02:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash 334563494, now seen corresponding path program 1 times [2022-01-18 02:02:35,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:02:35,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457960828] [2022-01-18 02:02:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:02:35,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:02:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:02:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:02:35,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:02:35,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457960828] [2022-01-18 02:02:35,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457960828] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:02:35,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342366848] [2022-01-18 02:02:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:02:35,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:02:35,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:02:35,624 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-01-18 02:02:35,625 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-01-18 02:02:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:02:35,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-18 02:02:35,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:02:35,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-18 02:02:36,059 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-01-18 02:02:36,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:02:36,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:02:36,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-18 02:02:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:02:36,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:02:36,583 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-01-18 02:02:36,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse2)) (.cse3 (+ .cse0 1))) (and (or .cse1 (<= .cse2 .cse3)) (or (not .cse1) (<= c_~min~0 .cse3)))))))) is different from false [2022-01-18 02:02:36,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (+ .cse0 1)) (.cse2 (< c_~min~0 .cse3))) (and (or (<= c_~min~0 .cse1) (not .cse2)) (or (<= .cse3 .cse1) .cse2))))))) is different from false [2022-01-18 02:02:36,785 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-01-18 02:02:36,800 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-01-18 02:02:36,829 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (or (<= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-01-18 02:02:36,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= 2147483647 .cse0) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ .cse0 1)))))) is different from false [2022-01-18 02:02:36,856 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= 2147483647 .cse0) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse0 1)))))) is different from false [2022-01-18 02:02:36,900 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:02:36,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 48 [2022-01-18 02:02:36,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 383 treesize of output 343 [2022-01-18 02:02:36,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2022-01-18 02:02:36,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2022-01-18 02:02:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-18 02:02:37,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342366848] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:02:37,070 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:02:37,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 45 [2022-01-18 02:02:37,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897909266] [2022-01-18 02:02:37,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:02:37,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-18 02:02:37,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:02:37,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-18 02:02:37,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1225, Unknown=8, NotChecked=616, Total=1980 [2022-01-18 02:02:37,073 INFO L87 Difference]: Start difference. First operand 34267 states and 146807 transitions. Second operand has 45 states, 45 states have (on average 8.444444444444445) internal successors, (380), 45 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:02:43,739 INFO L93 Difference]: Finished difference Result 342390 states and 1478395 transitions. [2022-01-18 02:02:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-18 02:02:43,739 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 8.444444444444445) internal successors, (380), 45 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-18 02:02:43,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:02:45,187 INFO L225 Difference]: With dead ends: 342390 [2022-01-18 02:02:45,187 INFO L226 Difference]: Without dead ends: 194157 [2022-01-18 02:02:45,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 259 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1208, Invalid=4366, Unknown=8, NotChecked=1224, Total=6806 [2022-01-18 02:02:45,189 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1962 mSDsluCounter, 5657 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 5862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3847 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:02:45,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1962 Valid, 5481 Invalid, 5862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1938 Invalid, 0 Unknown, 3847 Unchecked, 1.1s Time] [2022-01-18 02:02:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194157 states. [2022-01-18 02:02:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194157 to 35973. [2022-01-18 02:02:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35973 states, 35972 states have (on average 4.2384910485933505) internal successors, (152467), 35972 states have internal predecessors, (152467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35973 states to 35973 states and 152467 transitions. [2022-01-18 02:02:48,548 INFO L78 Accepts]: Start accepts. Automaton has 35973 states and 152467 transitions. Word has length 143 [2022-01-18 02:02:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:02:48,548 INFO L470 AbstractCegarLoop]: Abstraction has 35973 states and 152467 transitions. [2022-01-18 02:02:48,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 8.444444444444445) internal successors, (380), 45 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:02:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 35973 states and 152467 transitions. [2022-01-18 02:02:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:02:48,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:02:48,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:02:48,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-18 02:02:48,831 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-01-18 02:02:48,832 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:02:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:02:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash 940179670, now seen corresponding path program 2 times [2022-01-18 02:02:48,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:02:48,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006895693] [2022-01-18 02:02:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:02:48,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:02:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:02:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:02:49,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:02:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006895693] [2022-01-18 02:02:49,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006895693] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:02:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184342941] [2022-01-18 02:02:49,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:02:49,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:02:49,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:02:49,208 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-01-18 02:02:49,209 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-01-18 02:02:49,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:02:49,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:02:49,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-18 02:02:49,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:02:49,362 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-01-18 02:02:49,396 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 02:02:49,397 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 02:02:49,574 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:02:49,574 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-01-18 02:02:49,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:02:49,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:02:49,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:02:49,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-18 02:02:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:02:50,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:02:50,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-01-18 02:02:50,341 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-01-18 02:02:50,457 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse2)) (.cse3 (+ .cse0 1))) (and (or .cse1 (<= .cse2 .cse3)) (or (not .cse1) (<= c_~min~0 .cse3)))))))) is different from false [2022-01-18 02:02:50,509 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (+ .cse3 1)) (.cse0 (< c_~min~0 .cse1))) (and (or .cse0 (<= .cse1 .cse2)) (or (<= c_~min~0 .cse2) (not .cse0))))) (<= 2147483647 .cse3)))) is different from false [2022-01-18 02:02:50,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 215 [2022-01-18 02:02:50,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 199 [2022-01-18 02:02:50,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 183 [2022-01-18 02:02:51,428 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-01-18 02:02:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-01-18 02:02:51,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184342941] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:02:51,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:02:51,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 48 [2022-01-18 02:02:51,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908401697] [2022-01-18 02:02:51,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:02:51,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-18 02:02:51,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:02:51,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-18 02:02:51,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1711, Unknown=4, NotChecked=348, Total=2256 [2022-01-18 02:02:51,461 INFO L87 Difference]: Start difference. First operand 35973 states and 152467 transitions. Second operand has 48 states, 48 states have (on average 7.25) internal successors, (348), 48 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:03:07,314 INFO L93 Difference]: Finished difference Result 498918 states and 2148451 transitions. [2022-01-18 02:03:07,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-01-18 02:03:07,314 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 7.25) internal successors, (348), 48 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-18 02:03:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:03:09,024 INFO L225 Difference]: With dead ends: 498918 [2022-01-18 02:03:09,024 INFO L226 Difference]: Without dead ends: 302240 [2022-01-18 02:03:09,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 263 SyntacticMatches, 7 SemanticMatches, 170 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8592 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=6074, Invalid=21994, Unknown=4, NotChecked=1340, Total=29412 [2022-01-18 02:03:09,030 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 2755 mSDsluCounter, 4763 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2755 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 5812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2985 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-18 02:03:09,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2755 Valid, 4573 Invalid, 5812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 2644 Invalid, 0 Unknown, 2985 Unchecked, 1.4s Time] [2022-01-18 02:03:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302240 states. [2022-01-18 02:03:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302240 to 36184. [2022-01-18 02:03:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36184 states, 36183 states have (on average 4.237625404195341) internal successors, (153330), 36183 states have internal predecessors, (153330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36184 states to 36184 states and 153330 transitions. [2022-01-18 02:03:14,130 INFO L78 Accepts]: Start accepts. Automaton has 36184 states and 153330 transitions. Word has length 143 [2022-01-18 02:03:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:03:14,130 INFO L470 AbstractCegarLoop]: Abstraction has 36184 states and 153330 transitions. [2022-01-18 02:03:14,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 7.25) internal successors, (348), 48 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 36184 states and 153330 transitions. [2022-01-18 02:03:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:03:14,216 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:03:14,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:03:14,233 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-01-18 02:03:14,417 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-01-18 02:03:14,418 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:03:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:03:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -263687870, now seen corresponding path program 3 times [2022-01-18 02:03:14,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:03:14,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775894501] [2022-01-18 02:03:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:03:14,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:03:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:03:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:03:14,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:03:14,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775894501] [2022-01-18 02:03:14,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775894501] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:03:14,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963721303] [2022-01-18 02:03:14,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:03:14,833 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:03:14,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:03:14,834 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-01-18 02:03:14,834 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-01-18 02:03:14,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 02:03:14,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:03:14,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-18 02:03:14,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:03:15,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:03:15,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:03:15,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:03:15,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:03:15,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-18 02:03:15,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:03:15,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 02:03:15,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 02:03:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:03:15,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:03:16,021 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-01-18 02:03:16,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_279 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 .cse2 v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 .cse2) (+ v_ArrVal_278 1))))))) is different from false [2022-01-18 02:03:16,101 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_279 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1))) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2022-01-18 02:03:16,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-01-18 02:03:16,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-01-18 02:03:16,476 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse4 (select .cse5 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse3)) (.cse2 (+ .cse0 1))) (and (or (not .cse1) (<= c_~min~0 .cse2)) (or .cse1 (<= .cse3 .cse2))))) (not (<= (select .cse4 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-01-18 02:03:16,948 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse5 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse5 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (+ .cse0 1)) (.cse2 (< c_~min~0 .cse3))) (and (or .cse2 (<= .cse3 .cse4)) (or (<= c_~min~0 .cse4) (not .cse2)))))))))) is different from false [2022-01-18 02:03:17,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 279 [2022-01-18 02:03:17,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 203 [2022-01-18 02:03:17,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-01-18 02:03:17,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-01-18 02:03:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-18 02:03:17,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963721303] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:03:17,635 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:03:17,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 55 [2022-01-18 02:03:17,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765101166] [2022-01-18 02:03:17,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:03:17,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-01-18 02:03:17,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:03:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-01-18 02:03:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2058, Unknown=7, NotChecked=686, Total=2970 [2022-01-18 02:03:17,637 INFO L87 Difference]: Start difference. First operand 36184 states and 153330 transitions. Second operand has 55 states, 55 states have (on average 6.363636363636363) internal successors, (350), 55 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:03:26,906 INFO L93 Difference]: Finished difference Result 401922 states and 1744153 transitions. [2022-01-18 02:03:26,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-18 02:03:26,906 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 6.363636363636363) internal successors, (350), 55 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-18 02:03:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:03:28,981 INFO L225 Difference]: With dead ends: 401922 [2022-01-18 02:03:28,981 INFO L226 Difference]: Without dead ends: 274414 [2022-01-18 02:03:28,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 253 SyntacticMatches, 12 SemanticMatches, 116 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2625, Invalid=9606, Unknown=7, NotChecked=1568, Total=13806 [2022-01-18 02:03:28,985 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 4056 mSDsluCounter, 6138 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4056 SdHoareTripleChecker+Valid, 6113 SdHoareTripleChecker+Invalid, 7407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4873 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 02:03:28,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4056 Valid, 6113 Invalid, 7407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2264 Invalid, 0 Unknown, 4873 Unchecked, 1.3s Time] [2022-01-18 02:03:29,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274414 states. [2022-01-18 02:03:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274414 to 35948. [2022-01-18 02:03:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35948 states, 35947 states have (on average 4.235346482321195) internal successors, (152248), 35947 states have internal predecessors, (152248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35948 states to 35948 states and 152248 transitions. [2022-01-18 02:03:33,099 INFO L78 Accepts]: Start accepts. Automaton has 35948 states and 152248 transitions. Word has length 143 [2022-01-18 02:03:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:03:33,099 INFO L470 AbstractCegarLoop]: Abstraction has 35948 states and 152248 transitions. [2022-01-18 02:03:33,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.363636363636363) internal successors, (350), 55 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 35948 states and 152248 transitions. [2022-01-18 02:03:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:03:33,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:03:33,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:03:33,206 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-01-18 02:03:33,389 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-01-18 02:03:33,390 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:03:33,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:03:33,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1870998198, now seen corresponding path program 4 times [2022-01-18 02:03:33,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:03:33,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196891627] [2022-01-18 02:03:33,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:03:33,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:03:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:03:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 02:03:33,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:03:33,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196891627] [2022-01-18 02:03:33,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196891627] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 02:03:33,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 02:03:33,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 02:03:33,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938682310] [2022-01-18 02:03:33,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 02:03:33,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 02:03:33,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:03:33,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 02:03:33,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 02:03:33,453 INFO L87 Difference]: Start difference. First operand 35948 states and 152248 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:03:33,819 INFO L93 Difference]: Finished difference Result 51353 states and 219409 transitions. [2022-01-18 02:03:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 02:03:33,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-18 02:03:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:03:33,930 INFO L225 Difference]: With dead ends: 51353 [2022-01-18 02:03:33,931 INFO L226 Difference]: Without dead ends: 32549 [2022-01-18 02:03:33,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-18 02:03:33,931 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:03:33,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 698 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:03:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32549 states. [2022-01-18 02:03:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32549 to 32426. [2022-01-18 02:03:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32426 states, 32425 states have (on average 4.1830377794911335) internal successors, (135635), 32425 states have internal predecessors, (135635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32426 states to 32426 states and 135635 transitions. [2022-01-18 02:03:35,136 INFO L78 Accepts]: Start accepts. Automaton has 32426 states and 135635 transitions. Word has length 143 [2022-01-18 02:03:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:03:35,137 INFO L470 AbstractCegarLoop]: Abstraction has 32426 states and 135635 transitions. [2022-01-18 02:03:35,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 32426 states and 135635 transitions. [2022-01-18 02:03:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:03:35,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:03:35,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:03:35,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 02:03:35,211 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:03:35,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:03:35,212 INFO L85 PathProgramCache]: Analyzing trace with hash -342153556, now seen corresponding path program 5 times [2022-01-18 02:03:35,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:03:35,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818999085] [2022-01-18 02:03:35,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:03:35,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:03:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:03:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:03:35,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:03:35,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818999085] [2022-01-18 02:03:35,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818999085] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:03:35,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716479839] [2022-01-18 02:03:35,391 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:03:35,392 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:03:35,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:03:35,393 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-01-18 02:03:35,393 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-01-18 02:03:35,485 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 02:03:35,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:03:35,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-18 02:03:35,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:03:35,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-18 02:03:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:03:35,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:03:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:03:36,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716479839] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:03:36,125 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:03:36,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 9] total 23 [2022-01-18 02:03:36,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240015026] [2022-01-18 02:03:36,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:03:36,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-18 02:03:36,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:03:36,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-18 02:03:36,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-01-18 02:03:36,126 INFO L87 Difference]: Start difference. First operand 32426 states and 135635 transitions. Second operand has 23 states, 23 states have (on average 11.73913043478261) internal successors, (270), 23 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:03:40,322 INFO L93 Difference]: Finished difference Result 268223 states and 1151796 transitions. [2022-01-18 02:03:40,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-18 02:03:40,322 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.73913043478261) internal successors, (270), 23 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-18 02:03:40,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:03:40,945 INFO L225 Difference]: With dead ends: 268223 [2022-01-18 02:03:40,945 INFO L226 Difference]: Without dead ends: 119321 [2022-01-18 02:03:40,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1185, Invalid=3927, Unknown=0, NotChecked=0, Total=5112 [2022-01-18 02:03:40,947 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 1601 mSDsluCounter, 3858 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 3900 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 02:03:40,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1601 Valid, 3900 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-18 02:03:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119321 states. [2022-01-18 02:03:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119321 to 36452. [2022-01-18 02:03:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36452 states, 36451 states have (on average 4.1564017448080985) internal successors, (151505), 36451 states have internal predecessors, (151505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36452 states to 36452 states and 151505 transitions. [2022-01-18 02:03:43,035 INFO L78 Accepts]: Start accepts. Automaton has 36452 states and 151505 transitions. Word has length 143 [2022-01-18 02:03:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:03:43,035 INFO L470 AbstractCegarLoop]: Abstraction has 36452 states and 151505 transitions. [2022-01-18 02:03:43,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.73913043478261) internal successors, (270), 23 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 36452 states and 151505 transitions. [2022-01-18 02:03:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:03:43,116 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:03:43,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:03:43,133 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-01-18 02:03:43,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:03:43,333 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:03:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:03:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash 296544674, now seen corresponding path program 6 times [2022-01-18 02:03:43,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:03:43,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540996318] [2022-01-18 02:03:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:03:43,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:03:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:03:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:03:43,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:03:43,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540996318] [2022-01-18 02:03:43,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540996318] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:03:43,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365760238] [2022-01-18 02:03:43,564 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:03:43,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:03:43,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:03:43,565 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-01-18 02:03:43,566 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-01-18 02:03:43,662 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 02:03:43,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:03:43,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-18 02:03:43,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:03:43,690 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-01-18 02:03:43,714 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 02:03:43,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 02:03:43,768 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:03:43,769 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-01-18 02:03:43,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:03:44,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-18 02:03:44,130 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 02:03:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:03:44,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:03:44,930 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_392 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_392) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 2))) (<= 2147483647 c_~max~0)) is different from false [2022-01-18 02:03:44,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-18 02:03:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-18 02:03:45,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365760238] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:03:45,106 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:03:45,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 39 [2022-01-18 02:03:45,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28235052] [2022-01-18 02:03:45,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:03:45,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-18 02:03:45,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:03:45,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-18 02:03:45,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1254, Unknown=1, NotChecked=72, Total=1482 [2022-01-18 02:03:45,108 INFO L87 Difference]: Start difference. First operand 36452 states and 151505 transitions. Second operand has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:03:48,643 INFO L93 Difference]: Finished difference Result 201701 states and 860327 transitions. [2022-01-18 02:03:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-18 02:03:48,643 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-18 02:03:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:03:49,767 INFO L225 Difference]: With dead ends: 201701 [2022-01-18 02:03:49,767 INFO L226 Difference]: Without dead ends: 139209 [2022-01-18 02:03:49,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 272 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1247, Invalid=4918, Unknown=1, NotChecked=154, Total=6320 [2022-01-18 02:03:49,768 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 2421 mSDsluCounter, 5246 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 5221 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 02:03:49,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2421 Valid, 5221 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1620 Invalid, 0 Unknown, 460 Unchecked, 0.7s Time] [2022-01-18 02:03:49,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139209 states. [2022-01-18 02:03:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139209 to 35905. [2022-01-18 02:03:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35905 states, 35904 states have (on average 4.15371546345811) internal successors, (149135), 35904 states have internal predecessors, (149135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35905 states to 35905 states and 149135 transitions. [2022-01-18 02:03:51,963 INFO L78 Accepts]: Start accepts. Automaton has 35905 states and 149135 transitions. Word has length 143 [2022-01-18 02:03:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:03:51,964 INFO L470 AbstractCegarLoop]: Abstraction has 35905 states and 149135 transitions. [2022-01-18 02:03:51,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 35905 states and 149135 transitions. [2022-01-18 02:03:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:03:52,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:03:52,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:03:52,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-18 02:03:52,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:03:52,241 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:03:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:03:52,241 INFO L85 PathProgramCache]: Analyzing trace with hash 929095160, now seen corresponding path program 7 times [2022-01-18 02:03:52,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:03:52,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456751574] [2022-01-18 02:03:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:03:52,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:03:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:03:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:03:52,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:03:52,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456751574] [2022-01-18 02:03:52,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456751574] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:03:52,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849911063] [2022-01-18 02:03:52,504 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 02:03:52,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:03:52,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:03:52,505 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-01-18 02:03:52,507 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-01-18 02:03:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:03:52,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-18 02:03:52,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:03:52,626 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-01-18 02:03:52,726 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:03:52,726 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-01-18 02:03:52,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:03:52,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 02:03:52,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-18 02:03:53,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 02:03:53,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 02:03:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 02:03:53,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:03:53,378 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_443 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_443) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))) (<= 2147483647 c_~max~0)) is different from false [2022-01-18 02:03:53,432 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_442 Int) (v_ArrVal_443 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (or (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 .cse1 v_ArrVal_442)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_443) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (not (<= (+ v_ArrVal_442 1) (select .cse0 .cse1)))))) (<= 2147483647 c_~max~0)) is different from false [2022-01-18 02:03:53,450 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_442 Int) (v_ArrVal_443 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (or (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_442)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_443) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (not (<= (+ v_ArrVal_442 1) (select .cse0 c_~A~0.offset))))))) is different from false [2022-01-18 02:03:53,468 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_442 Int) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_443 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440))) (let ((.cse0 (select .cse1 c_~A~0.base))) (or (not (<= (+ v_ArrVal_442 1) (select .cse0 c_~A~0.offset))) (<= (select (select (store (store .cse1 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_442)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_443) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))))))) is different from false [2022-01-18 02:03:53,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 81 [2022-01-18 02:03:53,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-01-18 02:03:53,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-01-18 02:03:54,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-18 02:03:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-18 02:03:54,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849911063] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:03:54,257 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:03:54,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 43 [2022-01-18 02:03:54,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403032618] [2022-01-18 02:03:54,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:03:54,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-18 02:03:54,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:03:54,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-18 02:03:54,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1338, Unknown=4, NotChecked=308, Total=1806 [2022-01-18 02:03:54,258 INFO L87 Difference]: Start difference. First operand 35905 states and 149135 transitions. Second operand has 43 states, 43 states have (on average 7.8604651162790695) internal successors, (338), 43 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:03:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:03:59,357 INFO L93 Difference]: Finished difference Result 218504 states and 940917 transitions. [2022-01-18 02:03:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-18 02:03:59,357 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 7.8604651162790695) internal successors, (338), 43 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-18 02:03:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:03:59,913 INFO L225 Difference]: With dead ends: 218504 [2022-01-18 02:03:59,913 INFO L226 Difference]: Without dead ends: 110408 [2022-01-18 02:03:59,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 263 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1787, Invalid=6057, Unknown=4, NotChecked=708, Total=8556 [2022-01-18 02:03:59,914 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 3167 mSDsluCounter, 6285 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3167 SdHoareTripleChecker+Valid, 6277 SdHoareTripleChecker+Invalid, 3942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1608 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-18 02:03:59,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3167 Valid, 6277 Invalid, 3942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2190 Invalid, 0 Unknown, 1608 Unchecked, 1.0s Time] [2022-01-18 02:04:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110408 states. [2022-01-18 02:04:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110408 to 30968. [2022-01-18 02:04:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30968 states, 30967 states have (on average 4.143798236832757) internal successors, (128321), 30967 states have internal predecessors, (128321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30968 states to 30968 states and 128321 transitions. [2022-01-18 02:04:01,701 INFO L78 Accepts]: Start accepts. Automaton has 30968 states and 128321 transitions. Word has length 143 [2022-01-18 02:04:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:01,702 INFO L470 AbstractCegarLoop]: Abstraction has 30968 states and 128321 transitions. [2022-01-18 02:04:01,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 7.8604651162790695) internal successors, (338), 43 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 30968 states and 128321 transitions. [2022-01-18 02:04:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 02:04:01,772 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:01,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:01,788 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-01-18 02:04:01,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-18 02:04:01,979 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1049396362, now seen corresponding path program 8 times [2022-01-18 02:04:01,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:01,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819227944] [2022-01-18 02:04:01,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:01,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 02:04:02,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:02,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819227944] [2022-01-18 02:04:02,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819227944] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:02,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113484108] [2022-01-18 02:04:02,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 02:04:02,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:02,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:04:02,045 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:04:02,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-18 02:04:02,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 02:04:02,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:04:02,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-18 02:04:02,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:04:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 02:04:02,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:04:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 02:04:02,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113484108] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:04:02,519 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:04:02,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-01-18 02:04:02,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777271562] [2022-01-18 02:04:02,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:04:02,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 02:04:02,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:02,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 02:04:02,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-18 02:04:02,520 INFO L87 Difference]: Start difference. First operand 30968 states and 128321 transitions. Second operand has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:04:03,181 INFO L93 Difference]: Finished difference Result 41375 states and 173574 transitions. [2022-01-18 02:04:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 02:04:03,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-18 02:04:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:04:03,275 INFO L225 Difference]: With dead ends: 41375 [2022-01-18 02:04:03,276 INFO L226 Difference]: Without dead ends: 24774 [2022-01-18 02:04:03,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-01-18 02:04:03,276 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 100 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:04:03,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 763 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:04:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24774 states. [2022-01-18 02:04:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24774 to 24764. [2022-01-18 02:04:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24764 states, 24763 states have (on average 4.126277106974115) internal successors, (102179), 24763 states have internal predecessors, (102179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24764 states to 24764 states and 102179 transitions. [2022-01-18 02:04:03,859 INFO L78 Accepts]: Start accepts. Automaton has 24764 states and 102179 transitions. Word has length 143 [2022-01-18 02:04:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:03,859 INFO L470 AbstractCegarLoop]: Abstraction has 24764 states and 102179 transitions. [2022-01-18 02:04:03,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 24764 states and 102179 transitions. [2022-01-18 02:04:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-18 02:04:03,918 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:03,918 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:03,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-18 02:04:04,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-18 02:04:04,119 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:04,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:04,119 INFO L85 PathProgramCache]: Analyzing trace with hash 225436057, now seen corresponding path program 9 times [2022-01-18 02:04:04,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:04,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011958992] [2022-01-18 02:04:04,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:04,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:04:04,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:04,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011958992] [2022-01-18 02:04:04,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011958992] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:04,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146182108] [2022-01-18 02:04:04,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 02:04:04,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:04,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:04:04,198 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:04:04,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-18 02:04:04,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-18 02:04:04,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:04:04,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 02:04:04,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:04:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:04:04,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:04:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:04:04,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146182108] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:04:04,727 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:04:04,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-01-18 02:04:04,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078534066] [2022-01-18 02:04:04,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:04:04,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-18 02:04:04,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:04,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-18 02:04:04,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-01-18 02:04:04,728 INFO L87 Difference]: Start difference. First operand 24764 states and 102179 transitions. Second operand has 19 states, 19 states have (on average 11.0) internal successors, (209), 19 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:04:06,381 INFO L93 Difference]: Finished difference Result 49980 states and 205385 transitions. [2022-01-18 02:04:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-18 02:04:06,381 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.0) internal successors, (209), 19 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2022-01-18 02:04:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:04:06,568 INFO L225 Difference]: With dead ends: 49980 [2022-01-18 02:04:06,568 INFO L226 Difference]: Without dead ends: 48125 [2022-01-18 02:04:06,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=864, Invalid=3168, Unknown=0, NotChecked=0, Total=4032 [2022-01-18 02:04:06,569 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 1297 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 3376 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 02:04:06,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1297 Valid, 3376 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-18 02:04:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48125 states. [2022-01-18 02:04:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48125 to 24859. [2022-01-18 02:04:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24859 states, 24858 states have (on average 4.1193177246761605) internal successors, (102398), 24858 states have internal predecessors, (102398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24859 states to 24859 states and 102398 transitions. [2022-01-18 02:04:07,627 INFO L78 Accepts]: Start accepts. Automaton has 24859 states and 102398 transitions. Word has length 148 [2022-01-18 02:04:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:07,628 INFO L470 AbstractCegarLoop]: Abstraction has 24859 states and 102398 transitions. [2022-01-18 02:04:07,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.0) internal successors, (209), 19 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 24859 states and 102398 transitions. [2022-01-18 02:04:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-18 02:04:07,685 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:07,685 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:07,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-18 02:04:07,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-18 02:04:07,886 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:07,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash -647156114, now seen corresponding path program 10 times [2022-01-18 02:04:07,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:07,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711908403] [2022-01-18 02:04:07,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:07,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:04:07,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:07,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711908403] [2022-01-18 02:04:07,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711908403] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:07,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760731735] [2022-01-18 02:04:07,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 02:04:07,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:07,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:04:07,971 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:04:07,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-18 02:04:08,063 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 02:04:08,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:04:08,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-18 02:04:08,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:04:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:04:08,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:04:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 02:04:08,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760731735] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:04:08,603 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:04:08,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-01-18 02:04:08,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169053473] [2022-01-18 02:04:08,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:04:08,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 02:04:08,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:08,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 02:04:08,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-01-18 02:04:08,604 INFO L87 Difference]: Start difference. First operand 24859 states and 102398 transitions. Second operand has 24 states, 24 states have (on average 9.75) internal successors, (234), 24 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:04:09,083 INFO L93 Difference]: Finished difference Result 41627 states and 174078 transitions. [2022-01-18 02:04:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-18 02:04:09,084 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.75) internal successors, (234), 24 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-01-18 02:04:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:04:09,219 INFO L225 Difference]: With dead ends: 41627 [2022-01-18 02:04:09,219 INFO L226 Difference]: Without dead ends: 41627 [2022-01-18 02:04:09,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2022-01-18 02:04:09,220 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 1023 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 02:04:09,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1023 Valid, 1280 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 02:04:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41627 states. [2022-01-18 02:04:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41627 to 35339. [2022-01-18 02:04:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35339 states, 35338 states have (on average 4.165430980813855) internal successors, (147198), 35338 states have internal predecessors, (147198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35339 states to 35339 states and 147198 transitions. [2022-01-18 02:04:10,263 INFO L78 Accepts]: Start accepts. Automaton has 35339 states and 147198 transitions. Word has length 155 [2022-01-18 02:04:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:10,263 INFO L470 AbstractCegarLoop]: Abstraction has 35339 states and 147198 transitions. [2022-01-18 02:04:10,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.75) internal successors, (234), 24 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 35339 states and 147198 transitions. [2022-01-18 02:04:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-18 02:04:10,342 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:10,342 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:10,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-01-18 02:04:10,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-18 02:04:10,543 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash -201771473, now seen corresponding path program 11 times [2022-01-18 02:04:10,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:10,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073836276] [2022-01-18 02:04:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:10,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 02:04:10,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:10,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073836276] [2022-01-18 02:04:10,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073836276] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:10,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939800531] [2022-01-18 02:04:10,639 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 02:04:10,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:10,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:04:10,640 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:04:10,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-18 02:04:10,745 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-18 02:04:10,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:04:10,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 02:04:10,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:04:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-18 02:04:11,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:04:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-18 02:04:11,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939800531] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:04:11,214 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:04:11,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-01-18 02:04:11,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108420048] [2022-01-18 02:04:11,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:04:11,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-18 02:04:11,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:11,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-18 02:04:11,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-18 02:04:11,216 INFO L87 Difference]: Start difference. First operand 35339 states and 147198 transitions. Second operand has 21 states, 21 states have (on average 12.0) internal successors, (252), 21 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:04:12,716 INFO L93 Difference]: Finished difference Result 88790 states and 374319 transitions. [2022-01-18 02:04:12,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-18 02:04:12,716 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 12.0) internal successors, (252), 21 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-18 02:04:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:04:13,074 INFO L225 Difference]: With dead ends: 88790 [2022-01-18 02:04:13,074 INFO L226 Difference]: Without dead ends: 88790 [2022-01-18 02:04:13,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=639, Invalid=1811, Unknown=0, NotChecked=0, Total=2450 [2022-01-18 02:04:13,075 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 1271 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 02:04:13,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1271 Valid, 2428 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-18 02:04:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88790 states. [2022-01-18 02:04:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88790 to 49659. [2022-01-18 02:04:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49659 states, 49658 states have (on average 4.2040758790124455) internal successors, (208766), 49658 states have internal predecessors, (208766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49659 states to 49659 states and 208766 transitions. [2022-01-18 02:04:15,258 INFO L78 Accepts]: Start accepts. Automaton has 49659 states and 208766 transitions. Word has length 160 [2022-01-18 02:04:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:04:15,258 INFO L470 AbstractCegarLoop]: Abstraction has 49659 states and 208766 transitions. [2022-01-18 02:04:15,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.0) internal successors, (252), 21 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:04:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 49659 states and 208766 transitions. [2022-01-18 02:04:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-18 02:04:15,391 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:04:15,391 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:04:15,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-18 02:04:15,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-18 02:04:15,599 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:04:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:04:15,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1462933140, now seen corresponding path program 12 times [2022-01-18 02:04:15,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:04:15,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369426811] [2022-01-18 02:04:15,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:04:15,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:04:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:04:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 02:04:15,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:04:15,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369426811] [2022-01-18 02:04:15,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369426811] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:04:15,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620461472] [2022-01-18 02:04:15,912 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 02:04:15,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:04:15,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:04:15,916 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:04:15,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-18 02:04:16,046 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 02:04:16,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 02:04:16,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-18 02:04:16,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:04:16,075 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-01-18 02:04:16,105 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 02:04:16,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 02:04:16,219 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 02:04:16,219 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-01-18 02:04:16,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:04:16,728 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 34 treesize of output 32 [2022-01-18 02:04:16,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-01-18 02:04:16,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:04:16,900 INFO L353 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2022-01-18 02:04:16,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 65 [2022-01-18 02:04:17,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:04:17,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-18 02:04:17,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 02:04:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 02:04:17,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:04:38,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 404 [2022-01-18 02:04:38,338 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 482 treesize of output 478 [2022-01-18 02:04:38,356 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 517 treesize of output 515 [2022-01-18 02:04:38,376 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:04:38,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 554 treesize of output 512 [2022-01-18 02:04:39,399 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-01-18 02:04:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 7 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 02:04:39,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620461472] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:04:39,441 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:04:39,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 26] total 62 [2022-01-18 02:04:39,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534884976] [2022-01-18 02:04:39,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:04:39,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-01-18 02:04:39,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:04:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-01-18 02:04:39,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=3393, Unknown=96, NotChecked=0, Total=3782 [2022-01-18 02:04:39,443 INFO L87 Difference]: Start difference. First operand 49659 states and 208766 transitions. Second operand has 62 states, 62 states have (on average 6.306451612903226) internal successors, (391), 62 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:07:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 02:07:19,215 INFO L93 Difference]: Finished difference Result 129727 states and 537791 transitions. [2022-01-18 02:07:19,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2022-01-18 02:07:19,215 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 6.306451612903226) internal successors, (391), 62 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-18 02:07:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 02:07:19,458 INFO L225 Difference]: With dead ends: 129727 [2022-01-18 02:07:19,458 INFO L226 Difference]: Without dead ends: 66571 [2022-01-18 02:07:19,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 352 SyntacticMatches, 64 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 19827 ImplicationChecksByTransitivity, 159.4s TimeCoverageRelationStatistics Valid=6936, Invalid=33904, Unknown=166, NotChecked=0, Total=41006 [2022-01-18 02:07:19,462 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 3295 mSDsluCounter, 9863 mSDsCounter, 0 mSdLazyCounter, 2822 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3295 SdHoareTripleChecker+Valid, 8672 SdHoareTripleChecker+Invalid, 8041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5032 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 02:07:19,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3295 Valid, 8672 Invalid, 8041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2822 Invalid, 0 Unknown, 5032 Unchecked, 1.3s Time] [2022-01-18 02:07:19,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66571 states. [2022-01-18 02:07:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66571 to 60132. [2022-01-18 02:07:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60132 states, 60131 states have (on average 4.050772480085147) internal successors, (243577), 60131 states have internal predecessors, (243577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:07:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60132 states to 60132 states and 243577 transitions. [2022-01-18 02:07:20,900 INFO L78 Accepts]: Start accepts. Automaton has 60132 states and 243577 transitions. Word has length 165 [2022-01-18 02:07:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 02:07:20,900 INFO L470 AbstractCegarLoop]: Abstraction has 60132 states and 243577 transitions. [2022-01-18 02:07:20,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 6.306451612903226) internal successors, (391), 62 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:07:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 60132 states and 243577 transitions. [2022-01-18 02:07:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-18 02:07:21,051 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 02:07:21,051 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 02:07:21,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-18 02:07:21,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-18 02:07:21,252 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 02:07:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 02:07:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash -494346104, now seen corresponding path program 13 times [2022-01-18 02:07:21,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 02:07:21,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342527793] [2022-01-18 02:07:21,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 02:07:21,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 02:07:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:07:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 02:07:21,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 02:07:21,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342527793] [2022-01-18 02:07:21,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342527793] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 02:07:21,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385017325] [2022-01-18 02:07:21,798 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 02:07:21,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 02:07:21,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 02:07:21,799 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 02:07:21,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-18 02:07:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 02:07:21,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-18 02:07:21,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 02:07:21,934 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-01-18 02:07:21,961 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 02:07:21,961 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-01-18 02:07:21,997 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 02:07:21,997 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-01-18 02:07:22,263 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-18 02:07:22,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-01-18 02:07:22,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-01-18 02:07:22,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:22,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-01-18 02:07:23,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 02:07:23,045 INFO L353 Elim1Store]: treesize reduction 46, result has 41.8 percent of original size [2022-01-18 02:07:23,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 63 [2022-01-18 02:07:23,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 02:07:23,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-18 02:07:23,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 02:07:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 02:07:23,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 02:07:25,592 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_57| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_57|)) (forall ((v_ArrVal_760 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))))) is different from false [2022-01-18 02:07:31,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_760 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_57| Int) (v_ArrVal_758 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse0 (select (store (store .cse1 .cse2 v_ArrVal_758) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_57| (+ |c_thread3Thread1of1ForFork3_~i~2#1| 1)) (not (<= (select .cse1 .cse2) (+ v_ArrVal_758 1))))))) is different from false [2022-01-18 02:07:31,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_756 (Array Int Int)) (v_ArrVal_760 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_57| Int) (v_ArrVal_758 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_756) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_758) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_57| 1) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_758 1))) (<= 2147483647 .cse0))))) is different from false [2022-01-18 02:07:31,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_760 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_57| Int) (v_ArrVal_758 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_756) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_758) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_57| 1) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_758 1))) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2022-01-18 02:07:32,682 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_760 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_57| Int) (v_ArrVal_758 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_756) c_~A~0.base))) (let ((.cse0 (select (store (store .cse2 c_~A~0.offset v_ArrVal_758) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (<= 2147483647 .cse0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_756) c_~A~0.base) c_~A~0.offset v_ArrVal_758) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset) 1))))) (or (<= c_~min~0 (+ .cse0 1)) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))))) (< |v_thread3Thread1of1ForFork3_~i~2#1_57| 1) (not (<= (select .cse2 c_~A~0.offset) (+ v_ArrVal_758 1))))))) is different from false [2022-01-18 02:07:41,260 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_760 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_57| Int) (v_ArrVal_758 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_756) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_758) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_57| 1) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_758 1))) (let ((.cse8 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse4 (< c_~min~0 .cse8)) (.cse3 (+ .cse0 1))) (and (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse2) (<= .cse2 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_756) c_~A~0.base) c_~A~0.offset v_ArrVal_758) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset) 1))))) (or (<= c_~min~0 .cse3) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))))) (not .cse4)) (or .cse4 (and (forall ((v_subst_3 Int)) (let ((.cse5 (select |c_#memory_int| c_~A~0.base))) (let ((.cse6 (select .cse5 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< (select .cse5 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) .cse6) (<= .cse6 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_756) c_~A~0.base) c_~A~0.offset v_ArrVal_758) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset) 1)))))) (or (forall ((v_subst_4 Int)) (not (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (< (select .cse7 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) (select .cse7 (+ c_~A~0.offset (* 4 v_subst_4))))))) (<= .cse8 .cse3))))))))))) is different from false [2022-01-18 02:07:55,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_760 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_57| Int) (v_ArrVal_758 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_756) c_~A~0.base))) (let ((.cse0 (select (store (store .cse8 c_~A~0.offset v_ArrVal_758) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_57| 1) (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (< c_~min~0 .cse5)) (.cse2 (+ .cse0 1))) (and (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_756) c_~A~0.base) c_~A~0.offset v_ArrVal_758) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset) 1))))) (or (<= c_~min~0 .cse2) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))))) (not .cse3)) (or .cse3 (and (or (forall ((v_subst_4 Int)) (not (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (< (select .cse4 c_~A~0.offset) (select .cse4 (+ c_~A~0.offset (* 4 v_subst_4))))))) (<= .cse5 .cse2)) (forall ((v_subst_3 Int)) (let ((.cse6 (select |c_#memory_int| c_~A~0.base))) (let ((.cse7 (select .cse6 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< (select .cse6 c_~A~0.offset) .cse7) (<= .cse7 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_756) c_~A~0.base) c_~A~0.offset v_ArrVal_758) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset) 1))))))))))) (not (<= (select .cse8 c_~A~0.offset) (+ v_ArrVal_758 1))))))) is different from false [2022-01-18 02:08:05,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 404 [2022-01-18 02:08:05,532 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 482 treesize of output 478 [2022-01-18 02:08:05,537 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 517 treesize of output 515 [2022-01-18 02:08:05,562 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 02:08:05,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 554 treesize of output 512 [2022-01-18 02:08:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 11 not checked. [2022-01-18 02:08:08,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385017325] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 02:08:08,430 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 02:08:08,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 24] total 65 [2022-01-18 02:08:08,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183069981] [2022-01-18 02:08:08,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 02:08:08,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-18 02:08:08,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 02:08:08,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-18 02:08:08,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3074, Unknown=12, NotChecked=826, Total=4160 [2022-01-18 02:08:08,432 INFO L87 Difference]: Start difference. First operand 60132 states and 243577 transitions. Second operand has 65 states, 65 states have (on average 6.292307692307692) internal successors, (409), 65 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 02:08:12,602 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) (.cse2 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse4 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select .cse0 .cse1) 1)) .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~A~0.base)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse2 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= (select .cse0 c_~A~0.offset) c_~min~0) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~min~0 (+ (select .cse0 0) 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_57| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_57|)) (forall ((v_ArrVal_760 Int)) (let ((.cse3 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (<= 2147483647 .cse3) (<= c_~min~0 (+ .cse3 1))))))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t4~0#1.base|) 0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-01-18 02:08:15,065 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) (.cse2 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse4 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select .cse0 .cse1) 1)) .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~A~0.base)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse2 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= (select .cse0 c_~A~0.offset) c_~min~0) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= c_thread1Thread1of1ForFork0_~i~0 0) (<= c_~min~0 (+ (select .cse0 0) 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_57| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_57|)) (forall ((v_ArrVal_760 Int)) (let ((.cse3 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (<= 2147483647 .cse3) (<= c_~min~0 (+ .cse3 1))))))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t4~0#1.base|) 0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-01-18 02:08:18,376 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) (.cse2 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse4 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select .cse0 .cse1) 1)) .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~A~0.base)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= .cse1 0) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse2 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~min~0 (+ (select .cse0 0) 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_57| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_57|)) (forall ((v_ArrVal_760 Int)) (let ((.cse3 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (<= 2147483647 .cse3) (<= c_~min~0 (+ .cse3 1))))))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t4~0#1.base|) 0)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-01-18 02:08:21,378 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) (.cse0 (select |c_#memory_int| c_~A~0.base))) (and (<= c_~min~0 (+ (select .cse0 .cse1) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~A~0.base)) (= .cse1 0) (<= c_~min~0 (+ (select .cse0 0) 1)) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_57| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_57|)) (forall ((v_ArrVal_760 Int)) (let ((.cse2 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (<= 2147483647 .cse2) (<= c_~min~0 (+ .cse2 1))))))) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0))) is different from false [2022-01-18 02:08:23,385 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) (.cse0 (select |c_#memory_int| c_~A~0.base))) (and (<= c_~min~0 (+ (select .cse0 .cse1) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~A~0.base)) (= .cse1 0) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~min~0 (+ (select .cse0 0) 1)) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_57| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_57|)) (forall ((v_ArrVal_760 Int)) (let ((.cse2 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_57| 4)) v_ArrVal_760) c_~A~0.offset))) (or (<= 2147483647 .cse2) (<= c_~min~0 (+ .cse2 1))))))) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0))) is different from false