/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-bc289cb [2022-01-28 13:18:50,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-28 13:18:50,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-28 13:18:50,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-28 13:18:50,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-28 13:18:50,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-28 13:18:50,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-28 13:18:50,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-28 13:18:50,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-28 13:18:50,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-28 13:18:50,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-28 13:18:50,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-28 13:18:50,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-28 13:18:50,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-28 13:18:50,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-28 13:18:50,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-28 13:18:50,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-28 13:18:50,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-28 13:18:50,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-28 13:18:50,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-28 13:18:50,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-28 13:18:50,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-28 13:18:50,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-28 13:18:50,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-28 13:18:50,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-28 13:18:50,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-28 13:18:50,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-28 13:18:50,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-28 13:18:50,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-28 13:18:50,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-28 13:18:50,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-28 13:18:50,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-28 13:18:50,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-28 13:18:50,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-28 13:18:50,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-28 13:18:50,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-28 13:18:50,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-28 13:18:50,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-28 13:18:50,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-28 13:18:50,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-28 13:18:50,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-28 13:18:50,983 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-28 13:18:51,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-28 13:18:51,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-28 13:18:51,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-28 13:18:51,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-28 13:18:51,007 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-28 13:18:51,007 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-28 13:18:51,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-28 13:18:51,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-28 13:18:51,017 INFO L138 SettingsManager]: * Use SBE=true [2022-01-28 13:18:51,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-28 13:18:51,017 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-28 13:18:51,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-28 13:18:51,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-28 13:18:51,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-28 13:18:51,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-28 13:18:51,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-28 13:18:51,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-28 13:18:51,018 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-28 13:18:51,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-28 13:18:51,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-28 13:18:51,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-28 13:18:51,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-28 13:18:51,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-28 13:18:51,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-28 13:18:51,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-28 13:18:51,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 13:18:51,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-28 13:18:51,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-28 13:18:51,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-28 13:18:51,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-28 13:18:51,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-28 13:18:51,020 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-28 13:18:51,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-28 13:18:51,020 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-28 13:18:51,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-28 13:18:51,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-28 13:18:51,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-28 13:18:51,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-28 13:18:51,248 INFO L275 PluginConnector]: CDTParser initialized [2022-01-28 13:18:51,249 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-28 13:18:51,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e804c886/fef50495184d477f9ee9186ba1cc70c2/FLAG38f6e9887 [2022-01-28 13:18:51,649 INFO L306 CDTParser]: Found 1 translation units. [2022-01-28 13:18:51,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-01-28 13:18:51,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e804c886/fef50495184d477f9ee9186ba1cc70c2/FLAG38f6e9887 [2022-01-28 13:18:51,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e804c886/fef50495184d477f9ee9186ba1cc70c2 [2022-01-28 13:18:51,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-28 13:18:51,669 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-28 13:18:51,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-28 13:18:51,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-28 13:18:51,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-28 13:18:51,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:51,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660e7b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51, skipping insertion in model container [2022-01-28 13:18:51,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:51,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-28 13:18:51,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-28 13:18:51,882 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-28 13:18:51,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 13:18:51,903 INFO L203 MainTranslator]: Completed pre-run [2022-01-28 13:18:51,947 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-28 13:18:51,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 13:18:51,961 INFO L208 MainTranslator]: Completed translation [2022-01-28 13:18:51,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51 WrapperNode [2022-01-28 13:18:51,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-28 13:18:51,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-28 13:18:51,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-28 13:18:51,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-28 13:18:51,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:51,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:52,003 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-01-28 13:18:52,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-28 13:18:52,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-28 13:18:52,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-28 13:18:52,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-28 13:18:52,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:52,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:52,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:52,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:52,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:52,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:52,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:52,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-28 13:18:52,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-28 13:18:52,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-28 13:18:52,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-28 13:18:52,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51" (1/1) ... [2022-01-28 13:18:52,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 13:18:52,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:18:52,088 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-28 13:18:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-28 13:18:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-28 13:18:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-28 13:18:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-28 13:18:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-28 13:18:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-28 13:18:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-28 13:18:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-28 13:18:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-28 13:18:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-28 13:18:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-28 13:18:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-28 13:18:52,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-28 13:18:52,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-28 13:18:52,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-28 13:18:52,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-28 13:18:52,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-28 13:18:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-28 13:18:52,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-28 13:18:52,183 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-28 13:18:52,157 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-28 13:18:52,297 INFO L234 CfgBuilder]: Building ICFG [2022-01-28 13:18:52,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-28 13:18:52,455 INFO L275 CfgBuilder]: Performing block encoding [2022-01-28 13:18:52,529 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-28 13:18:52,529 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-28 13:18:52,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:18:52 BoogieIcfgContainer [2022-01-28 13:18:52,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-28 13:18:52,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-28 13:18:52,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-28 13:18:52,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-28 13:18:52,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 01:18:51" (1/3) ... [2022-01-28 13:18:52,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a9b95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:18:52, skipping insertion in model container [2022-01-28 13:18:52,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:18:51" (2/3) ... [2022-01-28 13:18:52,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a9b95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:18:52, skipping insertion in model container [2022-01-28 13:18:52,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:18:52" (3/3) ... [2022-01-28 13:18:52,538 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2022-01-28 13:18:52,541 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-28 13:18:52,541 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-28 13:18:52,541 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-28 13:18:52,541 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-28 13:18:52,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,578 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,578 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,578 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,579 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,579 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,579 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,580 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,580 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,580 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,580 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,580 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,581 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,581 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,582 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,582 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,582 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,582 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,582 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,583 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,583 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,583 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,584 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,584 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,584 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,584 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,585 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,585 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,586 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,587 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,587 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,587 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,589 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-28 13:18:52,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,591 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-28 13:18:52,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,599 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,600 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,600 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,600 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,603 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,604 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,604 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,604 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,605 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,605 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,605 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,605 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,605 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,605 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,605 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,605 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,608 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-28 13:18:52,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:18:52,614 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-28 13:18:52,646 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-28 13:18:52,653 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-28 13:18:52,653 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-28 13:18:52,666 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 172 transitions, 376 flow [2022-01-28 13:18:53,717 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-28 13:18:53,855 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-28 13:18:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-28 13:18:54,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:18:54,084 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-28 13:18:54,085 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-28 13:18:54,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:18:54,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1420994164, now seen corresponding path program 1 times [2022-01-28 13:18:54,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:18:54,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257624492] [2022-01-28 13:18:54,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:18:54,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:18:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:18:54,270 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-28 13:18:54,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:18:54,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257624492] [2022-01-28 13:18:54,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257624492] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:18:54,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:18:54,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 13:18:54,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393077523] [2022-01-28 13:18:54,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:18:54,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-28 13:18:54,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:18:54,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-28 13:18:54,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-28 13:18:54,348 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-28 13:18:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:18:54,836 INFO L93 Difference]: Finished difference Result 26140 states and 111710 transitions. [2022-01-28 13:18:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-28 13:18:54,838 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-28 13:18:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:18:55,208 INFO L225 Difference]: With dead ends: 26140 [2022-01-28 13:18:55,208 INFO L226 Difference]: Without dead ends: 26136 [2022-01-28 13:18:55,209 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-28 13:18:55,213 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-28 13:18:55,215 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-28 13:18:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26136 states. [2022-01-28 13:18:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26136 to 26136. [2022-01-28 13:18:56,110 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-28 13:18:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26136 states to 26136 states and 111706 transitions. [2022-01-28 13:18:56,504 INFO L78 Accepts]: Start accepts. Automaton has 26136 states and 111706 transitions. Word has length 121 [2022-01-28 13:18:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:18:56,504 INFO L470 AbstractCegarLoop]: Abstraction has 26136 states and 111706 transitions. [2022-01-28 13:18:56,505 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-28 13:18:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26136 states and 111706 transitions. [2022-01-28 13:18:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-28 13:18:56,735 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:18:56,735 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-28 13:18:56,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-28 13:18:56,736 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-28 13:18:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:18:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash -507464182, now seen corresponding path program 1 times [2022-01-28 13:18:56,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:18:56,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705094366] [2022-01-28 13:18:56,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:18:56,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:18:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:18:57,037 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-28 13:18:57,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:18:57,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705094366] [2022-01-28 13:18:57,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705094366] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:18:57,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:18:57,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 13:18:57,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499534969] [2022-01-28 13:18:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:18:57,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 13:18:57,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:18:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 13:18:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-28 13:18:57,040 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-28 13:18:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:18:57,538 INFO L93 Difference]: Finished difference Result 35136 states and 150562 transitions. [2022-01-28 13:18:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 13:18:57,538 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-28 13:18:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:18:57,844 INFO L225 Difference]: With dead ends: 35136 [2022-01-28 13:18:57,844 INFO L226 Difference]: Without dead ends: 35136 [2022-01-28 13:18:57,844 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-28 13:18:57,845 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 352 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-28 13:18:57,846 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-28 13:18:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35136 states. [2022-01-28 13:18:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35136 to 28386. [2022-01-28 13:18:58,894 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-28 13:18:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28386 states to 28386 states and 121420 transitions. [2022-01-28 13:18:59,035 INFO L78 Accepts]: Start accepts. Automaton has 28386 states and 121420 transitions. Word has length 121 [2022-01-28 13:18:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:18:59,035 INFO L470 AbstractCegarLoop]: Abstraction has 28386 states and 121420 transitions. [2022-01-28 13:18:59,036 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-28 13:18:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 28386 states and 121420 transitions. [2022-01-28 13:18:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-28 13:18:59,120 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:18:59,120 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-28 13:18:59,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-28 13:18:59,121 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-28 13:18:59,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:18:59,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1313580435, now seen corresponding path program 1 times [2022-01-28 13:18:59,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:18:59,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551934758] [2022-01-28 13:18:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:18:59,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:18:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:18:59,198 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-28 13:18:59,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:18:59,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551934758] [2022-01-28 13:18:59,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551934758] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:18:59,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:18:59,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-28 13:18:59,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630729295] [2022-01-28 13:18:59,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:18:59,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 13:18:59,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:18:59,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 13:18:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-28 13:18:59,200 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-28 13:18:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:18:59,829 INFO L93 Difference]: Finished difference Result 37401 states and 158042 transitions. [2022-01-28 13:18:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-28 13:18:59,829 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-28 13:18:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:19:00,187 INFO L225 Difference]: With dead ends: 37401 [2022-01-28 13:19:00,187 INFO L226 Difference]: Without dead ends: 28392 [2022-01-28 13:19:00,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-28 13:19:00,188 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 425 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-01-28 13:19:00,188 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.4s Time] [2022-01-28 13:19:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28392 states. [2022-01-28 13:19:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28392 to 28387. [2022-01-28 13:19:01,011 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-28 13:19:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28387 states to 28387 states and 121421 transitions. [2022-01-28 13:19:01,356 INFO L78 Accepts]: Start accepts. Automaton has 28387 states and 121421 transitions. Word has length 126 [2022-01-28 13:19:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:19:01,356 INFO L470 AbstractCegarLoop]: Abstraction has 28387 states and 121421 transitions. [2022-01-28 13:19:01,356 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-28 13:19:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 28387 states and 121421 transitions. [2022-01-28 13:19:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-28 13:19:01,437 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:19:01,437 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-28 13:19:01,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-28 13:19:01,437 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-28 13:19:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:19:01,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1766570838, now seen corresponding path program 1 times [2022-01-28 13:19:01,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:19:01,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015822822] [2022-01-28 13:19:01,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:19:01,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:19:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:19:01,560 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-28 13:19:01,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:19:01,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015822822] [2022-01-28 13:19:01,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015822822] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:19:01,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886190266] [2022-01-28 13:19:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:19:01,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:19:01,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:19:01,563 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-28 13:19:01,564 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-28 13:19:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:19:01,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-28 13:19:01,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:19:02,035 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-28 13:19:02,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:19:02,348 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-28 13:19:02,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886190266] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-28 13:19:02,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-28 13:19:02,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-28 13:19:02,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53839773] [2022-01-28 13:19:02,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:19:02,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 13:19:02,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:19:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 13:19:02,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-28 13:19:02,350 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-28 13:19:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:19:02,813 INFO L93 Difference]: Finished difference Result 30943 states and 132410 transitions. [2022-01-28 13:19:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 13:19:02,814 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-28 13:19:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:19:02,949 INFO L225 Difference]: With dead ends: 30943 [2022-01-28 13:19:02,949 INFO L226 Difference]: Without dead ends: 30943 [2022-01-28 13:19:02,949 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-28 13:19:02,950 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-28 13:19:02,951 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-28 13:19:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2022-01-28 13:19:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 30943. [2022-01-28 13:19:03,714 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-28 13:19:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30943 states to 30943 states and 132410 transitions. [2022-01-28 13:19:04,017 INFO L78 Accepts]: Start accepts. Automaton has 30943 states and 132410 transitions. Word has length 133 [2022-01-28 13:19:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:19:04,019 INFO L470 AbstractCegarLoop]: Abstraction has 30943 states and 132410 transitions. [2022-01-28 13:19:04,019 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-28 13:19:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 30943 states and 132410 transitions. [2022-01-28 13:19:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-28 13:19:04,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:19:04,130 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-28 13:19:04,149 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-28 13:19:04,343 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-28 13:19:04,343 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-28 13:19:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:19:04,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1027911653, now seen corresponding path program 1 times [2022-01-28 13:19:04,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:19:04,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921033879] [2022-01-28 13:19:04,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:19:04,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:19:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:19:04,450 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-28 13:19:04,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:19:04,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921033879] [2022-01-28 13:19:04,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921033879] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:19:04,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593926363] [2022-01-28 13:19:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:19:04,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:19:04,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:19:04,453 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-28 13:19:04,455 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-28 13:19:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:19:04,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-28 13:19:04,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:19:04,764 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-28 13:19:04,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:19:05,026 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-28 13:19:05,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593926363] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-28 13:19:05,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-28 13:19:05,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-28 13:19:05,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891240378] [2022-01-28 13:19:05,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:19:05,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 13:19:05,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:19:05,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 13:19:05,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-28 13:19:05,029 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-28 13:19:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:19:05,493 INFO L93 Difference]: Finished difference Result 34267 states and 146807 transitions. [2022-01-28 13:19:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 13:19:05,493 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-28 13:19:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:19:05,616 INFO L225 Difference]: With dead ends: 34267 [2022-01-28 13:19:05,616 INFO L226 Difference]: Without dead ends: 34267 [2022-01-28 13:19:05,617 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-28 13:19:05,617 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.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:19:05,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 410 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:19:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34267 states. [2022-01-28 13:19:06,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34267 to 34267. [2022-01-28 13:19:06,643 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-28 13:19:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34267 states to 34267 states and 146807 transitions. [2022-01-28 13:19:06,772 INFO L78 Accepts]: Start accepts. Automaton has 34267 states and 146807 transitions. Word has length 138 [2022-01-28 13:19:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:19:06,773 INFO L470 AbstractCegarLoop]: Abstraction has 34267 states and 146807 transitions. [2022-01-28 13:19:06,773 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-28 13:19:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 34267 states and 146807 transitions. [2022-01-28 13:19:06,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-28 13:19:06,856 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:19:06,856 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-28 13:19:06,880 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-28 13:19:07,058 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-28 13:19:07,058 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-28 13:19:07,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:19:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash 334563494, now seen corresponding path program 1 times [2022-01-28 13:19:07,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:19:07,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279303854] [2022-01-28 13:19:07,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:19:07,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:19:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:19:07,404 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-28 13:19:07,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:19:07,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279303854] [2022-01-28 13:19:07,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279303854] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:19:07,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078675957] [2022-01-28 13:19:07,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:19:07,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:19:07,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:19:07,408 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-28 13:19:07,438 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-28 13:19:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:19:07,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-28 13:19:07,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:19:07,759 INFO L388 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-28 13:19:08,074 INFO L388 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-28 13:19:08,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:19:08,226 INFO L388 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-28 13:19:08,251 INFO L388 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-28 13:19:08,345 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-28 13:19:08,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:19:08,574 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-28 13:19:08,714 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)))) (.cse1 (+ .cse0 1))) (and (or (<= c_~min~0 .cse1) (<= .cse2 c_~min~0)) (or (< c_~min~0 .cse2) (<= .cse2 .cse1))))))) is different from false [2022-01-28 13:19:08,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse2 (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 (let ((.cse1 (+ .cse2 1)) (.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (or (< c_~min~0 .cse0) (<= .cse0 .cse1)) (or (<= c_~min~0 .cse1) (<= .cse0 c_~min~0)))) (<= 2147483647 .cse2)))) is different from false [2022-01-28 13:19:08,817 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) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1))))) is different from false [2022-01-28 13:19:08,835 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_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= (select (select .cse1 c_~A~0.base) c_~A~0.offset) (+ .cse0 1)))))) is different from false [2022-01-28 13:19:08,864 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_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (or (<= 2147483647 .cse0) (<= (select (select .cse1 |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) (+ .cse0 1)))))) is different from false [2022-01-28 13:19:08,880 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-28 13:19:08,889 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_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-01-28 13:19:08,932 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:19:08,933 INFO L388 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-28 13:19:08,937 INFO L388 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-28 13:19:08,945 INFO L388 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-28 13:19:08,951 INFO L388 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-28 13:19:09,059 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-28 13:19:09,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078675957] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:19:09,059 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:19:09,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 41 [2022-01-28 13:19:09,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688755495] [2022-01-28 13:19:09,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:19:09,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-28 13:19:09,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:19:09,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-28 13:19:09,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=951, Unknown=8, NotChecked=552, Total=1640 [2022-01-28 13:19:09,061 INFO L87 Difference]: Start difference. First operand 34267 states and 146807 transitions. Second operand has 41 states, 41 states have (on average 8.536585365853659) internal successors, (350), 41 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-28 13:19:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:19:16,059 INFO L93 Difference]: Finished difference Result 355438 states and 1535067 transitions. [2022-01-28 13:19:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-28 13:19:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 8.536585365853659) internal successors, (350), 41 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-28 13:19:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:19:17,633 INFO L225 Difference]: With dead ends: 355438 [2022-01-28 13:19:17,634 INFO L226 Difference]: Without dead ends: 202233 [2022-01-28 13:19:17,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 266 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1254, Invalid=4172, Unknown=8, NotChecked=1208, Total=6642 [2022-01-28 13:19:17,638 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1781 mSDsluCounter, 5498 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1781 SdHoareTripleChecker+Valid, 5343 SdHoareTripleChecker+Invalid, 6737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4798 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-28 13:19:17,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1781 Valid, 5343 Invalid, 6737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1872 Invalid, 0 Unknown, 4798 Unchecked, 0.9s Time] [2022-01-28 13:19:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202233 states. [2022-01-28 13:19:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202233 to 35973. [2022-01-28 13:19:21,884 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-28 13:19:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35973 states to 35973 states and 152467 transitions. [2022-01-28 13:19:22,019 INFO L78 Accepts]: Start accepts. Automaton has 35973 states and 152467 transitions. Word has length 143 [2022-01-28 13:19:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:19:22,020 INFO L470 AbstractCegarLoop]: Abstraction has 35973 states and 152467 transitions. [2022-01-28 13:19:22,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.536585365853659) internal successors, (350), 41 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-28 13:19:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 35973 states and 152467 transitions. [2022-01-28 13:19:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-28 13:19:22,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:19:22,103 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-28 13:19:22,122 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-28 13:19:22,310 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-28 13:19:22,311 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-28 13:19:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:19:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 940179670, now seen corresponding path program 2 times [2022-01-28 13:19:22,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:19:22,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648632276] [2022-01-28 13:19:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:19:22,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:19:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:19:22,609 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-28 13:19:22,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:19:22,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648632276] [2022-01-28 13:19:22,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648632276] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:19:22,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182670875] [2022-01-28 13:19:22,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:19:22,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:19:22,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:19:22,624 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-28 13:19:22,664 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-28 13:19:22,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:19:22,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:19:22,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-28 13:19:22,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:19:23,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:19:23,636 INFO L388 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-28 13:19:23,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:19:23,683 INFO L388 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-28 13:19:23,701 INFO L388 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-28 13:19:23,800 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-28 13:19:23,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:19:24,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_228 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_228) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-01-28 13:19:24,047 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_228) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-01-28 13:19:24,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_228) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse2 (+ .cse0 1)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (and (or (<= .cse1 .cse2) (< c_~min~0 .cse1)) (or (<= c_~min~0 .cse2) (<= .cse1 c_~min~0))))))) is different from false [2022-01-28 13:19:24,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_228) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (+ .cse2 1)) (.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (or (< c_~min~0 .cse0) (<= .cse0 .cse1)) (or (<= c_~min~0 .cse1) (<= .cse0 c_~min~0)))) (<= 2147483647 .cse2)))) is different from false [2022-01-28 13:19:24,254 INFO L388 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 113 treesize of output 97 [2022-01-28 13:19:24,258 INFO L388 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 53 treesize of output 49 [2022-01-28 13:19:24,260 INFO L388 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 89 treesize of output 81 [2022-01-28 13:19:24,638 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-28 13:19:24,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182670875] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:19:24,638 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:19:24,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 41 [2022-01-28 13:19:24,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201197489] [2022-01-28 13:19:24,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:19:24,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-28 13:19:24,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:19:24,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-28 13:19:24,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1207, Unknown=4, NotChecked=292, Total=1640 [2022-01-28 13:19:24,640 INFO L87 Difference]: Start difference. First operand 35973 states and 152467 transitions. Second operand has 41 states, 41 states have (on average 8.414634146341463) internal successors, (345), 41 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:19:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:19:30,566 INFO L93 Difference]: Finished difference Result 331824 states and 1430797 transitions. [2022-01-28 13:19:30,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-28 13:19:30,566 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 8.414634146341463) internal successors, (345), 41 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-28 13:19:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:19:31,948 INFO L225 Difference]: With dead ends: 331824 [2022-01-28 13:19:31,948 INFO L226 Difference]: Without dead ends: 169212 [2022-01-28 13:19:31,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 266 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1529, Invalid=5289, Unknown=4, NotChecked=660, Total=7482 [2022-01-28 13:19:31,951 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 2598 mSDsluCounter, 5353 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2598 SdHoareTripleChecker+Valid, 5347 SdHoareTripleChecker+Invalid, 3875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1972 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-28 13:19:31,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2598 Valid, 5347 Invalid, 3875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1757 Invalid, 0 Unknown, 1972 Unchecked, 0.8s Time] [2022-01-28 13:19:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169212 states. [2022-01-28 13:19:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169212 to 36063. [2022-01-28 13:19:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36063 states, 36062 states have (on average 4.223753535577616) internal successors, (152317), 36062 states have internal predecessors, (152317), 0 states have call successors, (0), 0 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-28 13:19:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36063 states to 36063 states and 152317 transitions. [2022-01-28 13:19:35,709 INFO L78 Accepts]: Start accepts. Automaton has 36063 states and 152317 transitions. Word has length 143 [2022-01-28 13:19:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:19:35,710 INFO L470 AbstractCegarLoop]: Abstraction has 36063 states and 152317 transitions. [2022-01-28 13:19:35,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.414634146341463) internal successors, (345), 41 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:19:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 36063 states and 152317 transitions. [2022-01-28 13:19:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-28 13:19:36,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:19:36,344 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-28 13:19:36,365 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-28 13:19:36,545 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-28 13:19:36,545 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-28 13:19:36,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:19:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash -263687870, now seen corresponding path program 3 times [2022-01-28 13:19:36,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:19:36,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954116286] [2022-01-28 13:19:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:19:36,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:19:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:19:36,877 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-28 13:19:36,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:19:36,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954116286] [2022-01-28 13:19:36,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954116286] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:19:36,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464759055] [2022-01-28 13:19:36,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:19:36,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:19:36,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:19:36,879 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-28 13:19:36,881 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-28 13:19:37,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-28 13:19:37,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:19:37,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-28 13:19:37,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:19:37,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:19:37,784 INFO L388 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-28 13:19:37,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:19:37,859 INFO L388 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-28 13:19:37,933 INFO L388 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-28 13:19:38,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:19:38,023 INFO L388 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-28 13:19:38,052 INFO L388 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-28 13:19:38,119 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-28 13:19:38,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:19:38,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_277 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_277) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-01-28 13:19:38,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_275 Int) (v_ArrVal_277 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork3_~i~2#1| 4)))) (let ((.cse2 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 .cse1 v_ArrVal_275)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_277) c_~A~0.base) c_~A~0.offset))) (or (< (+ v_ArrVal_275 1) (select .cse0 .cse1)) (<= c_~min~0 (+ .cse2 1)) (<= 2147483647 .cse2))))) is different from false [2022-01-28 13:19:38,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_275 Int) (v_ArrVal_277 (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_275)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_277) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (< (+ v_ArrVal_275 1) (select .cse1 c_~A~0.offset)))))) is different from false [2022-01-28 13:19:38,380 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_275 Int) (v_ArrVal_274 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_274))) (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_275)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_277) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (< (+ v_ArrVal_275 1) (select .cse1 c_~A~0.offset)) (<= 2147483647 .cse0)))))) is different from false [2022-01-28 13:19:38,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_275 Int) (v_ArrVal_274 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_274))) (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_275)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_277) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (< (+ v_ArrVal_275 1) (select .cse1 c_~A~0.offset)) (<= c_~min~0 (+ .cse0 1))))))) is different from false [2022-01-28 13:19:38,706 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_275 Int) (v_ArrVal_274 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_274))) (let ((.cse3 (select .cse4 c_~A~0.base))) (let ((.cse2 (select (select (store (store .cse4 c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_275)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_277) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (+ .cse2 1)) (.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (and (or (<= .cse0 c_~min~0) (<= c_~min~0 .cse1)) (or (<= .cse0 .cse1) (< c_~min~0 .cse0)))) (<= 2147483647 .cse2) (< (+ v_ArrVal_275 1) (select .cse3 c_~A~0.offset))))))) is different from false [2022-01-28 13:19:39,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_275 Int) (v_ArrVal_274 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_274))) (let ((.cse3 (select .cse4 c_~A~0.base))) (let ((.cse2 (select (select (store (store .cse4 c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_275)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_277) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (+ .cse2 1)) (.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (or (<= .cse0 c_~min~0) (<= c_~min~0 .cse1)) (or (<= .cse0 .cse1) (< c_~min~0 .cse0)))) (<= 2147483647 .cse2) (< (+ v_ArrVal_275 1) (select .cse3 c_~A~0.offset))))))) is different from false [2022-01-28 13:19:39,191 INFO L388 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 652 treesize of output 580 [2022-01-28 13:19:39,204 INFO L388 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 459 treesize of output 427 [2022-01-28 13:19:39,214 INFO L388 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 61 treesize of output 57 [2022-01-28 13:19:39,220 INFO L388 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 118 treesize of output 110 [2022-01-28 13:19:43,007 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-28 13:19:43,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464759055] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:19:43,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:19:43,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 52 [2022-01-28 13:19:43,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670280227] [2022-01-28 13:19:43,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:19:43,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-28 13:19:43,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:19:43,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-28 13:19:43,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1800, Unknown=7, NotChecked=644, Total=2652 [2022-01-28 13:19:43,009 INFO L87 Difference]: Start difference. First operand 36063 states and 152317 transitions. Second operand has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:19:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:19:53,001 INFO L93 Difference]: Finished difference Result 426104 states and 1839998 transitions. [2022-01-28 13:19:53,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-28 13:19:53,002 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-28 13:19:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:19:55,268 INFO L225 Difference]: With dead ends: 426104 [2022-01-28 13:19:55,268 INFO L226 Difference]: Without dead ends: 276596 [2022-01-28 13:19:55,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 255 SyntacticMatches, 11 SemanticMatches, 113 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2518, Invalid=9059, Unknown=7, NotChecked=1526, Total=13110 [2022-01-28 13:19:55,271 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 4597 mSDsluCounter, 6529 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4597 SdHoareTripleChecker+Valid, 6493 SdHoareTripleChecker+Invalid, 6924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4254 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-28 13:19:55,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4597 Valid, 6493 Invalid, 6924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 2404 Invalid, 0 Unknown, 4254 Unchecked, 1.6s Time] [2022-01-28 13:19:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276596 states. [2022-01-28 13:20:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276596 to 35828. [2022-01-28 13:20:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35828 states, 35827 states have (on average 4.233622686800458) internal successors, (151678), 35827 states have internal predecessors, (151678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:20:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35828 states to 35828 states and 151678 transitions. [2022-01-28 13:20:00,654 INFO L78 Accepts]: Start accepts. Automaton has 35828 states and 151678 transitions. Word has length 143 [2022-01-28 13:20:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:20:00,654 INFO L470 AbstractCegarLoop]: Abstraction has 35828 states and 151678 transitions. [2022-01-28 13:20:00,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 6.538461538461538) internal successors, (340), 52 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:20:00,654 INFO L276 IsEmpty]: Start isEmpty. Operand 35828 states and 151678 transitions. [2022-01-28 13:20:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-28 13:20:01,375 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:20:01,376 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-28 13:20:01,393 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-28 13:20:01,592 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-28 13:20:01,594 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-28 13:20:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:20:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1870998198, now seen corresponding path program 4 times [2022-01-28 13:20:01,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:20:01,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019845501] [2022-01-28 13:20:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:20:01,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:20:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:20:01,722 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-28 13:20:01,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:20:01,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019845501] [2022-01-28 13:20:01,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019845501] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:20:01,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:20:01,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 13:20:01,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600352779] [2022-01-28 13:20:01,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:20:01,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 13:20:01,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:20:01,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 13:20:01,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-28 13:20:01,724 INFO L87 Difference]: Start difference. First operand 35828 states and 151678 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:20:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:20:02,112 INFO L93 Difference]: Finished difference Result 51233 states and 218839 transitions. [2022-01-28 13:20:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 13:20:02,112 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-28 13:20:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:20:02,566 INFO L225 Difference]: With dead ends: 51233 [2022-01-28 13:20:02,567 INFO L226 Difference]: Without dead ends: 32549 [2022-01-28 13:20:02,567 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-28 13:20:02,567 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-28 13:20:02,567 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-28 13:20:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32549 states. [2022-01-28 13:20:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32549 to 32426. [2022-01-28 13:20:03,515 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-28 13:20:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32426 states to 32426 states and 135635 transitions. [2022-01-28 13:20:03,639 INFO L78 Accepts]: Start accepts. Automaton has 32426 states and 135635 transitions. Word has length 143 [2022-01-28 13:20:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:20:03,640 INFO L470 AbstractCegarLoop]: Abstraction has 32426 states and 135635 transitions. [2022-01-28 13:20:03,640 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-28 13:20:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 32426 states and 135635 transitions. [2022-01-28 13:20:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-28 13:20:03,722 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:20:03,722 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-28 13:20:03,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-28 13:20:03,722 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-28 13:20:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:20:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash -342153556, now seen corresponding path program 5 times [2022-01-28 13:20:03,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:20:03,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914284144] [2022-01-28 13:20:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:20:03,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:20:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:20:03,851 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-28 13:20:03,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:20:03,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914284144] [2022-01-28 13:20:03,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914284144] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:20:03,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269132241] [2022-01-28 13:20:03,851 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:20:03,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:20:03,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:20:03,868 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-28 13:20:03,886 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-28 13:20:03,981 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-28 13:20:03,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:20:03,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-28 13:20:03,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:20:04,136 INFO L388 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-28 13:20:04,233 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-28 13:20:04,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:20:04,589 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-28 13:20:04,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269132241] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:20:04,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:20:04,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2022-01-28 13:20:04,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641678769] [2022-01-28 13:20:04,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:20:04,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-28 13:20:04,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:20:04,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-28 13:20:04,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-01-28 13:20:04,591 INFO L87 Difference]: Start difference. First operand 32426 states and 135635 transitions. Second operand has 17 states, 17 states have (on average 14.176470588235293) internal successors, (241), 17 states have internal predecessors, (241), 0 states have call successors, (0), 0 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-28 13:20:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:20:08,032 INFO L93 Difference]: Finished difference Result 262615 states and 1127592 transitions. [2022-01-28 13:20:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-28 13:20:08,032 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.176470588235293) internal successors, (241), 17 states have internal predecessors, (241), 0 states have call successors, (0), 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-28 13:20:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:20:08,957 INFO L225 Difference]: With dead ends: 262615 [2022-01-28 13:20:08,957 INFO L226 Difference]: Without dead ends: 118025 [2022-01-28 13:20:08,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=593, Invalid=1663, Unknown=0, NotChecked=0, Total=2256 [2022-01-28 13:20:08,958 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 1073 mSDsluCounter, 2778 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-28 13:20:08,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1073 Valid, 2870 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-28 13:20:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118025 states. [2022-01-28 13:20:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118025 to 36452. [2022-01-28 13:20:11,036 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-28 13:20:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36452 states to 36452 states and 151505 transitions. [2022-01-28 13:20:11,163 INFO L78 Accepts]: Start accepts. Automaton has 36452 states and 151505 transitions. Word has length 143 [2022-01-28 13:20:11,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:20:11,163 INFO L470 AbstractCegarLoop]: Abstraction has 36452 states and 151505 transitions. [2022-01-28 13:20:11,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.176470588235293) internal successors, (241), 17 states have internal predecessors, (241), 0 states have call successors, (0), 0 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-28 13:20:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 36452 states and 151505 transitions. [2022-01-28 13:20:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-28 13:20:11,245 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:20:11,245 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-28 13:20:11,262 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-28 13:20:11,462 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-28 13:20:11,462 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-28 13:20:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:20:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash 627705186, now seen corresponding path program 6 times [2022-01-28 13:20:11,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:20:11,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240692442] [2022-01-28 13:20:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:20:11,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:20:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:20:11,826 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-28 13:20:11,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:20:11,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240692442] [2022-01-28 13:20:11,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240692442] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:20:11,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912065805] [2022-01-28 13:20:11,827 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:20:11,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:20:11,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:20:11,840 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-28 13:20:11,851 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-28 13:20:11,954 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-28 13:20:11,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:20:11,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-28 13:20:11,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:20:12,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:20:12,666 INFO L388 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-28 13:20:12,728 INFO L388 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-28 13:20:12,816 INFO L388 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-28 13:20:12,912 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-28 13:20:12,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:20:13,264 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_388 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_388) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 2))) (<= 2147483647 c_~max~0)) is different from false [2022-01-28 13:20:13,282 INFO L388 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-28 13:20:13,436 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-28 13:20:13,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912065805] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:20:13,436 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:20:13,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 45 [2022-01-28 13:20:13,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534234146] [2022-01-28 13:20:13,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:20:13,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-28 13:20:13,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:20:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-28 13:20:13,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1710, Unknown=1, NotChecked=84, Total=1980 [2022-01-28 13:20:13,438 INFO L87 Difference]: Start difference. First operand 36452 states and 151505 transitions. Second operand has 45 states, 45 states have (on average 7.555555555555555) internal successors, (340), 45 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:20:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:20:18,735 INFO L93 Difference]: Finished difference Result 212041 states and 909485 transitions. [2022-01-28 13:20:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-28 13:20:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 7.555555555555555) internal successors, (340), 45 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-28 13:20:18,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:20:19,890 INFO L225 Difference]: With dead ends: 212041 [2022-01-28 13:20:19,891 INFO L226 Difference]: Without dead ends: 141227 [2022-01-28 13:20:19,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 263 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1570, Invalid=6623, Unknown=1, NotChecked=178, Total=8372 [2022-01-28 13:20:19,893 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 2344 mSDsluCounter, 7739 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2344 SdHoareTripleChecker+Valid, 7657 SdHoareTripleChecker+Invalid, 3631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1015 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-28 13:20:19,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2344 Valid, 7657 Invalid, 3631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2436 Invalid, 0 Unknown, 1015 Unchecked, 1.2s Time] [2022-01-28 13:20:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141227 states. [2022-01-28 13:20:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141227 to 33680. [2022-01-28 13:20:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33680 states, 33679 states have (on average 4.173193978443541) internal successors, (140549), 33679 states have internal predecessors, (140549), 0 states have call successors, (0), 0 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-28 13:20:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33680 states to 33680 states and 140549 transitions. [2022-01-28 13:20:22,726 INFO L78 Accepts]: Start accepts. Automaton has 33680 states and 140549 transitions. Word has length 143 [2022-01-28 13:20:22,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:20:22,726 INFO L470 AbstractCegarLoop]: Abstraction has 33680 states and 140549 transitions. [2022-01-28 13:20:22,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.555555555555555) internal successors, (340), 45 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:20:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 33680 states and 140549 transitions. [2022-01-28 13:20:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-28 13:20:22,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:20:22,795 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-28 13:20:22,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-28 13:20:23,001 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-28 13:20:23,002 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-28 13:20:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:20:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash 929095160, now seen corresponding path program 7 times [2022-01-28 13:20:23,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:20:23,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891690533] [2022-01-28 13:20:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:20:23,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:20:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:20:23,619 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-28 13:20:23,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:20:23,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891690533] [2022-01-28 13:20:23,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891690533] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:20:23,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142888850] [2022-01-28 13:20:23,620 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-28 13:20:23,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:20:23,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:20:23,623 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-28 13:20:23,624 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-28 13:20:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:20:23,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-28 13:20:23,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:20:23,754 INFO L388 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-28 13:20:23,872 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:20:23,872 INFO L388 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-28 13:20:24,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:20:24,434 INFO L388 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-28 13:20:24,508 INFO L388 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-28 13:20:24,589 INFO L388 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-28 13:20:24,683 INFO L388 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-28 13:20:24,777 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-28 13:20:24,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:20:25,064 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_439 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_439) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))) (<= 2147483647 c_~max~0)) is different from false [2022-01-28 13:20:25,135 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_437 Int)) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork3_~i~2#1| 4)))) (or (< (select .cse0 .cse1) (+ v_ArrVal_437 1)) (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 .cse1 v_ArrVal_437)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_439) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))))) (<= 2147483647 c_~max~0)) is different from false [2022-01-28 13:20:25,154 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_437 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_437)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_439) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (< (select .cse0 c_~A~0.offset) (+ v_ArrVal_437 1))))) (<= 2147483647 c_~max~0)) is different from false [2022-01-28 13:20:25,176 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_437 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436))) (let ((.cse1 (select .cse0 c_~A~0.base))) (or (<= (select (select (store (store .cse0 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_437)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_439) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (< (select .cse1 c_~A~0.offset) (+ v_ArrVal_437 1)))))) (<= 2147483647 c_~max~0)) is different from false [2022-01-28 13:20:25,243 INFO L388 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 102 treesize of output 78 [2022-01-28 13:20:25,247 INFO L388 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-28 13:20:25,250 INFO L388 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 11 treesize of output 9 [2022-01-28 13:20:25,738 INFO L388 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-28 13:20:25,780 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-28 13:20:25,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142888850] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:20:25,781 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:20:25,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 20] total 59 [2022-01-28 13:20:25,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333651279] [2022-01-28 13:20:25,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:20:25,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-28 13:20:25,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:20:25,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-28 13:20:25,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2736, Unknown=4, NotChecked=436, Total=3422 [2022-01-28 13:20:25,783 INFO L87 Difference]: Start difference. First operand 33680 states and 140549 transitions. Second operand has 59 states, 59 states have (on average 6.372881355932203) internal successors, (376), 59 states have internal predecessors, (376), 0 states have call successors, (0), 0 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-28 13:20:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:20:39,377 INFO L93 Difference]: Finished difference Result 311571 states and 1353458 transitions. [2022-01-28 13:20:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-01-28 13:20:39,377 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 6.372881355932203) internal successors, (376), 59 states have internal predecessors, (376), 0 states have call successors, (0), 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-28 13:20:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:20:40,651 INFO L225 Difference]: With dead ends: 311571 [2022-01-28 13:20:40,652 INFO L226 Difference]: Without dead ends: 166799 [2022-01-28 13:20:40,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 256 SyntacticMatches, 12 SemanticMatches, 142 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4449 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=3950, Invalid=15522, Unknown=4, NotChecked=1116, Total=20592 [2022-01-28 13:20:40,655 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 4293 mSDsluCounter, 10055 mSDsCounter, 0 mSdLazyCounter, 6475 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4293 SdHoareTripleChecker+Valid, 9581 SdHoareTripleChecker+Invalid, 9830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 6475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3078 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-28 13:20:40,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4293 Valid, 9581 Invalid, 9830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 6475 Invalid, 0 Unknown, 3078 Unchecked, 2.7s Time] [2022-01-28 13:20:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166799 states. [2022-01-28 13:20:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166799 to 30968. [2022-01-28 13:20:43,943 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-28 13:20:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30968 states to 30968 states and 128321 transitions. [2022-01-28 13:20:44,068 INFO L78 Accepts]: Start accepts. Automaton has 30968 states and 128321 transitions. Word has length 143 [2022-01-28 13:20:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:20:44,069 INFO L470 AbstractCegarLoop]: Abstraction has 30968 states and 128321 transitions. [2022-01-28 13:20:44,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 6.372881355932203) internal successors, (376), 59 states have internal predecessors, (376), 0 states have call successors, (0), 0 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-28 13:20:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 30968 states and 128321 transitions. [2022-01-28 13:20:44,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-28 13:20:44,158 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:20:44,158 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-28 13:20:44,175 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-28 13:20:44,358 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-28 13:20:44,359 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-28 13:20:44,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:20:44,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1049396362, now seen corresponding path program 8 times [2022-01-28 13:20:44,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:20:44,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478315539] [2022-01-28 13:20:44,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:20:44,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:20:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:20:44,490 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-28 13:20:44,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:20:44,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478315539] [2022-01-28 13:20:44,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478315539] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:20:44,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307785083] [2022-01-28 13:20:44,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:20:44,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:20:44,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:20:44,497 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-28 13:20:44,498 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-28 13:20:44,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:20:44,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:20:44,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-28 13:20:44,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:20:44,829 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-28 13:20:44,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:20:45,058 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-28 13:20:45,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307785083] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:20:45,058 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:20:45,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-01-28 13:20:45,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385532627] [2022-01-28 13:20:45,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:20:45,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-28 13:20:45,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:20:45,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-28 13:20:45,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-28 13:20:45,059 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-28 13:20:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:20:45,828 INFO L93 Difference]: Finished difference Result 41375 states and 173574 transitions. [2022-01-28 13:20:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 13:20:45,828 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-28 13:20:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:20:45,907 INFO L225 Difference]: With dead ends: 41375 [2022-01-28 13:20:45,907 INFO L226 Difference]: Without dead ends: 24774 [2022-01-28 13:20:45,907 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-28 13:20:45,908 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 42 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-28 13:20:45,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 1017 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-28 13:20:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24774 states. [2022-01-28 13:20:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24774 to 24764. [2022-01-28 13:20:46,674 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-28 13:20:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24764 states to 24764 states and 102179 transitions. [2022-01-28 13:20:46,790 INFO L78 Accepts]: Start accepts. Automaton has 24764 states and 102179 transitions. Word has length 143 [2022-01-28 13:20:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:20:46,791 INFO L470 AbstractCegarLoop]: Abstraction has 24764 states and 102179 transitions. [2022-01-28 13:20:46,791 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-28 13:20:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 24764 states and 102179 transitions. [2022-01-28 13:20:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-28 13:20:46,850 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:20:46,850 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-28 13:20:46,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-28 13:20:47,063 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-28 13:20:47,063 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-28 13:20:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:20:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash 225436057, now seen corresponding path program 9 times [2022-01-28 13:20:47,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:20:47,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680105862] [2022-01-28 13:20:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:20:47,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:20:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:20:47,148 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-28 13:20:47,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:20:47,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680105862] [2022-01-28 13:20:47,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680105862] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:20:47,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654660460] [2022-01-28 13:20:47,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:20:47,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:20:47,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:20:47,150 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-28 13:20:47,151 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-28 13:20:47,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-28 13:20:47,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:20:47,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-28 13:20:47,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:20:47,516 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-28 13:20:47,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:20:47,897 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-28 13:20:47,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654660460] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:20:47,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:20:47,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-01-28 13:20:47,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667490338] [2022-01-28 13:20:47,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:20:47,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-28 13:20:47,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:20:47,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-28 13:20:47,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-01-28 13:20:47,899 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-28 13:20:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:20:48,924 INFO L93 Difference]: Finished difference Result 49980 states and 205385 transitions. [2022-01-28 13:20:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-28 13:20:48,924 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-28 13:20:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:20:49,328 INFO L225 Difference]: With dead ends: 49980 [2022-01-28 13:20:49,328 INFO L226 Difference]: Without dead ends: 48125 [2022-01-28 13:20:49,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=864, Invalid=3168, Unknown=0, NotChecked=0, Total=4032 [2022-01-28 13:20:49,329 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 1282 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-28 13:20:49,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1282 Valid, 3117 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-28 13:20:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48125 states. [2022-01-28 13:20:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48125 to 24859. [2022-01-28 13:20:50,135 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-28 13:20:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24859 states to 24859 states and 102398 transitions. [2022-01-28 13:20:50,219 INFO L78 Accepts]: Start accepts. Automaton has 24859 states and 102398 transitions. Word has length 148 [2022-01-28 13:20:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:20:50,220 INFO L470 AbstractCegarLoop]: Abstraction has 24859 states and 102398 transitions. [2022-01-28 13:20:50,220 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-28 13:20:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 24859 states and 102398 transitions. [2022-01-28 13:20:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-28 13:20:50,276 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:20:50,276 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-28 13:20:50,294 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-28 13:20:50,492 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-28 13:20:50,492 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-28 13:20:50,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:20:50,492 INFO L85 PathProgramCache]: Analyzing trace with hash -647156114, now seen corresponding path program 10 times [2022-01-28 13:20:50,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:20:50,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718951704] [2022-01-28 13:20:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:20:50,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:20:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:20:50,583 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-28 13:20:50,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:20:50,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718951704] [2022-01-28 13:20:50,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718951704] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:20:50,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311087072] [2022-01-28 13:20:50,583 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-28 13:20:50,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:20:50,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:20:50,584 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-28 13:20:50,585 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-28 13:20:50,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-28 13:20:50,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:20:50,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-28 13:20:50,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:20:50,873 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-28 13:20:50,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:20:51,065 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-28 13:20:51,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311087072] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:20:51,066 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:20:51,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-01-28 13:20:51,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504697668] [2022-01-28 13:20:51,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:20:51,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-28 13:20:51,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:20:51,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-28 13:20:51,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-01-28 13:20:51,067 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-28 13:20:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:20:51,802 INFO L93 Difference]: Finished difference Result 41627 states and 174078 transitions. [2022-01-28 13:20:51,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-28 13:20:51,802 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-28 13:20:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:20:51,941 INFO L225 Difference]: With dead ends: 41627 [2022-01-28 13:20:51,942 INFO L226 Difference]: Without dead ends: 41627 [2022-01-28 13:20:51,947 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-28 13:20:51,948 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 933 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 13:20:51,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 1495 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 13:20:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41627 states. [2022-01-28 13:20:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41627 to 35339. [2022-01-28 13:20:52,840 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-28 13:20:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35339 states to 35339 states and 147198 transitions. [2022-01-28 13:20:53,128 INFO L78 Accepts]: Start accepts. Automaton has 35339 states and 147198 transitions. Word has length 155 [2022-01-28 13:20:53,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:20:53,129 INFO L470 AbstractCegarLoop]: Abstraction has 35339 states and 147198 transitions. [2022-01-28 13:20:53,129 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-28 13:20:53,129 INFO L276 IsEmpty]: Start isEmpty. Operand 35339 states and 147198 transitions. [2022-01-28 13:20:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-28 13:20:53,204 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:20:53,204 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-28 13:20:53,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-28 13:20:53,419 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-28 13:20:53,420 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-28 13:20:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:20:53,420 INFO L85 PathProgramCache]: Analyzing trace with hash -201771473, now seen corresponding path program 11 times [2022-01-28 13:20:53,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:20:53,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421247339] [2022-01-28 13:20:53,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:20:53,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:20:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:20:53,505 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-28 13:20:53,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:20:53,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421247339] [2022-01-28 13:20:53,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421247339] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:20:53,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993644134] [2022-01-28 13:20:53,505 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:20:53,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:20:53,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:20:53,520 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-28 13:20:53,521 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-28 13:20:53,665 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-28 13:20:53,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:20:53,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-28 13:20:53,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:20:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-28 13:20:53,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:20:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-28 13:20:54,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993644134] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:20:54,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:20:54,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-01-28 13:20:54,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756226367] [2022-01-28 13:20:54,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:20:54,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-28 13:20:54,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:20:54,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-28 13:20:54,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-28 13:20:54,050 INFO L87 Difference]: Start difference. First operand 35339 states and 147198 transitions. Second operand has 21 states, 21 states have (on average 12.904761904761905) internal successors, (271), 21 states have internal predecessors, (271), 0 states have call successors, (0), 0 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-28 13:20:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:20:55,391 INFO L93 Difference]: Finished difference Result 74350 states and 314552 transitions. [2022-01-28 13:20:55,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-28 13:20:55,391 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 12.904761904761905) internal successors, (271), 21 states have internal predecessors, (271), 0 states have call successors, (0), 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-28 13:20:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:20:55,940 INFO L225 Difference]: With dead ends: 74350 [2022-01-28 13:20:55,940 INFO L226 Difference]: Without dead ends: 74350 [2022-01-28 13:20:55,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=639, Invalid=1811, Unknown=0, NotChecked=0, Total=2450 [2022-01-28 13:20:55,941 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 1267 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-28 13:20:55,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1267 Valid, 2776 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-28 13:20:56,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74350 states. [2022-01-28 13:20:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74350 to 49659. [2022-01-28 13:20:57,581 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-28 13:20:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49659 states to 49659 states and 208766 transitions. [2022-01-28 13:20:57,770 INFO L78 Accepts]: Start accepts. Automaton has 49659 states and 208766 transitions. Word has length 160 [2022-01-28 13:20:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:20:57,771 INFO L470 AbstractCegarLoop]: Abstraction has 49659 states and 208766 transitions. [2022-01-28 13:20:57,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.904761904761905) internal successors, (271), 21 states have internal predecessors, (271), 0 states have call successors, (0), 0 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-28 13:20:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 49659 states and 208766 transitions. [2022-01-28 13:20:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-28 13:20:57,897 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:20:57,897 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-28 13:20:57,913 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-28 13:20:58,115 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-28 13:20:58,116 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-28 13:20:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:20:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1462933140, now seen corresponding path program 12 times [2022-01-28 13:20:58,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:20:58,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639603760] [2022-01-28 13:20:58,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:20:58,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:20:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:20:58,710 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-28 13:20:58,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:20:58,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639603760] [2022-01-28 13:20:58,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639603760] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:20:58,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401612373] [2022-01-28 13:20:58,710 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:20:58,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:20:58,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:20:58,712 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-28 13:20:58,712 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-28 13:20:58,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-28 13:20:58,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:20:58,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-28 13:20:58,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:20:59,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:20:59,445 INFO L388 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 33 treesize of output 31 [2022-01-28 13:20:59,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:20:59,526 INFO L388 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 33 treesize of output 31 [2022-01-28 13:20:59,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-28 13:20:59,639 INFO L354 Elim1Store]: treesize reduction 46, result has 41.8 percent of original size [2022-01-28 13:20:59,639 INFO L388 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 55 treesize of output 62 [2022-01-28 13:20:59,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:20:59,739 INFO L388 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-28 13:20:59,758 INFO L388 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-28 13:20:59,813 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-28 13:20:59,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:21:01,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_53| Int)) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_53| (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1)) (forall ((v_ArrVal_692 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))))) is different from false [2022-01-28 13:21:11,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_689) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_690) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (< |v_thread3Thread1of1ForFork3_~i~2#1_53| 1) (<= 2147483647 .cse0) (< (+ v_ArrVal_690 1) (select .cse1 c_~A~0.offset)))))) is different from false [2022-01-28 13:21:11,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_689) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_690) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (< (+ v_ArrVal_690 1) (select .cse1 c_~A~0.offset)) (< |v_thread3Thread1of1ForFork3_~i~2#1_53| 1) (<= 2147483647 .cse0))))) is different from false [2022-01-28 13:21:12,294 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_689) c_~A~0.base))) (let ((.cse1 (select (store (store .cse0 c_~A~0.offset v_ArrVal_690) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (< (+ v_ArrVal_690 1) (select .cse0 c_~A~0.offset)) (< |v_thread3Thread1of1ForFork3_~i~2#1_53| 1) (<= 2147483647 .cse1) (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_688) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_689) c_~A~0.base) c_~A~0.offset v_ArrVal_690) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset) 1))))) (or (<= c_~min~0 (+ .cse1 1)) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) c_~min~0)))))))) is different from false [2022-01-28 13:21:16,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_689) c_~A~0.base))) (let ((.cse7 (select (store (store .cse0 c_~A~0.offset v_ArrVal_690) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (< (+ v_ArrVal_690 1) (select .cse0 c_~A~0.offset)) (< |v_thread3Thread1of1ForFork3_~i~2#1_53| 1) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)))) (.cse3 (+ .cse7 1))) (and (or (and (or (forall ((v_subst_2 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (<= (select .cse1 (+ c_~A~0.offset (* v_subst_2 4))) (select .cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)))))) (<= .cse2 .cse3)) (forall ((v_subst_1 Int)) (let ((.cse5 (select |c_#memory_int| c_~A~0.base))) (let ((.cse4 (select .cse5 (+ c_~A~0.offset (* v_subst_1 4))))) (or (<= .cse4 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_689) c_~A~0.base) c_~A~0.offset v_ArrVal_690) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset) 1)) (< (select .cse5 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) .cse4)))))) (< c_~min~0 .cse2)) (or (<= .cse2 c_~min~0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse6 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse6) (<= .cse6 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_689) c_~A~0.base) c_~A~0.offset v_ArrVal_690) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset) 1))))) (or (<= c_~min~0 .cse3) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) c_~min~0))))))) (<= 2147483647 .cse7))))) is different from false [2022-01-28 13:21:20,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_689) c_~A~0.base))) (let ((.cse6 (select (store (store .cse7 c_~A~0.offset v_ArrVal_690) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse1 (+ .cse6 1))) (and (or (and (or (<= .cse0 .cse1) (forall ((v_subst_2 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (<= (select .cse2 (+ c_~A~0.offset (* v_subst_2 4))) (select .cse2 c_~A~0.offset))))) (forall ((v_subst_1 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* v_subst_1 4))))) (or (<= .cse3 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_689) c_~A~0.base) c_~A~0.offset v_ArrVal_690) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset) 1)) (< (select .cse4 c_~A~0.offset) .cse3)))))) (< c_~min~0 .cse0)) (or (<= .cse0 c_~min~0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse5) (<= .cse5 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_689) c_~A~0.base) c_~A~0.offset v_ArrVal_690) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset) 1))))) (or (<= c_~min~0 .cse1) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) c_~min~0))))))) (< (+ v_ArrVal_690 1) (select .cse7 c_~A~0.offset)) (< |v_thread3Thread1of1ForFork3_~i~2#1_53| 1) (<= 2147483647 .cse6))))) is different from false [2022-01-28 13:21:22,705 INFO L388 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 430 treesize of output 398 [2022-01-28 13:21:22,709 INFO L388 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 476 treesize of output 472 [2022-01-28 13:21:22,714 INFO L388 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 511 treesize of output 509 [2022-01-28 13:21:22,731 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:21:22,731 INFO L388 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 548 treesize of output 506 [2022-01-28 13:21:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 8 not checked. [2022-01-28 13:21:26,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401612373] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:21:26,228 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:21:26,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 24] total 56 [2022-01-28 13:21:26,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197902228] [2022-01-28 13:21:26,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:21:26,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-28 13:21:26,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:21:26,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-28 13:21:26,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2232, Unknown=18, NotChecked=606, Total=3080 [2022-01-28 13:21:26,230 INFO L87 Difference]: Start difference. First operand 49659 states and 208766 transitions. Second operand has 56 states, 56 states have (on average 6.446428571428571) internal successors, (361), 56 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-28 13:21:29,069 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse3 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse2 (select |c_#memory_int| c_~A~0.base))) (and (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_53| Int)) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_53| (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1)) (forall ((v_ArrVal_692 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))))) (not (= c_~A~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~A~0.offset 0) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~min~0 (+ (select .cse2 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork3_~i~2#1| 4))) 1)) (< .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (not (= c_~A~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~min~0 (+ (select .cse2 c_~A~0.offset) 1)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) is different from false [2022-01-28 13:21:31,445 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse3 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse2 (select |c_#memory_int| c_~A~0.base))) (and (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_53| Int)) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_53| (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1)) (forall ((v_ArrVal_692 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))))) (not (= c_~A~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~min~0 (+ (select .cse2 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork3_~i~2#1| 4))) 1)) (< .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= c_~A~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~min~0 (+ (select .cse2 c_~A~0.offset) 1)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) is different from false [2022-01-28 13:21:33,510 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_53| Int)) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_53| (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1)) (forall ((v_ArrVal_692 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))))) (= c_~A~0.offset 0) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (<= 1 |c_thread3Thread1of1ForFork3_~i~2#1|) (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1))) is different from false [2022-01-28 13:21:35,638 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_53| Int)) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_53| (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1)) (forall ((v_ArrVal_692 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))))) (= c_~A~0.offset 0) (<= c_~min~0 (+ c_~max~0 1)) (not (= |c_thread3Thread1of1ForFork3_~i~2#1| 0)) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (<= 1 |c_thread3Thread1of1ForFork3_~i~2#1|) (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1))) is different from false [2022-01-28 13:21:37,762 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse3 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse2 (select |c_#memory_int| c_~A~0.base))) (and (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_53| Int)) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_53| (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1)) (forall ((v_ArrVal_692 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))))) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~A~0.offset 0) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~min~0 (+ (select .cse2 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork3_~i~2#1| 4))) 1)) (< .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~min~0 (+ (select .cse2 c_~A~0.offset) 1)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) is different from false [2022-01-28 13:21:40,015 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse3 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (.cse2 (select |c_#memory_int| c_~A~0.base))) (and (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_53| Int)) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_53| (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1)) (forall ((v_ArrVal_692 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_53| 4)) v_ArrVal_692) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))))) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~min~0 (+ (select .cse2 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork3_~i~2#1| 4))) 1)) (< .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|) (< .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~min~0 (+ (select .cse2 c_~A~0.offset) 1)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) is different from false [2022-01-28 13:21:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:21:42,297 INFO L93 Difference]: Finished difference Result 274205 states and 1164653 transitions. [2022-01-28 13:21:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-01-28 13:21:42,298 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 6.446428571428571) internal successors, (361), 56 states have internal predecessors, (361), 0 states have call successors, (0), 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-28 13:21:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:21:42,958 INFO L225 Difference]: With dead ends: 274205 [2022-01-28 13:21:42,958 INFO L226 Difference]: Without dead ends: 145581 [2022-01-28 13:21:42,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 329 SyntacticMatches, 7 SemanticMatches, 100 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2295 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=1077, Invalid=6957, Unknown=24, NotChecked=2244, Total=10302 [2022-01-28 13:21:42,962 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 1658 mSDsluCounter, 8126 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 7793 SdHoareTripleChecker+Invalid, 5001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2849 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-28 13:21:42,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1658 Valid, 7793 Invalid, 5001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2071 Invalid, 0 Unknown, 2849 Unchecked, 0.8s Time] [2022-01-28 13:21:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145581 states.