/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-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 19:37:51,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 19:37:51,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 19:37:51,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 19:37:51,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 19:37:51,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 19:37:51,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 19:37:51,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 19:37:51,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 19:37:51,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 19:37:51,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 19:37:51,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 19:37:51,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 19:37:51,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 19:37:51,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 19:37:51,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 19:37:51,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 19:37:51,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 19:37:51,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 19:37:51,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 19:37:51,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 19:37:51,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 19:37:51,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 19:37:51,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 19:37:51,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 19:37:51,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 19:37:51,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 19:37:51,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 19:37:51,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 19:37:51,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 19:37:51,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 19:37:51,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 19:37:51,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 19:37:51,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 19:37:51,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 19:37:51,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 19:37:51,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 19:37:51,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 19:37:51,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 19:37:51,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 19:37:51,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 19:37:51,969 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-PN-SemanticLbe.epf [2022-12-12 19:37:51,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 19:37:51,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 19:37:52,001 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 19:37:52,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 19:37:52,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 19:37:52,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 19:37:52,002 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 19:37:52,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 19:37:52,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 19:37:52,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 19:37:52,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 19:37:52,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 19:37:52,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 19:37:52,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 19:37:52,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 19:37:52,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 19:37:52,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 19:37:52,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 19:37:52,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 19:37:52,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 19:37:52,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 19:37:52,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 19:37:52,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 19:37:52,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 19:37:52,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 19:37:52,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 19:37:52,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 19:37:52,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 19:37:52,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 19:37:52,005 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 19:37:52,005 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 19:37:52,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 19:37:52,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 19:37:52,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 19:37:52,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 19:37:52,264 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 19:37:52,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-12-12 19:37:53,181 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 19:37:53,371 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 19:37:53,372 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-12-12 19:37:53,393 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afadc3849/ba9208c29fd14f9a8d3ca486460a1403/FLAG4974c2c45 [2022-12-12 19:37:53,403 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afadc3849/ba9208c29fd14f9a8d3ca486460a1403 [2022-12-12 19:37:53,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 19:37:53,406 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 19:37:53,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 19:37:53,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 19:37:53,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 19:37:53,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a317b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53, skipping insertion in model container [2022-12-12 19:37:53,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 19:37:53,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 19:37:53,586 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-12 19:37:53,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 19:37:53,608 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 19:37:53,636 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-12 19:37:53,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 19:37:53,653 INFO L208 MainTranslator]: Completed translation [2022-12-12 19:37:53,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53 WrapperNode [2022-12-12 19:37:53,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 19:37:53,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 19:37:53,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 19:37:53,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 19:37:53,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,709 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 277 [2022-12-12 19:37:53,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 19:37:53,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 19:37:53,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 19:37:53,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 19:37:53,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,738 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 19:37:53,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 19:37:53,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 19:37:53,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 19:37:53,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (1/1) ... [2022-12-12 19:37:53,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 19:37:53,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:37:53,812 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-12-12 19:37:53,831 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-12-12 19:37:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 19:37:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 19:37:53,854 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 19:37:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 19:37:53,854 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 19:37:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 19:37:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 19:37:53,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 19:37:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 19:37:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 19:37:53,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 19:37:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 19:37:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 19:37:53,856 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 19:37:53,929 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 19:37:53,931 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 19:37:54,231 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 19:37:54,239 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 19:37:54,239 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-12 19:37:54,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 07:37:54 BoogieIcfgContainer [2022-12-12 19:37:54,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 19:37:54,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 19:37:54,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 19:37:54,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 19:37:54,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 07:37:53" (1/3) ... [2022-12-12 19:37:54,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a426df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 07:37:54, skipping insertion in model container [2022-12-12 19:37:54,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:37:53" (2/3) ... [2022-12-12 19:37:54,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a426df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 07:37:54, skipping insertion in model container [2022-12-12 19:37:54,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 07:37:54" (3/3) ... [2022-12-12 19:37:54,246 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-12-12 19:37:54,269 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 19:37:54,269 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 19:37:54,269 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 19:37:54,410 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 19:37:54,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 336 transitions, 688 flow [2022-12-12 19:37:54,592 INFO L130 PetriNetUnfolder]: 28/334 cut-off events. [2022-12-12 19:37:54,593 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 19:37:54,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 334 events. 28/334 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 760 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-12 19:37:54,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 336 transitions, 688 flow [2022-12-12 19:37:54,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 326 transitions, 664 flow [2022-12-12 19:37:54,612 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 19:37:54,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 326 transitions, 664 flow [2022-12-12 19:37:54,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 326 transitions, 664 flow [2022-12-12 19:37:54,717 INFO L130 PetriNetUnfolder]: 28/326 cut-off events. [2022-12-12 19:37:54,717 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 19:37:54,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 326 events. 28/326 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 759 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-12 19:37:54,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 326 transitions, 664 flow [2022-12-12 19:37:54,734 INFO L226 LiptonReduction]: Number of co-enabled transitions 25652 [2022-12-12 19:38:04,233 INFO L241 LiptonReduction]: Total number of compositions: 310 [2022-12-12 19:38:04,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 19:38:04,247 INFO L357 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=false, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ecc6cfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 19:38:04,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 19:38:04,252 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-12 19:38:04,253 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 19:38:04,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:04,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:04,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash -156050190, now seen corresponding path program 1 times [2022-12-12 19:38:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:04,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165518132] [2022-12-12 19:38:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:04,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165518132] [2022-12-12 19:38:04,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165518132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:38:04,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:38:04,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 19:38:04,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531522630] [2022-12-12 19:38:04,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:38:04,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 19:38:04,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:04,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 19:38:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 19:38:04,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:04,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:04,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:04,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:04,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:05,038 INFO L130 PetriNetUnfolder]: 99/168 cut-off events. [2022-12-12 19:38:05,039 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-12 19:38:05,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 168 events. 99/168 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 480 event pairs, 15 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 294. Up to 91 conditions per place. [2022-12-12 19:38:05,041 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 32 selfloop transitions, 10 changer transitions 1/43 dead transitions. [2022-12-12 19:38:05,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 43 transitions, 199 flow [2022-12-12 19:38:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:38:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:38:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-12 19:38:05,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-12 19:38:05,053 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2022-12-12 19:38:05,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 43 transitions, 199 flow [2022-12-12 19:38:05,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 42 transitions, 192 flow [2022-12-12 19:38:05,054 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 42 transitions, 192 flow [2022-12-12 19:38:05,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:05,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:05,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:05,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 19:38:05,055 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:05,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1029066208, now seen corresponding path program 1 times [2022-12-12 19:38:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:05,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348842120] [2022-12-12 19:38:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:05,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:05,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:05,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348842120] [2022-12-12 19:38:05,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348842120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:38:05,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:38:05,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 19:38:05,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541934295] [2022-12-12 19:38:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:38:05,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:38:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:38:05,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:38:05,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:05,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 42 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:05,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:05,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:05,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:05,289 INFO L130 PetriNetUnfolder]: 109/195 cut-off events. [2022-12-12 19:38:05,290 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-12 19:38:05,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 195 events. 109/195 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 618 event pairs, 5 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 505. Up to 123 conditions per place. [2022-12-12 19:38:05,293 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 54 selfloop transitions, 16 changer transitions 7/77 dead transitions. [2022-12-12 19:38:05,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 77 transitions, 498 flow [2022-12-12 19:38:05,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:38:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:38:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-12 19:38:05,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-12 19:38:05,299 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 8 predicate places. [2022-12-12 19:38:05,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 77 transitions, 498 flow [2022-12-12 19:38:05,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 70 transitions, 450 flow [2022-12-12 19:38:05,300 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 70 transitions, 450 flow [2022-12-12 19:38:05,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:05,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:05,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:05,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 19:38:05,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1675031090, now seen corresponding path program 2 times [2022-12-12 19:38:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:05,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613522530] [2022-12-12 19:38:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:05,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:05,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613522530] [2022-12-12 19:38:05,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613522530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:38:05,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:38:05,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 19:38:05,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117409556] [2022-12-12 19:38:05,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:38:05,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:38:05,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:05,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:38:05,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:38:05,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:05,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 70 transitions, 450 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:05,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:05,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:05,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:05,527 INFO L130 PetriNetUnfolder]: 153/281 cut-off events. [2022-12-12 19:38:05,527 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-12 19:38:05,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 281 events. 153/281 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1023 event pairs, 6 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 618. Up to 187 conditions per place. [2022-12-12 19:38:05,528 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 106 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2022-12-12 19:38:05,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 116 transitions, 982 flow [2022-12-12 19:38:05,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:38:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:38:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-12 19:38:05,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4625 [2022-12-12 19:38:05,530 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 12 predicate places. [2022-12-12 19:38:05,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 116 transitions, 982 flow [2022-12-12 19:38:05,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 116 transitions, 982 flow [2022-12-12 19:38:05,532 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 116 transitions, 982 flow [2022-12-12 19:38:05,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:05,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:05,532 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:05,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 19:38:05,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:05,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:05,532 INFO L85 PathProgramCache]: Analyzing trace with hash -355763786, now seen corresponding path program 1 times [2022-12-12 19:38:05,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:05,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181910331] [2022-12-12 19:38:05,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:05,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:05,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:05,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:05,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181910331] [2022-12-12 19:38:05,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181910331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:05,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189723348] [2022-12-12 19:38:05,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:05,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:05,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:05,667 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-12-12 19:38:05,683 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-12-12 19:38:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:05,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 19:38:05,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:05,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:05,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189723348] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:05,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 19:38:05,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2022-12-12 19:38:05,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748800456] [2022-12-12 19:38:05,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:38:05,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 19:38:05,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:05,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 19:38:05,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-12 19:38:05,938 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:05,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 116 transitions, 982 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:05,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:05,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:05,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:06,038 INFO L130 PetriNetUnfolder]: 142/256 cut-off events. [2022-12-12 19:38:06,039 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-12 19:38:06,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 256 events. 142/256 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 873 event pairs, 3 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 704. Up to 167 conditions per place. [2022-12-12 19:38:06,040 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 97 selfloop transitions, 29 changer transitions 0/126 dead transitions. [2022-12-12 19:38:06,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 126 transitions, 1317 flow [2022-12-12 19:38:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 19:38:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 19:38:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-12-12 19:38:06,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-12 19:38:06,042 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-12 19:38:06,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 126 transitions, 1317 flow [2022-12-12 19:38:06,044 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 126 transitions, 1317 flow [2022-12-12 19:38:06,044 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 126 transitions, 1317 flow [2022-12-12 19:38:06,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:06,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:06,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:06,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 19:38:06,248 WARN L477 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-12-12 19:38:06,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:06,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:06,249 INFO L85 PathProgramCache]: Analyzing trace with hash -293579639, now seen corresponding path program 1 times [2022-12-12 19:38:06,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:06,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917875816] [2022-12-12 19:38:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:06,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:06,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:06,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917875816] [2022-12-12 19:38:06,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917875816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:38:06,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:38:06,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 19:38:06,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609627702] [2022-12-12 19:38:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:38:06,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:38:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:06,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:38:06,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:38:06,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:06,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 126 transitions, 1317 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:06,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:06,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:06,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:06,437 INFO L130 PetriNetUnfolder]: 91/161 cut-off events. [2022-12-12 19:38:06,437 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-12 19:38:06,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 161 events. 91/161 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 436 event pairs, 3 based on Foata normal form. 6/129 useless extension candidates. Maximal degree in co-relation 842. Up to 123 conditions per place. [2022-12-12 19:38:06,439 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 70 selfloop transitions, 6 changer transitions 7/83 dead transitions. [2022-12-12 19:38:06,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 83 transitions, 1032 flow [2022-12-12 19:38:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:38:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:38:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-12-12 19:38:06,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3625 [2022-12-12 19:38:06,440 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 20 predicate places. [2022-12-12 19:38:06,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 83 transitions, 1032 flow [2022-12-12 19:38:06,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 76 transitions, 942 flow [2022-12-12 19:38:06,441 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 76 transitions, 942 flow [2022-12-12 19:38:06,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:06,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:06,441 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:06,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 19:38:06,442 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:06,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:06,442 INFO L85 PathProgramCache]: Analyzing trace with hash -743047183, now seen corresponding path program 1 times [2022-12-12 19:38:06,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:06,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23703185] [2022-12-12 19:38:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:06,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:06,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23703185] [2022-12-12 19:38:06,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23703185] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:06,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438725115] [2022-12-12 19:38:06,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:06,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:06,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:06,560 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-12-12 19:38:06,562 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-12-12 19:38:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:06,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 19:38:06,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:06,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:06,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438725115] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:06,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 19:38:06,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2022-12-12 19:38:06,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991528492] [2022-12-12 19:38:06,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:38:06,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 19:38:06,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:06,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 19:38:06,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-12 19:38:06,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:06,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 76 transitions, 942 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:06,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:06,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:06,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:06,845 INFO L130 PetriNetUnfolder]: 99/166 cut-off events. [2022-12-12 19:38:06,845 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-12 19:38:06,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 166 events. 99/166 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 431 event pairs, 3 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 1043. Up to 127 conditions per place. [2022-12-12 19:38:06,847 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 76 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2022-12-12 19:38:06,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 85 transitions, 1223 flow [2022-12-12 19:38:06,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:38:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:38:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-12-12 19:38:06,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-12 19:38:06,848 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 22 predicate places. [2022-12-12 19:38:06,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 85 transitions, 1223 flow [2022-12-12 19:38:06,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 85 transitions, 1223 flow [2022-12-12 19:38:06,850 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 85 transitions, 1223 flow [2022-12-12 19:38:06,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:06,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:06,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:06,854 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-12-12 19:38:07,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-12 19:38:07,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:07,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:07,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1559164253, now seen corresponding path program 1 times [2022-12-12 19:38:07,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:07,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942958264] [2022-12-12 19:38:07,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:07,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:08,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:08,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942958264] [2022-12-12 19:38:08,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942958264] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:08,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233956781] [2022-12-12 19:38:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:08,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:08,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:08,203 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-12-12 19:38:08,242 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-12-12 19:38:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:08,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-12 19:38:08,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:08,333 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:08,372 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:08,433 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:08,697 INFO L350 Elim1Store]: Elim1 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 216 treesize of output 184 [2022-12-12 19:38:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:08,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:09,369 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* c_~i~0 4))) (.cse3 (+ c_~A~0.offset (* c_~j~0 4)))) (and (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) (and (forall ((v_ArrVal_146 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse3))) (or (not (<= 0 (+ c_~bag2~0 2147483648 .cse0))) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse0) (+ c_~bag1~0 (select .cse1 .cse2) c_~sum1~0)))))) (forall ((v_ArrVal_146 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base))) (let ((.cse5 (select .cse4 .cse3))) (or (<= (+ c_~bag1~0 (select .cse4 .cse2) c_~sum1~0) (+ c_~bag2~0 c_~sum2~0 .cse5)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse5))) (not (<= (+ c_~bag2~0 .cse5) 2147483647))))))) (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (forall ((v_ArrVal_146 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse3)) (.cse7 (select .cse8 .cse2))) (or (not (<= 0 (+ c_~bag2~0 2147483648 .cse6))) (not (<= (+ c_~bag2~0 .cse6) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse6) (+ c_~bag1~0 .cse7 c_~sum1~0)) (not (<= (+ c_~bag1~0 .cse7) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse7 2147483648))))))) (forall ((v_ArrVal_146 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse3)) (.cse9 (select .cse11 .cse2))) (or (<= (+ c_~bag1~0 .cse9 c_~sum1~0) (+ c_~bag2~0 c_~sum2~0 .cse10)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse10))) (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (not (<= (+ c_~bag1~0 .cse9) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse9 2147483648))))))))) is different from false [2022-12-12 19:38:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:09,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233956781] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:09,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:09,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2022-12-12 19:38:09,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107702170] [2022-12-12 19:38:09,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:09,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-12 19:38:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:09,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-12 19:38:09,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=312, Unknown=1, NotChecked=36, Total=420 [2022-12-12 19:38:09,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:09,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 85 transitions, 1223 flow. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:09,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:09,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:09,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:10,358 INFO L130 PetriNetUnfolder]: 261/444 cut-off events. [2022-12-12 19:38:10,359 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-12 19:38:10,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3622 conditions, 444 events. 261/444 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1667 event pairs, 0 based on Foata normal form. 2/350 useless extension candidates. Maximal degree in co-relation 1548. Up to 351 conditions per place. [2022-12-12 19:38:10,362 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 175 selfloop transitions, 57 changer transitions 10/242 dead transitions. [2022-12-12 19:38:10,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 242 transitions, 3986 flow [2022-12-12 19:38:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 19:38:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 19:38:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2022-12-12 19:38:10,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2022-12-12 19:38:10,368 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 40 predicate places. [2022-12-12 19:38:10,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 242 transitions, 3986 flow [2022-12-12 19:38:10,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 232 transitions, 3814 flow [2022-12-12 19:38:10,373 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 232 transitions, 3814 flow [2022-12-12 19:38:10,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:10,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:10,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:10,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-12 19:38:10,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:10,580 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:10,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1393372279, now seen corresponding path program 2 times [2022-12-12 19:38:10,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:10,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283944028] [2022-12-12 19:38:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:10,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:12,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283944028] [2022-12-12 19:38:12,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283944028] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:12,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255274110] [2022-12-12 19:38:12,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 19:38:12,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:12,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:12,214 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-12-12 19:38:12,216 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-12-12 19:38:12,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 19:38:12,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:38:12,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-12 19:38:12,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:12,465 INFO L350 Elim1Store]: Elim1 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 185 treesize of output 157 [2022-12-12 19:38:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:12,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:12,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:38:12,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 267 [2022-12-12 19:38:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:13,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255274110] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:13,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:13,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2022-12-12 19:38:13,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548989955] [2022-12-12 19:38:13,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:13,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-12 19:38:13,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-12 19:38:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-12-12 19:38:13,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:13,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 232 transitions, 3814 flow. Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:13,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:13,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:13,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:13,999 INFO L130 PetriNetUnfolder]: 361/609 cut-off events. [2022-12-12 19:38:13,999 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-12 19:38:14,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5573 conditions, 609 events. 361/609 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2500 event pairs, 0 based on Foata normal form. 2/484 useless extension candidates. Maximal degree in co-relation 2440. Up to 497 conditions per place. [2022-12-12 19:38:14,004 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 201 selfloop transitions, 125 changer transitions 10/336 dead transitions. [2022-12-12 19:38:14,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 336 transitions, 6201 flow [2022-12-12 19:38:14,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-12 19:38:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-12 19:38:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 164 transitions. [2022-12-12 19:38:14,006 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3942307692307692 [2022-12-12 19:38:14,006 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 65 predicate places. [2022-12-12 19:38:14,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 336 transitions, 6201 flow [2022-12-12 19:38:14,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 326 transitions, 6009 flow [2022-12-12 19:38:14,012 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 326 transitions, 6009 flow [2022-12-12 19:38:14,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:14,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:14,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:14,017 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-12-12 19:38:14,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:14,217 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:14,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:14,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1700152309, now seen corresponding path program 3 times [2022-12-12 19:38:14,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:14,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034340951] [2022-12-12 19:38:14,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:14,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:15,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:15,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034340951] [2022-12-12 19:38:15,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034340951] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:15,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893133648] [2022-12-12 19:38:15,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 19:38:15,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:15,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:15,035 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-12-12 19:38:15,037 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-12-12 19:38:15,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-12 19:38:15,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:38:15,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-12 19:38:15,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:15,326 INFO L350 Elim1Store]: Elim1 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 185 treesize of output 157 [2022-12-12 19:38:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:15,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:15,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:38:15,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 267 [2022-12-12 19:38:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:15,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893133648] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:15,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:15,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2022-12-12 19:38:15,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962564732] [2022-12-12 19:38:15,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:15,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-12 19:38:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:15,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-12 19:38:15,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-12-12 19:38:15,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:15,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 326 transitions, 6009 flow. Second operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:15,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:15,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:15,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:17,089 INFO L130 PetriNetUnfolder]: 425/729 cut-off events. [2022-12-12 19:38:17,089 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-12 19:38:17,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7383 conditions, 729 events. 425/729 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3269 event pairs, 0 based on Foata normal form. 2/588 useless extension candidates. Maximal degree in co-relation 3328. Up to 617 conditions per place. [2022-12-12 19:38:17,095 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 235 selfloop transitions, 151 changer transitions 10/396 dead transitions. [2022-12-12 19:38:17,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 396 transitions, 8073 flow [2022-12-12 19:38:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-12 19:38:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-12 19:38:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 174 transitions. [2022-12-12 19:38:17,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32954545454545453 [2022-12-12 19:38:17,097 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 97 predicate places. [2022-12-12 19:38:17,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 396 transitions, 8073 flow [2022-12-12 19:38:17,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 386 transitions, 7861 flow [2022-12-12 19:38:17,104 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 386 transitions, 7861 flow [2022-12-12 19:38:17,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:17,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:17,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:17,109 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-12-12 19:38:17,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:17,310 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:17,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1704314831, now seen corresponding path program 4 times [2022-12-12 19:38:17,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:17,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53843298] [2022-12-12 19:38:17,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:17,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:18,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:18,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53843298] [2022-12-12 19:38:18,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53843298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:18,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578321168] [2022-12-12 19:38:18,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 19:38:18,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:18,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:18,507 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-12-12 19:38:18,508 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-12-12 19:38:18,587 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 19:38:18,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:38:18,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-12 19:38:18,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:18,616 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:18,656 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:18,709 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:18,919 INFO L350 Elim1Store]: Elim1 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 173 treesize of output 153 [2022-12-12 19:38:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:18,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:19,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578321168] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:19,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:19,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-12-12 19:38:19,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270857664] [2022-12-12 19:38:19,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:19,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-12 19:38:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:19,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-12 19:38:19,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=445, Unknown=1, NotChecked=0, Total=552 [2022-12-12 19:38:19,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:19,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 386 transitions, 7861 flow. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:19,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:19,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:19,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:21,078 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (not (< c_~j~0 c_~N~0))) (.cse3 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648)))) (.cse5 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (.cse10 (+ c_~A~0.offset (* c_~i~0 4))) (.cse11 (+ c_~A~0.offset (* c_~j~0 4))) (.cse2 (< (+ c_~j~0 1) c_~N~0))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= c_~sum2~0 2147483647) (let ((.cse9 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse9 .cse11))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) .cse1 .cse2 (let ((.cse6 (select .cse9 .cse10))) (let ((.cse4 (let ((.cse8 (+ c_~bag1~0 c_~sum1~0 .cse6)) (.cse7 (+ c_~bag2~0 .cse0 c_~sum2~0))) (and (<= .cse7 .cse8) (<= .cse8 .cse7))))) (and (or .cse3 .cse4 .cse5) (or (not (<= (+ c_~bag1~0 .cse6) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse6 2147483648))) .cse4))))))) (or (not (< c_~i~0 c_~N~0)) .cse1 (and (forall ((v_ArrVal_240 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_240) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse10)) (.cse12 (select .cse14 .cse11))) (or (not (<= (+ .cse12 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse13 c_~bag1~0 2147483648))) (not (<= (+ .cse13 c_~bag1~0) 2147483647)) (<= (+ .cse13 c_~bag1~0 c_~sum1~0) (+ .cse12 c_~bag2~0 c_~sum2~0)) (not (<= 0 (+ .cse12 c_~bag2~0 2147483648))))))) (or .cse3 (and (forall ((v_ArrVal_240 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_240) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse11))) (or (not (<= (+ .cse15 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse15 c_~bag2~0 2147483648))) (<= (+ .cse15 c_~bag2~0 c_~sum2~0) (+ (select .cse16 .cse10) c_~bag1~0 c_~sum1~0)))))) (forall ((v_ArrVal_240 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_240) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse11))) (or (not (<= (+ .cse17 c_~bag2~0) 2147483647)) (<= (+ (select .cse18 .cse10) c_~bag1~0 c_~sum1~0) (+ .cse17 c_~bag2~0 c_~sum2~0)) (not (<= 0 (+ .cse17 c_~bag2~0 2147483648)))))))) .cse5) (forall ((v_ArrVal_240 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_240) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse11)) (.cse20 (select .cse21 .cse10))) (or (not (<= (+ .cse19 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse20 c_~bag1~0 2147483648))) (not (<= (+ .cse20 c_~bag1~0) 2147483647)) (not (<= 0 (+ .cse19 c_~bag2~0 2147483648))) (<= (+ .cse19 c_~bag2~0 c_~sum2~0) (+ .cse20 c_~bag1~0 c_~sum1~0))))))) .cse2) (= c_~sum1~0 c_~sum2~0) (<= 0 (+ c_~sum2~0 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-12-12 19:38:24,092 INFO L130 PetriNetUnfolder]: 556/1006 cut-off events. [2022-12-12 19:38:24,093 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-12 19:38:24,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11197 conditions, 1006 events. 556/1006 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5163 event pairs, 0 based on Foata normal form. 3/819 useless extension candidates. Maximal degree in co-relation 5573. Up to 886 conditions per place. [2022-12-12 19:38:24,110 INFO L137 encePairwiseOnDemand]: 4/16 looper letters, 364 selfloop transitions, 201 changer transitions 17/582 dead transitions. [2022-12-12 19:38:24,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 582 transitions, 13041 flow [2022-12-12 19:38:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-12 19:38:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-12-12 19:38:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 257 transitions. [2022-12-12 19:38:24,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3346354166666667 [2022-12-12 19:38:24,115 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 144 predicate places. [2022-12-12 19:38:24,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 582 transitions, 13041 flow [2022-12-12 19:38:24,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 565 transitions, 12649 flow [2022-12-12 19:38:24,127 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 565 transitions, 12649 flow [2022-12-12 19:38:24,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:24,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:24,127 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:24,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-12 19:38:24,331 WARN L477 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-12-12 19:38:24,332 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:24,332 INFO L85 PathProgramCache]: Analyzing trace with hash 538065625, now seen corresponding path program 5 times [2022-12-12 19:38:24,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:24,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141096817] [2022-12-12 19:38:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:24,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:24,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:24,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141096817] [2022-12-12 19:38:24,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141096817] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:24,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839654442] [2022-12-12 19:38:24,974 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 19:38:24,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:24,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:24,996 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-12-12 19:38:25,011 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-12-12 19:38:25,090 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 19:38:25,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:38:25,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-12 19:38:25,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:25,114 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:25,138 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:25,183 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:25,311 INFO L350 Elim1Store]: Elim1 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 175 treesize of output 151 [2022-12-12 19:38:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:25,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:25,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839654442] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:25,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:25,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2022-12-12 19:38:25,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253238046] [2022-12-12 19:38:25,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:25,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-12 19:38:25,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:25,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-12 19:38:25,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=339, Unknown=7, NotChecked=0, Total=420 [2022-12-12 19:38:25,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:25,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 565 transitions, 12649 flow. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:25,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:25,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:25,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:26,834 INFO L130 PetriNetUnfolder]: 564/1019 cut-off events. [2022-12-12 19:38:26,835 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-12 19:38:26,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12360 conditions, 1019 events. 564/1019 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5288 event pairs, 0 based on Foata normal form. 2/833 useless extension candidates. Maximal degree in co-relation 6052. Up to 896 conditions per place. [2022-12-12 19:38:26,843 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 466 selfloop transitions, 110 changer transitions 10/586 dead transitions. [2022-12-12 19:38:26,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 586 transitions, 14301 flow [2022-12-12 19:38:26,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 19:38:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 19:38:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 116 transitions. [2022-12-12 19:38:26,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3815789473684211 [2022-12-12 19:38:26,844 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 160 predicate places. [2022-12-12 19:38:26,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 586 transitions, 14301 flow [2022-12-12 19:38:26,854 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 576 transitions, 14049 flow [2022-12-12 19:38:26,854 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 576 transitions, 14049 flow [2022-12-12 19:38:26,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:26,855 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:26,855 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:26,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-12 19:38:27,059 WARN L477 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-12-12 19:38:27,059 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash 844845655, now seen corresponding path program 6 times [2022-12-12 19:38:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:27,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834357038] [2022-12-12 19:38:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:27,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:27,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:27,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834357038] [2022-12-12 19:38:27,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834357038] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:27,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155734362] [2022-12-12 19:38:27,947 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 19:38:27,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:27,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:27,949 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-12-12 19:38:27,969 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-12-12 19:38:28,114 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-12 19:38:28,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:38:28,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-12 19:38:28,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:28,140 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:28,185 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:28,232 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:28,411 INFO L350 Elim1Store]: Elim1 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 157 treesize of output 145 [2022-12-12 19:38:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:28,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:29,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:29,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155734362] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:29,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:29,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2022-12-12 19:38:29,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626007865] [2022-12-12 19:38:29,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:29,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-12 19:38:29,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:29,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-12 19:38:29,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=383, Unknown=4, NotChecked=0, Total=462 [2022-12-12 19:38:29,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:29,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 576 transitions, 14049 flow. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:29,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:29,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:29,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:30,113 INFO L130 PetriNetUnfolder]: 566/1033 cut-off events. [2022-12-12 19:38:30,113 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-12 19:38:30,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13562 conditions, 1033 events. 566/1033 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5409 event pairs, 0 based on Foata normal form. 2/851 useless extension candidates. Maximal degree in co-relation 6670. Up to 910 conditions per place. [2022-12-12 19:38:30,120 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 519 selfloop transitions, 72 changer transitions 10/601 dead transitions. [2022-12-12 19:38:30,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 601 transitions, 15863 flow [2022-12-12 19:38:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 19:38:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 19:38:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 108 transitions. [2022-12-12 19:38:30,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2022-12-12 19:38:30,129 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 178 predicate places. [2022-12-12 19:38:30,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 601 transitions, 15863 flow [2022-12-12 19:38:30,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 591 transitions, 15591 flow [2022-12-12 19:38:30,139 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 591 transitions, 15591 flow [2022-12-12 19:38:30,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:30,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:30,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:30,148 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-12-12 19:38:30,344 WARN L477 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-12-12 19:38:30,345 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:30,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1749890801, now seen corresponding path program 7 times [2022-12-12 19:38:30,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:30,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074978746] [2022-12-12 19:38:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:30,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:31,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:31,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074978746] [2022-12-12 19:38:31,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074978746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:31,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008886424] [2022-12-12 19:38:31,268 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 19:38:31,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:31,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:31,270 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-12-12 19:38:31,272 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-12-12 19:38:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:31,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-12 19:38:31,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:31,412 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:31,442 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:31,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:38:31,553 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:31,671 INFO L350 Elim1Store]: Elim1 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 185 treesize of output 157 [2022-12-12 19:38:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:31,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:31,968 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) c_~A~0.base) .cse2))) (or (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (<= .cse1 (+ .cse0 c_~bag2~0 c_~sum2~0)) (not (<= (+ .cse0 c_~bag2~0) 2147483647))))) (forall ((v_ArrVal_342 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) c_~A~0.base) .cse2))) (or (not (<= 0 (+ .cse3 c_~bag2~0 2147483648))) (<= (+ .cse3 c_~bag2~0 c_~sum2~0) .cse1) (not (<= (+ .cse3 c_~bag2~0) 2147483647))))))) is different from false [2022-12-12 19:38:32,274 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse0 2147483647)) (not (<= 0 (+ .cse0 2147483648))) (<= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse2 2147483647)) (<= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse2) (not (<= 0 (+ .cse2 2147483648))))))) (forall ((v_ArrVal_341 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse4 2147483647)) (not (<= 0 (+ .cse4 2147483648))) (forall ((v_ArrVal_342 (Array Int Int))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= .cse4 .cse5) (not (<= 0 (+ .cse5 2147483648)))))))))) (forall ((v_ArrVal_341 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse7 2147483647)) (forall ((v_ArrVal_342 (Array Int Int))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse8 2147483647)) (<= .cse8 .cse7)))) (not (<= 0 (+ .cse7 2147483648)))))))) is different from false [2022-12-12 19:38:32,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:38:32,290 INFO L350 Elim1Store]: Elim1 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 119 treesize of output 71 [2022-12-12 19:38:32,293 INFO L350 Elim1Store]: Elim1 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 420 treesize of output 372 [2022-12-12 19:38:32,301 INFO L350 Elim1Store]: Elim1 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 310 treesize of output 286 [2022-12-12 19:38:32,304 INFO L350 Elim1Store]: Elim1 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 330 treesize of output 306 [2022-12-12 19:38:32,465 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 19:38:32,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 1 [2022-12-12 19:38:32,469 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 19:38:32,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-12-12 19:38:32,472 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 19:38:32,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-12-12 19:38:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-12 19:38:32,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008886424] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:32,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:32,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-12-12 19:38:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321815666] [2022-12-12 19:38:32,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:32,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-12 19:38:32,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:32,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-12 19:38:32,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=425, Unknown=2, NotChecked=86, Total=600 [2022-12-12 19:38:32,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:32,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 591 transitions, 15591 flow. Second operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:32,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:32,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:32,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:33,590 INFO L130 PetriNetUnfolder]: 609/1127 cut-off events. [2022-12-12 19:38:33,590 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-12 19:38:33,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15922 conditions, 1127 events. 609/1127 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6158 event pairs, 0 based on Foata normal form. 2/927 useless extension candidates. Maximal degree in co-relation 7222. Up to 1004 conditions per place. [2022-12-12 19:38:33,597 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 524 selfloop transitions, 124 changer transitions 10/658 dead transitions. [2022-12-12 19:38:33,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 658 transitions, 18688 flow [2022-12-12 19:38:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 19:38:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 19:38:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 104 transitions. [2022-12-12 19:38:33,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-12 19:38:33,599 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 193 predicate places. [2022-12-12 19:38:33,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 658 transitions, 18688 flow [2022-12-12 19:38:33,609 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 648 transitions, 18396 flow [2022-12-12 19:38:33,610 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 648 transitions, 18396 flow [2022-12-12 19:38:33,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:33,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:33,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:33,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-12 19:38:33,814 WARN L477 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-12-12 19:38:33,814 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:33,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:33,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1037591513, now seen corresponding path program 8 times [2022-12-12 19:38:33,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:33,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786661131] [2022-12-12 19:38:33,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:33,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:34,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:34,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786661131] [2022-12-12 19:38:34,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786661131] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:34,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692444278] [2022-12-12 19:38:34,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 19:38:34,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:34,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:34,493 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-12-12 19:38:34,534 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-12-12 19:38:34,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 19:38:34,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:38:34,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-12 19:38:34,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:34,612 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:34,639 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:34,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:38:34,764 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:34,833 INFO L350 Elim1Store]: Elim1 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 185 treesize of output 157 [2022-12-12 19:38:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:34,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:35,407 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse0 2147483647)) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse0) (not (<= 0 (+ 2147483648 .cse0))))))) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse2 2147483647)) (forall ((v_ArrVal_376 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= .cse2 .cse3) (not (<= 0 (+ 2147483648 .cse3)))))) (not (<= 0 (+ .cse2 2147483648))))))) (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse5 2147483647)) (<= .cse5 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (<= 0 (+ 2147483648 .cse5))))))) (forall ((v_ArrVal_375 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_375))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_376 (Array Int Int))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse7 2147483647)) (<= .cse7 .cse8)))) (not (<= .cse8 2147483647)) (not (<= 0 (+ .cse8 2147483648)))))))) is different from false [2022-12-12 19:38:35,423 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:38:35,423 INFO L350 Elim1Store]: Elim1 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 99 treesize of output 63 [2022-12-12 19:38:35,426 INFO L350 Elim1Store]: Elim1 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 506 treesize of output 458 [2022-12-12 19:38:35,438 INFO L350 Elim1Store]: Elim1 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 317 treesize of output 291 [2022-12-12 19:38:35,442 INFO L350 Elim1Store]: Elim1 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 279 treesize of output 267 [2022-12-12 19:38:35,479 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 19:38:35,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 1 [2022-12-12 19:38:35,483 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 19:38:35,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-12-12 19:38:35,489 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 19:38:35,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 1 [2022-12-12 19:38:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-12 19:38:35,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692444278] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:35,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:35,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-12-12 19:38:35,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954409761] [2022-12-12 19:38:35,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:35,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-12 19:38:35,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:35,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-12 19:38:35,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=419, Unknown=5, NotChecked=42, Total=552 [2022-12-12 19:38:35,503 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:35,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 648 transitions, 18396 flow. Second operand has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:35,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:35,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:35,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:36,977 INFO L130 PetriNetUnfolder]: 750/1383 cut-off events. [2022-12-12 19:38:36,978 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-12-12 19:38:36,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20907 conditions, 1383 events. 750/1383 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 7713 event pairs, 0 based on Foata normal form. 4/1119 useless extension candidates. Maximal degree in co-relation 9653. Up to 1260 conditions per place. [2022-12-12 19:38:36,986 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 619 selfloop transitions, 171 changer transitions 21/811 dead transitions. [2022-12-12 19:38:36,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 811 transitions, 24642 flow [2022-12-12 19:38:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-12 19:38:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-12 19:38:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 134 transitions. [2022-12-12 19:38:36,987 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2022-12-12 19:38:36,988 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 213 predicate places. [2022-12-12 19:38:36,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 811 transitions, 24642 flow [2022-12-12 19:38:37,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 790 transitions, 23988 flow [2022-12-12 19:38:37,001 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 790 transitions, 23988 flow [2022-12-12 19:38:37,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:37,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:37,001 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:37,024 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-12-12 19:38:37,205 WARN L477 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-12-12 19:38:37,206 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:37,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash -239376407, now seen corresponding path program 9 times [2022-12-12 19:38:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:37,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705072565] [2022-12-12 19:38:37,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:38,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:38,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705072565] [2022-12-12 19:38:38,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705072565] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:38,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747093750] [2022-12-12 19:38:38,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 19:38:38,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:38,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:38,146 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-12-12 19:38:38,147 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-12-12 19:38:38,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 19:38:38,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:38:38,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-12 19:38:38,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:38,234 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-12-12 19:38:38,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-12-12 19:38:38,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 19:38:38,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-12-12 19:38:38,541 INFO L350 Elim1Store]: Elim1 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 217 treesize of output 185 [2022-12-12 19:38:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:38,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:38,816 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) c_~A~0.base) .cse1))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= c_~sum1~0 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) c_~A~0.base) .cse1))) (or (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (<= (+ c_~bag2~0 .cse2 c_~sum2~0) c_~sum1~0)))))) is different from false [2022-12-12 19:38:38,832 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648)))))))) is different from false [2022-12-12 19:38:39,099 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_413 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_413))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse0 2147483648))) (not (<= .cse0 2147483647)) (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse1 2147483647)) (<= .cse1 .cse0)))))))) (forall ((v_ArrVal_413 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_413))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_414 (Array Int Int))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse3 2147483648))) (<= .cse4 .cse3)))) (not (<= 0 (+ .cse4 2147483648))) (not (<= .cse4 2147483647)))))) (forall ((v_ArrVal_414 (Array Int Int)) (v_ArrVal_413 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_413))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse6 2147483647)) (not (<= 0 (+ .cse6 2147483648))) (<= (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse6))))) (forall ((v_ArrVal_414 (Array Int Int)) (v_ArrVal_413 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_413))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_414) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse8 2147483647)) (not (<= 0 (+ .cse8 2147483648))) (<= .cse8 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) is different from false [2022-12-12 19:38:39,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:38:39,115 INFO L350 Elim1Store]: Elim1 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 121 treesize of output 73 [2022-12-12 19:38:39,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 388 [2022-12-12 19:38:39,123 INFO L350 Elim1Store]: Elim1 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 370 treesize of output 346 [2022-12-12 19:38:39,127 INFO L350 Elim1Store]: Elim1 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 306 treesize of output 282 [2022-12-12 19:38:39,437 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 19:38:39,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-12-12 19:38:39,441 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 19:38:39,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 1 [2022-12-12 19:38:39,444 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 19:38:39,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-12-12 19:38:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-12 19:38:39,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747093750] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:39,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:39,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-12-12 19:38:39,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751623553] [2022-12-12 19:38:39,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:39,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-12 19:38:39,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:39,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-12 19:38:39,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=356, Unknown=3, NotChecked=120, Total=552 [2022-12-12 19:38:39,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:39,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 790 transitions, 23988 flow. Second operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:39,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:39,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:39,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:45,041 INFO L130 PetriNetUnfolder]: 748/1379 cut-off events. [2022-12-12 19:38:45,041 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-12-12 19:38:45,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22225 conditions, 1379 events. 748/1379 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7672 event pairs, 0 based on Foata normal form. 2/1123 useless extension candidates. Maximal degree in co-relation 10214. Up to 1256 conditions per place. [2022-12-12 19:38:45,073 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 686 selfloop transitions, 112 changer transitions 10/808 dead transitions. [2022-12-12 19:38:45,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 808 transitions, 26162 flow [2022-12-12 19:38:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 19:38:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 19:38:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 108 transitions. [2022-12-12 19:38:45,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2022-12-12 19:38:45,075 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 229 predicate places. [2022-12-12 19:38:45,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 808 transitions, 26162 flow [2022-12-12 19:38:45,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 798 transitions, 25830 flow [2022-12-12 19:38:45,089 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 798 transitions, 25830 flow [2022-12-12 19:38:45,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:45,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:45,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:45,093 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-12-12 19:38:45,293 WARN L477 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-12-12 19:38:45,294 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1344371543, now seen corresponding path program 10 times [2022-12-12 19:38:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:45,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134963164] [2022-12-12 19:38:45,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:45,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134963164] [2022-12-12 19:38:45,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134963164] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:45,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404571978] [2022-12-12 19:38:45,997 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 19:38:45,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:45,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:45,998 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-12-12 19:38:45,999 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-12-12 19:38:46,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 19:38:46,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:38:46,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-12 19:38:46,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:46,105 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-12-12 19:38:46,139 INFO L350 Elim1Store]: Elim1 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-12-12 19:38:46,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:38:46,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-12 19:38:46,342 INFO L350 Elim1Store]: Elim1 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 179 treesize of output 151 [2022-12-12 19:38:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:46,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:46,928 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~j~0 c_~N~0)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse0 (let ((.cse3 (+ c_~bag1~0 c_~sum1~0 .cse2)) (.cse5 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_448 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) c_~A~0.base) .cse5))) (or (< .cse3 (+ c_~bag2~0 .cse4 c_~sum2~0 1)) (not (<= (+ c_~bag2~0 .cse4) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse4 2147483648)))))) (forall ((v_ArrVal_448 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) c_~A~0.base) .cse5))) (or (not (<= (+ c_~bag2~0 .cse6) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse6 2147483648))) (<= (+ c_~bag2~0 .cse6 c_~sum2~0) .cse3))))))) (.cse1 (< (+ c_~i~0 1) c_~N~0))) (and (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse0 .cse1 (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (or .cse0 (not (<= (+ c_~bag1~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse2 2147483648))) .cse1)))) (< (+ c_~j~0 1) c_~N~0)) is different from false [2022-12-12 19:38:49,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:38:49,194 INFO L350 Elim1Store]: Elim1 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 101 treesize of output 65 [2022-12-12 19:38:49,197 INFO L350 Elim1Store]: Elim1 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 530 treesize of output 482 [2022-12-12 19:38:49,205 INFO L350 Elim1Store]: Elim1 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 327 treesize of output 301 [2022-12-12 19:38:49,210 INFO L350 Elim1Store]: Elim1 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 287 treesize of output 275 [2022-12-12 19:38:49,255 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 19:38:49,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-12-12 19:38:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-12 19:38:49,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404571978] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:49,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:49,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-12-12 19:38:49,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066581022] [2022-12-12 19:38:49,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:49,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-12 19:38:49,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:49,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-12 19:38:49,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=4, NotChecked=46, Total=650 [2022-12-12 19:38:49,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:49,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 798 transitions, 25830 flow. Second operand has 26 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:49,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:49,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:49,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:52,386 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse3 (+ c_~bag1~0 c_~sum1~0)) (.cse6 (+ c_~A~0.offset (* c_~j~0 4))) (.cse2 (not (< c_~j~0 c_~N~0))) (.cse4 (< c_~i~0 c_~N~0)) (.cse5 (< (+ c_~j~0 1) c_~N~0))) (and (<= 0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~sum2~0 2147483647) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (= c_~sum1~0 c_~sum2~0) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) .cse6))) (or (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse1 2147483648))) .cse2 (and (< .cse3 (+ c_~bag2~0 .cse1 c_~sum2~0 1)) (<= (+ c_~bag2~0 .cse1 c_~sum2~0) .cse3)) .cse4 .cse5)) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 (+ c_~sum2~0 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and (forall ((v_ArrVal_448 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) c_~A~0.base) .cse6))) (or (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648))) (< .cse3 (+ c_~bag2~0 .cse7 c_~sum2~0 1))))) (forall ((v_ArrVal_448 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_448) c_~A~0.base) .cse6))) (or (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse8 2147483648))) (<= (+ c_~bag2~0 .cse8 c_~sum2~0) .cse3))))) .cse2 .cse4 .cse5))) is different from false [2022-12-12 19:38:52,854 INFO L130 PetriNetUnfolder]: 961/1763 cut-off events. [2022-12-12 19:38:52,855 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-12 19:38:52,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30161 conditions, 1763 events. 961/1763 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 10358 event pairs, 0 based on Foata normal form. 8/1415 useless extension candidates. Maximal degree in co-relation 12947. Up to 1640 conditions per place. [2022-12-12 19:38:52,879 INFO L137 encePairwiseOnDemand]: 5/16 looper letters, 576 selfloop transitions, 436 changer transitions 31/1043 dead transitions. [2022-12-12 19:38:52,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 1043 transitions, 35834 flow [2022-12-12 19:38:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-12 19:38:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-12 19:38:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 239 transitions. [2022-12-12 19:38:52,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3556547619047619 [2022-12-12 19:38:52,891 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 270 predicate places. [2022-12-12 19:38:52,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 1043 transitions, 35834 flow [2022-12-12 19:38:52,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 1012 transitions, 34756 flow [2022-12-12 19:38:52,930 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 1012 transitions, 34756 flow [2022-12-12 19:38:52,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:52,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:52,930 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:52,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-12 19:38:53,134 WARN L477 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-12-12 19:38:53,135 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:53,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:53,135 INFO L85 PathProgramCache]: Analyzing trace with hash 851771077, now seen corresponding path program 11 times [2022-12-12 19:38:53,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:53,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288097701] [2022-12-12 19:38:53,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:53,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:53,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:53,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288097701] [2022-12-12 19:38:53,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288097701] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:53,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156715553] [2022-12-12 19:38:53,258 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 19:38:53,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:53,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:53,273 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-12-12 19:38:53,307 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-12-12 19:38:53,363 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 19:38:53,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:38:53,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-12 19:38:53,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:53,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:54,049 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-12-12 19:38:54,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 497 treesize of output 353 [2022-12-12 19:38:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:54,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156715553] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:54,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:54,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2022-12-12 19:38:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958070385] [2022-12-12 19:38:54,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:54,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 19:38:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 19:38:54,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-12 19:38:54,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:54,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 1012 transitions, 34756 flow. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:54,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:54,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:54,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:55,476 INFO L130 PetriNetUnfolder]: 617/1212 cut-off events. [2022-12-12 19:38:55,476 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-12 19:38:55,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21961 conditions, 1212 events. 617/1212 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7019 event pairs, 0 based on Foata normal form. 48/1046 useless extension candidates. Maximal degree in co-relation 15202. Up to 1103 conditions per place. [2022-12-12 19:38:55,484 INFO L137 encePairwiseOnDemand]: 8/16 looper letters, 433 selfloop transitions, 227 changer transitions 80/740 dead transitions. [2022-12-12 19:38:55,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 740 transitions, 26916 flow [2022-12-12 19:38:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-12 19:38:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-12 19:38:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 124 transitions. [2022-12-12 19:38:55,485 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2022-12-12 19:38:55,485 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 272 predicate places. [2022-12-12 19:38:55,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 292 places, 740 transitions, 26916 flow [2022-12-12 19:38:55,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 660 transitions, 23961 flow [2022-12-12 19:38:55,498 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 660 transitions, 23961 flow [2022-12-12 19:38:55,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:55,498 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:55,498 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:55,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-12 19:38:55,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-12 19:38:55,703 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1187496265, now seen corresponding path program 12 times [2022-12-12 19:38:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:55,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656653082] [2022-12-12 19:38:55,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:55,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:55,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656653082] [2022-12-12 19:38:55,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656653082] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:55,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769894409] [2022-12-12 19:38:55,822 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 19:38:55,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:55,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:55,823 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:38:55,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-12 19:38:55,915 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-12 19:38:55,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:38:55,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-12 19:38:55,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:56,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:56,102 INFO L350 Elim1Store]: Elim1 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 239 treesize of output 223 [2022-12-12 19:38:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:38:56,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769894409] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:56,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:56,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-12 19:38:56,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130501231] [2022-12-12 19:38:56,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:56,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-12 19:38:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:56,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-12 19:38:56,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-12 19:38:56,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:56,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 660 transitions, 23961 flow. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:56,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:56,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:56,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:56,529 INFO L130 PetriNetUnfolder]: 601/1127 cut-off events. [2022-12-12 19:38:56,529 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-12 19:38:56,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21522 conditions, 1127 events. 601/1127 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6019 event pairs, 0 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 16283. Up to 1018 conditions per place. [2022-12-12 19:38:56,537 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 521 selfloop transitions, 159 changer transitions 0/680 dead transitions. [2022-12-12 19:38:56,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 680 transitions, 26026 flow [2022-12-12 19:38:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 19:38:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 19:38:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-12-12 19:38:56,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-12 19:38:56,539 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 254 predicate places. [2022-12-12 19:38:56,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 680 transitions, 26026 flow [2022-12-12 19:38:56,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 680 transitions, 26026 flow [2022-12-12 19:38:56,552 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 680 transitions, 26026 flow [2022-12-12 19:38:56,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:56,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:56,553 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:56,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-12 19:38:56,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:56,758 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:56,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:56,758 INFO L85 PathProgramCache]: Analyzing trace with hash -184597874, now seen corresponding path program 13 times [2022-12-12 19:38:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:56,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320064978] [2022-12-12 19:38:56,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:56,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:56,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:56,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320064978] [2022-12-12 19:38:56,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320064978] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:56,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431937517] [2022-12-12 19:38:56,862 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 19:38:56,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:56,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:56,863 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:38:56,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-12 19:38:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:56,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-12 19:38:56,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:57,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:57,120 INFO L350 Elim1Store]: Elim1 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 239 treesize of output 223 [2022-12-12 19:38:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:38:57,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431937517] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:57,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:57,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-12 19:38:57,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533821883] [2022-12-12 19:38:57,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:57,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 19:38:57,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:57,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 19:38:57,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-12 19:38:57,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:57,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 680 transitions, 26026 flow. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:57,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:57,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:57,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:57,494 INFO L130 PetriNetUnfolder]: 550/1024 cut-off events. [2022-12-12 19:38:57,494 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-12 19:38:57,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20585 conditions, 1024 events. 550/1024 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5226 event pairs, 0 based on Foata normal form. 10/848 useless extension candidates. Maximal degree in co-relation 17138. Up to 918 conditions per place. [2022-12-12 19:38:57,501 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 543 selfloop transitions, 27 changer transitions 44/614 dead transitions. [2022-12-12 19:38:57,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 614 transitions, 24731 flow [2022-12-12 19:38:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 19:38:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 19:38:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-12-12 19:38:57,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2022-12-12 19:38:57,504 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 250 predicate places. [2022-12-12 19:38:57,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 614 transitions, 24731 flow [2022-12-12 19:38:57,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 570 transitions, 22953 flow [2022-12-12 19:38:57,516 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 570 transitions, 22953 flow [2022-12-12 19:38:57,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:57,516 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:57,516 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:57,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-12 19:38:57,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:57,718 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1904918794, now seen corresponding path program 14 times [2022-12-12 19:38:57,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:57,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063207980] [2022-12-12 19:38:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:57,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:38:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:38:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:38:57,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063207980] [2022-12-12 19:38:57,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063207980] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:38:57,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639469142] [2022-12-12 19:38:57,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 19:38:57,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:57,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:38:57,852 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:38:57,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-12 19:38:57,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 19:38:57,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:38:57,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-12 19:38:57,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:38:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:38:58,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:38:58,130 INFO L350 Elim1Store]: Elim1 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 260 treesize of output 212 [2022-12-12 19:38:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:38:58,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639469142] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:38:58,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:38:58,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-12 19:38:58,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55799025] [2022-12-12 19:38:58,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:38:58,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-12 19:38:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:38:58,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-12 19:38:58,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-12-12 19:38:58,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:38:58,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 570 transitions, 22953 flow. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:58,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:38:58,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:38:58,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:38:58,527 INFO L130 PetriNetUnfolder]: 508/891 cut-off events. [2022-12-12 19:38:58,527 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-12 19:38:58,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18803 conditions, 891 events. 508/891 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4135 event pairs, 0 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 16439. Up to 827 conditions per place. [2022-12-12 19:38:58,533 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 417 selfloop transitions, 99 changer transitions 0/516 dead transitions. [2022-12-12 19:38:58,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 516 transitions, 21819 flow [2022-12-12 19:38:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 19:38:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 19:38:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-12-12 19:38:58,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3046875 [2022-12-12 19:38:58,535 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 169 predicate places. [2022-12-12 19:38:58,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 516 transitions, 21819 flow [2022-12-12 19:38:58,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 516 transitions, 21819 flow [2022-12-12 19:38:58,546 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 516 transitions, 21819 flow [2022-12-12 19:38:58,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:38:58,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:38:58,547 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:38:58,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-12 19:38:58,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:38:58,752 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:38:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:38:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1076597590, now seen corresponding path program 15 times [2022-12-12 19:38:58,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:38:58,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392511453] [2022-12-12 19:38:58,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:38:58,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:38:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:39:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:39:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:39:02,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392511453] [2022-12-12 19:39:02,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392511453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:39:02,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784944233] [2022-12-12 19:39:02,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 19:39:02,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:39:02,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:39:02,564 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:39:02,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-12 19:39:02,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-12 19:39:02,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:39:02,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-12 19:39:02,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:39:02,725 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-12-12 19:39:02,761 INFO L350 Elim1Store]: Elim1 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-12-12 19:39:02,837 INFO L350 Elim1Store]: Elim1 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-12-12 19:39:03,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:39:03,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 168 [2022-12-12 19:39:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:39:03,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:39:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:39:11,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784944233] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:39:11,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:39:11,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 33 [2022-12-12 19:39:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675582812] [2022-12-12 19:39:11,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:39:11,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-12 19:39:11,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:39:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-12 19:39:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=963, Unknown=3, NotChecked=0, Total=1122 [2022-12-12 19:39:11,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:39:11,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 516 transitions, 21819 flow. Second operand has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:39:11,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:39:11,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:39:11,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:39:30,077 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 333 DAG size of output: 329 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:40:09,342 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 309 DAG size of output: 305 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:40:19,104 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 309 DAG size of output: 307 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:40:36,768 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 286 DAG size of output: 275 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:40:52,466 WARN L233 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 292 DAG size of output: 288 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:41:09,389 WARN L233 SmtUtils]: Spent 7.35s on a formula simplification. DAG size of input: 298 DAG size of output: 292 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:41:21,751 WARN L233 SmtUtils]: Spent 5.99s on a formula simplification. DAG size of input: 329 DAG size of output: 325 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:41:33,579 WARN L233 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 326 DAG size of output: 303 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:41:48,006 WARN L233 SmtUtils]: Spent 7.60s on a formula simplification. DAG size of input: 312 DAG size of output: 301 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:41:56,967 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 314 DAG size of output: 305 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:42:04,290 WARN L233 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 320 DAG size of output: 309 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:42:04,777 INFO L130 PetriNetUnfolder]: 1855/3216 cut-off events. [2022-12-12 19:42:04,777 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2022-12-12 19:42:04,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71047 conditions, 3216 events. 1855/3216 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 19572 event pairs, 0 based on Foata normal form. 4/2616 useless extension candidates. Maximal degree in co-relation 34292. Up to 3087 conditions per place. [2022-12-12 19:42:04,832 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 931 selfloop transitions, 864 changer transitions 61/1856 dead transitions. [2022-12-12 19:42:04,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 1856 transitions, 82261 flow [2022-12-12 19:42:04,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-12-12 19:42:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2022-12-12 19:42:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 483 transitions. [2022-12-12 19:42:04,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3211436170212766 [2022-12-12 19:42:04,835 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 262 predicate places. [2022-12-12 19:42:04,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 282 places, 1856 transitions, 82261 flow [2022-12-12 19:42:04,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 1795 transitions, 79517 flow [2022-12-12 19:42:04,877 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 1795 transitions, 79517 flow [2022-12-12 19:42:04,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:42:04,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:42:04,877 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:42:04,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-12 19:42:05,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:42:05,083 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:42:05,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:42:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1683039038, now seen corresponding path program 16 times [2022-12-12 19:42:05,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:42:05,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326393153] [2022-12-12 19:42:05,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:42:05,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:42:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:42:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:42:09,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:42:09,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326393153] [2022-12-12 19:42:09,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326393153] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:42:09,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027131852] [2022-12-12 19:42:09,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 19:42:09,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:42:09,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:42:09,606 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:42:09,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-12 19:42:09,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 19:42:09,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:42:09,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-12 19:42:09,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:42:10,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:42:10,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 168 [2022-12-12 19:42:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:42:10,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:42:13,986 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 19:42:13,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 630 treesize of output 242 [2022-12-12 19:42:14,141 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-12-12 19:42:14,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1119 treesize of output 1 [2022-12-12 19:42:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:42:14,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027131852] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:42:14,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:42:14,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 33 [2022-12-12 19:42:14,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994123882] [2022-12-12 19:42:14,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:42:14,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-12 19:42:14,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:42:14,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-12 19:42:14,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2022-12-12 19:42:14,257 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:42:14,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 1795 transitions, 79517 flow. Second operand has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:42:14,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:42:14,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:42:14,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:42:43,767 INFO L130 PetriNetUnfolder]: 2551/4301 cut-off events. [2022-12-12 19:42:43,767 INFO L131 PetriNetUnfolder]: For 326/326 co-relation queries the response was YES. [2022-12-12 19:42:43,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99288 conditions, 4301 events. 2551/4301 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 26772 event pairs, 0 based on Foata normal form. 5/3475 useless extension candidates. Maximal degree in co-relation 48478. Up to 4169 conditions per place. [2022-12-12 19:42:43,801 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 1204 selfloop transitions, 1221 changer transitions 44/2469 dead transitions. [2022-12-12 19:42:43,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 2469 transitions, 114309 flow [2022-12-12 19:42:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-12-12 19:42:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2022-12-12 19:42:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 417 transitions. [2022-12-12 19:42:43,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31026785714285715 [2022-12-12 19:42:43,804 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 342 predicate places. [2022-12-12 19:42:43,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 362 places, 2469 transitions, 114309 flow [2022-12-12 19:42:43,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 2425 transitions, 112243 flow [2022-12-12 19:42:43,863 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 2425 transitions, 112243 flow [2022-12-12 19:42:43,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:42:43,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:42:43,864 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:42:43,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-12 19:42:44,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:42:44,068 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:42:44,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:42:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2088558296, now seen corresponding path program 17 times [2022-12-12 19:42:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:42:44,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696063495] [2022-12-12 19:42:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:42:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:42:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:42:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:42:51,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:42:51,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696063495] [2022-12-12 19:42:51,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696063495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:42:51,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143070119] [2022-12-12 19:42:51,652 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 19:42:51,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:42:51,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:42:51,658 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:42:51,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-12 19:42:51,767 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-12 19:42:51,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:42:51,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-12 19:42:51,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:42:52,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:42:52,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 205 [2022-12-12 19:42:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:42:52,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:42:56,214 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 19:42:56,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1119 treesize of output 445 [2022-12-12 19:42:56,535 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 19:42:56,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 630 treesize of output 242 [2022-12-12 19:42:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:42:56,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143070119] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:42:56,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:42:56,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 34 [2022-12-12 19:42:56,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145306136] [2022-12-12 19:42:56,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:42:56,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-12 19:42:56,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:42:56,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-12 19:42:56,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2022-12-12 19:42:56,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:42:56,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 2425 transitions, 112243 flow. Second operand has 35 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 35 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:42:56,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:42:56,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:42:56,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:43:15,312 INFO L130 PetriNetUnfolder]: 3049/5085 cut-off events. [2022-12-12 19:43:15,312 INFO L131 PetriNetUnfolder]: For 339/339 co-relation queries the response was YES. [2022-12-12 19:43:15,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122420 conditions, 5085 events. 3049/5085 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 32160 event pairs, 0 based on Foata normal form. 4/4042 useless extension candidates. Maximal degree in co-relation 58166. Up to 4953 conditions per place. [2022-12-12 19:43:15,356 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 1358 selfloop transitions, 1535 changer transitions 32/2925 dead transitions. [2022-12-12 19:43:15,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 2925 transitions, 141171 flow [2022-12-12 19:43:15,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-12 19:43:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-12 19:43:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 241 transitions. [2022-12-12 19:43:15,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3204787234042553 [2022-12-12 19:43:15,358 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 383 predicate places. [2022-12-12 19:43:15,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 403 places, 2925 transitions, 141171 flow [2022-12-12 19:43:15,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 403 places, 2893 transitions, 139611 flow [2022-12-12 19:43:15,440 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 2893 transitions, 139611 flow [2022-12-12 19:43:15,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 35 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:43:15,440 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:43:15,441 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:43:15,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-12 19:43:15,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:43:15,645 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:43:15,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:43:15,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1899628970, now seen corresponding path program 18 times [2022-12-12 19:43:15,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:43:15,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878684381] [2022-12-12 19:43:15,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:43:15,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:43:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:43:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:43:18,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:43:18,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878684381] [2022-12-12 19:43:18,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878684381] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:43:18,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148713850] [2022-12-12 19:43:18,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 19:43:18,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:43:18,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:43:18,811 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:43:18,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-12 19:43:18,960 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-12 19:43:18,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:43:18,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-12 19:43:18,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:43:19,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:43:19,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 206 [2022-12-12 19:43:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:43:19,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:43:21,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:43:21,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 594 treesize of output 250 [2022-12-12 19:43:27,091 INFO L321 Elim1Store]: treesize reduction 32, result has 39.6 percent of original size [2022-12-12 19:43:27,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1179 treesize of output 415 [2022-12-12 19:43:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:43:28,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148713850] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:43:28,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:43:28,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 30 [2022-12-12 19:43:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234414828] [2022-12-12 19:43:28,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:43:28,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-12 19:43:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:43:28,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-12 19:43:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2022-12-12 19:43:28,963 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:43:28,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 2893 transitions, 139611 flow. Second operand has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:43:28,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:43:28,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:43:28,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:43:40,122 INFO L130 PetriNetUnfolder]: 3414/5644 cut-off events. [2022-12-12 19:43:40,122 INFO L131 PetriNetUnfolder]: For 380/380 co-relation queries the response was YES. [2022-12-12 19:43:40,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141507 conditions, 5644 events. 3414/5644 cut-off events. For 380/380 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 35871 event pairs, 0 based on Foata normal form. 4/4441 useless extension candidates. Maximal degree in co-relation 68286. Up to 5512 conditions per place. [2022-12-12 19:43:40,174 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 2303 selfloop transitions, 899 changer transitions 29/3231 dead transitions. [2022-12-12 19:43:40,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 3231 transitions, 162399 flow [2022-12-12 19:43:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-12 19:43:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-12-12 19:43:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 287 transitions. [2022-12-12 19:43:40,176 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31469298245614036 [2022-12-12 19:43:40,177 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 439 predicate places. [2022-12-12 19:43:40,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 459 places, 3231 transitions, 162399 flow [2022-12-12 19:43:40,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 457 places, 3202 transitions, 160925 flow [2022-12-12 19:43:40,270 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 3202 transitions, 160925 flow [2022-12-12 19:43:40,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:43:40,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:43:40,270 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:43:40,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-12 19:43:40,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-12 19:43:40,472 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:43:40,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:43:40,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1867225760, now seen corresponding path program 19 times [2022-12-12 19:43:40,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:43:40,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573213230] [2022-12-12 19:43:40,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:43:40,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:43:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:43:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:43:53,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:43:53,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573213230] [2022-12-12 19:43:53,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573213230] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:43:53,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422720160] [2022-12-12 19:43:53,620 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 19:43:53,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:43:53,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:43:53,622 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:43:53,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-12 19:43:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:43:53,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-12 19:43:53,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:43:54,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:43:54,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 168 [2022-12-12 19:43:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:43:54,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:43:58,268 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-12 19:43:58,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2563 treesize of output 989 [2022-12-12 19:44:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:44:03,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422720160] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:44:03,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:44:03,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 34 [2022-12-12 19:44:03,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756126852] [2022-12-12 19:44:03,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:44:03,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-12 19:44:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:44:03,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-12 19:44:03,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2022-12-12 19:44:03,595 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:44:03,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 3202 transitions, 160925 flow. Second operand has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:44:03,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:44:03,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:44:03,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:44:52,622 INFO L130 PetriNetUnfolder]: 3962/6623 cut-off events. [2022-12-12 19:44:52,622 INFO L131 PetriNetUnfolder]: For 483/483 co-relation queries the response was YES. [2022-12-12 19:44:52,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172668 conditions, 6623 events. 3962/6623 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 44228 event pairs, 0 based on Foata normal form. 6/5216 useless extension candidates. Maximal degree in co-relation 80764. Up to 6485 conditions per place. [2022-12-12 19:44:52,680 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 2236 selfloop transitions, 1498 changer transitions 79/3813 dead transitions. [2022-12-12 19:44:52,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 3813 transitions, 199302 flow [2022-12-12 19:44:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-12-12 19:44:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2022-12-12 19:44:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 411 transitions. [2022-12-12 19:44:52,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28541666666666665 [2022-12-12 19:44:52,682 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 526 predicate places. [2022-12-12 19:44:52,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 546 places, 3813 transitions, 199302 flow [2022-12-12 19:44:52,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 543 places, 3734 transitions, 195128 flow [2022-12-12 19:44:52,787 INFO L495 AbstractCegarLoop]: Abstraction has has 543 places, 3734 transitions, 195128 flow [2022-12-12 19:44:52,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:44:52,787 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:44:52,787 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:44:52,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-12 19:44:52,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-12 19:44:52,992 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:44:52,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:44:52,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1465869024, now seen corresponding path program 20 times [2022-12-12 19:44:52,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:44:52,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521593723] [2022-12-12 19:44:52,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:44:52,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:44:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:44:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:44:57,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:44:57,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521593723] [2022-12-12 19:44:57,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521593723] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:44:57,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514523734] [2022-12-12 19:44:57,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 19:44:57,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:44:57,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:44:57,773 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:44:57,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-12 19:44:57,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 19:44:57,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:44:57,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-12 19:44:57,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:44:58,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:44:58,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 179 [2022-12-12 19:44:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:44:58,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:45:01,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:45:01,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 695 treesize of output 283 [2022-12-12 19:45:03,350 INFO L321 Elim1Store]: treesize reduction 32, result has 39.6 percent of original size [2022-12-12 19:45:03,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1181 treesize of output 407 [2022-12-12 19:45:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:45:04,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514523734] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:45:04,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:45:04,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 33 [2022-12-12 19:45:04,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723722529] [2022-12-12 19:45:04,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:45:04,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-12 19:45:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:45:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-12 19:45:04,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2022-12-12 19:45:04,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:45:04,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 3734 transitions, 195128 flow. Second operand has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:45:04,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:45:04,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:45:04,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:45:19,546 INFO L130 PetriNetUnfolder]: 4004/6709 cut-off events. [2022-12-12 19:45:19,547 INFO L131 PetriNetUnfolder]: For 449/449 co-relation queries the response was YES. [2022-12-12 19:45:19,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181608 conditions, 6709 events. 4004/6709 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 44988 event pairs, 0 based on Foata normal form. 6/5311 useless extension candidates. Maximal degree in co-relation 87705. Up to 6571 conditions per place. [2022-12-12 19:45:19,609 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 2990 selfloop transitions, 860 changer transitions 33/3883 dead transitions. [2022-12-12 19:45:19,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 3883 transitions, 210684 flow [2022-12-12 19:45:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-12 19:45:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-12-12 19:45:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 262 transitions. [2022-12-12 19:45:19,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2823275862068966 [2022-12-12 19:45:19,611 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 580 predicate places. [2022-12-12 19:45:19,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 600 places, 3883 transitions, 210684 flow [2022-12-12 19:45:19,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 600 places, 3850 transitions, 208866 flow [2022-12-12 19:45:19,731 INFO L495 AbstractCegarLoop]: Abstraction has has 600 places, 3850 transitions, 208866 flow [2022-12-12 19:45:19,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:45:19,731 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:45:19,731 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:45:19,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-12 19:45:19,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-12 19:45:19,936 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:45:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:45:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash 299619818, now seen corresponding path program 21 times [2022-12-12 19:45:19,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:45:19,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147747] [2022-12-12 19:45:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:45:19,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:45:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:45:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:45:23,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:45:23,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147747] [2022-12-12 19:45:23,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147747] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:45:23,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439541977] [2022-12-12 19:45:23,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 19:45:23,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:45:23,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:45:23,048 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:45:23,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-12 19:45:23,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-12 19:45:23,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:45:23,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-12 19:45:23,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:45:23,307 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-12-12 19:45:23,349 INFO L350 Elim1Store]: Elim1 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-12-12 19:45:23,403 INFO L350 Elim1Store]: Elim1 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-12-12 19:45:23,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:45:23,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 195 [2022-12-12 19:45:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:45:24,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:45:29,445 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse94 (* c_~j~0 4)) (.cse95 (* c_~i~0 4))) (let ((.cse20 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse21 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse11 (not (< (+ c_~j~0 1) c_~N~0))) (.cse13 (< (+ 2 c_~j~0) c_~N~0)) (.cse4 (+ c_~A~0.offset .cse95 4)) (.cse5 (+ c_~A~0.offset .cse95)) (.cse7 (+ c_~A~0.offset .cse94 4)) (.cse6 (+ c_~A~0.offset .cse94)) (.cse12 (< (+ 2 c_~i~0) c_~N~0)) (.cse0 (not (< (+ c_~i~0 1) c_~N~0)))) (and (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse0 (and (or (and (or (and (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse7)) (.cse1 (select .cse3 .cse6))) (or (not (<= 0 (+ .cse1 .cse2 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse1 c_~sum2~0 2147483648))) (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse3 .cse4) (select .cse3 .cse5)) (+ c_~bag2~0 .cse1 .cse2 c_~sum2~0)) (not (<= (+ .cse1 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse1 2147483648))) (not (<= (+ c_~bag2~0 .cse1 c_~sum2~0) 2147483647)))))) (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse7)) (.cse8 (select .cse10 .cse6))) (or (not (<= 0 (+ .cse8 .cse9 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse8 c_~sum2~0 2147483648))) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (not (<= (+ .cse8 .cse9) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse8 2147483648))) (< (+ c_~bag2~0 .cse8 .cse9 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse10 .cse4) (select .cse10 .cse5) 1)) (not (<= (+ c_~bag2~0 .cse8 c_~sum2~0) 2147483647))))))) .cse11 .cse12 .cse13) (or (and (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse6)) (.cse15 (select .cse16 .cse7))) (or (not (<= 0 (+ .cse14 .cse15 2147483648))) (< c_~bag2~0 (+ .cse15 1)) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (< (+ c_~bag2~0 .cse14 .cse15 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse16 .cse4) (select .cse16 .cse5) 1)))))) (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse6)) (.cse18 (select .cse19 .cse7))) (or (not (<= 0 (+ .cse17 .cse18 2147483648))) (< c_~bag2~0 (+ .cse18 1)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse19 .cse4) (select .cse19 .cse5)) (+ c_~bag2~0 .cse17 .cse18 c_~sum2~0))))))) .cse11 .cse12 .cse13)) .cse20 .cse21) (or .cse11 .cse13 (and (or (and (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse23 (select .cse26 .cse4)) (.cse24 (select .cse26 .cse5)) (.cse22 (select .cse26 .cse6)) (.cse25 (select .cse26 .cse7))) (or (not (<= (+ c_~bag2~0 .cse22) 2147483647)) (not (<= (+ .cse23 .cse24) 2147483647)) (not (<= 0 (+ .cse23 .cse24 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse22 .cse25 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse23 .cse24) (+ c_~bag2~0 .cse22 .cse25 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse22 2147483648))) (not (<= (+ c_~bag2~0 .cse22 .cse25) 2147483647)))))) (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse27 (select .cse31 .cse6)) (.cse30 (select .cse31 .cse7)) (.cse28 (select .cse31 .cse4)) (.cse29 (select .cse31 .cse5))) (or (not (<= (+ c_~bag2~0 .cse27) 2147483647)) (not (<= (+ .cse28 .cse29) 2147483647)) (not (<= 0 (+ .cse28 .cse29 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse27 .cse30 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse27 2147483648))) (not (<= (+ c_~bag2~0 .cse27 .cse30) 2147483647)) (< (+ c_~bag2~0 .cse27 .cse30 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse28 .cse29 1))))))) .cse12) (or (and (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse32 (select .cse35 .cse5)) (.cse33 (select .cse35 .cse6)) (.cse34 (select .cse35 .cse7))) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse32 2147483648))) (not (<= (+ c_~bag2~0 .cse33) 2147483647)) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse32) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse33 .cse34 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse35 .cse4) .cse32) (+ c_~bag2~0 .cse33 .cse34 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse33 2147483648))) (not (<= (+ c_~bag2~0 .cse33 .cse34) 2147483647)))))) (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse37 (select .cse39 .cse6)) (.cse38 (select .cse39 .cse7)) (.cse36 (select .cse39 .cse5))) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse36 2147483648))) (not (<= (+ c_~bag2~0 .cse37) 2147483647)) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse36) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse37 .cse38 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse37 2147483648))) (not (<= (+ c_~bag2~0 .cse37 .cse38) 2147483647)) (< (+ c_~bag2~0 .cse37 .cse38 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse39 .cse4) .cse36 1))))))) .cse12)))) (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (or (and (or (and (or .cse12 (and (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse40 (select .cse44 .cse6)) (.cse43 (select .cse44 .cse7)) (.cse41 (select .cse44 .cse4)) (.cse42 (select .cse44 .cse5))) (or (not (<= (+ c_~bag2~0 .cse40) 2147483647)) (not (<= (+ c_~bag1~0 .cse41 .cse42) 2147483647)) (not (<= (+ c_~bag1~0 .cse42) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse41 .cse42 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse40 .cse43 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse42 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse40 2147483648))) (not (<= (+ c_~bag2~0 .cse40 .cse43) 2147483647)) (< (+ c_~bag2~0 .cse40 .cse43 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse41 .cse42 1)))))) (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse46 (select .cse49 .cse4)) (.cse47 (select .cse49 .cse5)) (.cse45 (select .cse49 .cse6)) (.cse48 (select .cse49 .cse7))) (or (not (<= (+ c_~bag2~0 .cse45) 2147483647)) (not (<= (+ c_~bag1~0 .cse46 .cse47) 2147483647)) (not (<= (+ c_~bag1~0 .cse47) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse46 .cse47 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse45 .cse48 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse46 .cse47) (+ c_~bag2~0 .cse45 .cse48 c_~sum2~0)) (not (<= 0 (+ c_~bag1~0 .cse47 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse45 2147483648))) (not (<= (+ c_~bag2~0 .cse45 .cse48) 2147483647)))))))) (or (and (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse50 (select .cse53 .cse5)) (.cse51 (select .cse53 .cse6)) (.cse52 (select .cse53 .cse7))) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse50 2147483648))) (not (<= (+ c_~bag2~0 .cse51) 2147483647)) (not (<= (+ c_~bag1~0 .cse50) 2147483647)) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse50) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse51 .cse52 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse53 .cse4) .cse50) (+ c_~bag2~0 .cse51 .cse52 c_~sum2~0)) (not (<= 0 (+ c_~bag1~0 .cse50 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse51 2147483648))) (not (<= (+ c_~bag2~0 .cse51 .cse52) 2147483647)))))) (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse57 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse55 (select .cse57 .cse6)) (.cse56 (select .cse57 .cse7)) (.cse54 (select .cse57 .cse5))) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse54 2147483648))) (not (<= (+ c_~bag2~0 .cse55) 2147483647)) (not (<= (+ c_~bag1~0 .cse54) 2147483647)) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse54) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse55 .cse56 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse54 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse55 2147483648))) (not (<= (+ c_~bag2~0 .cse55 .cse56) 2147483647)) (< (+ c_~bag2~0 .cse55 .cse56 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse57 .cse4) .cse54 1))))))) .cse12)) .cse11 .cse13) (or .cse20 .cse21 (and (or (and (or (and (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse59 (select .cse61 .cse7)) (.cse60 (select .cse61 .cse5)) (.cse58 (select .cse61 .cse6))) (or (not (<= 0 (+ .cse58 .cse59 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse58 c_~sum2~0 2147483648))) (not (<= (+ c_~bag2~0 .cse58) 2147483647)) (not (<= (+ c_~bag1~0 .cse60) 2147483647)) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse60) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse61 .cse4) .cse60) (+ c_~bag2~0 .cse58 .cse59 c_~sum2~0)) (not (<= (+ .cse58 .cse59) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse60 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse58 2147483648))))))) (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse65 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse63 (select .cse65 .cse7)) (.cse64 (select .cse65 .cse5)) (.cse62 (select .cse65 .cse6))) (or (not (<= 0 (+ .cse62 .cse63 2147483648))) (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse64 2147483648))) (not (<= (+ c_~bag2~0 .cse62) 2147483647)) (not (<= (+ c_~bag1~0 .cse64) 2147483647)) (not (<= (+ .cse62 .cse63) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse64 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse62 2147483648))) (< (+ c_~bag2~0 .cse62 .cse63 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse65 .cse4) .cse64 1)) (not (<= (+ c_~bag2~0 .cse62 c_~sum2~0) 2147483647))))))) .cse12) (or .cse12 (and (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse70 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse68 (select .cse70 .cse4)) (.cse67 (select .cse70 .cse7)) (.cse69 (select .cse70 .cse5)) (.cse66 (select .cse70 .cse6))) (or (not (<= 0 (+ .cse66 .cse67 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse66 c_~sum2~0 2147483648))) (not (<= (+ c_~bag2~0 .cse66) 2147483647)) (not (<= (+ c_~bag1~0 .cse68 .cse69) 2147483647)) (not (<= (+ c_~bag1~0 .cse69) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse68 .cse69 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse68 .cse69) (+ c_~bag2~0 .cse66 .cse67 c_~sum2~0)) (not (<= (+ .cse66 .cse67) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse69 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse66 2147483648))) (not (<= (+ c_~bag2~0 .cse66 c_~sum2~0) 2147483647)))))) (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse72 (select .cse75 .cse7)) (.cse73 (select .cse75 .cse4)) (.cse74 (select .cse75 .cse5)) (.cse71 (select .cse75 .cse6))) (or (not (<= 0 (+ .cse71 .cse72 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse71 c_~sum2~0 2147483648))) (not (<= (+ c_~bag2~0 .cse71) 2147483647)) (not (<= (+ c_~bag1~0 .cse73 .cse74) 2147483647)) (not (<= (+ c_~bag1~0 .cse74) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse73 .cse74 2147483648))) (not (<= (+ .cse71 .cse72) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse74 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse71 2147483648))) (< (+ c_~bag2~0 .cse71 .cse72 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse73 .cse74 1)) (not (<= (+ c_~bag2~0 .cse71 c_~sum2~0) 2147483647))))))))) .cse11 .cse13) (or .cse11 .cse13 (and (or (and (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse80 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse76 (select .cse80 .cse6)) (.cse77 (select .cse80 .cse7)) (.cse78 (select .cse80 .cse4)) (.cse79 (select .cse80 .cse5))) (or (not (<= 0 (+ .cse76 .cse77 2147483648))) (< c_~bag2~0 (+ .cse77 1)) (not (<= (+ c_~bag2~0 .cse76) 2147483647)) (not (<= (+ c_~bag1~0 .cse78 .cse79) 2147483647)) (not (<= (+ c_~bag1~0 .cse79) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse78 .cse79 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse79 2147483648))) (< (+ c_~bag2~0 .cse76 .cse77 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse78 .cse79 1)))))) (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse85 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse83 (select .cse85 .cse4)) (.cse81 (select .cse85 .cse6)) (.cse82 (select .cse85 .cse7)) (.cse84 (select .cse85 .cse5))) (or (not (<= 0 (+ .cse81 .cse82 2147483648))) (< c_~bag2~0 (+ .cse82 1)) (not (<= (+ c_~bag2~0 .cse81) 2147483647)) (not (<= (+ c_~bag1~0 .cse83 .cse84) 2147483647)) (not (<= (+ c_~bag1~0 .cse84) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse83 .cse84 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse83 .cse84) (+ c_~bag2~0 .cse81 .cse82 c_~sum2~0)) (not (<= 0 (+ c_~bag1~0 .cse84 2147483648)))))))) .cse12) (or (and (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse89 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse86 (select .cse89 .cse6)) (.cse87 (select .cse89 .cse7)) (.cse88 (select .cse89 .cse5))) (or (not (<= 0 (+ .cse86 .cse87 2147483648))) (< c_~bag2~0 (+ .cse87 1)) (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse88 2147483648))) (not (<= (+ c_~bag2~0 .cse86) 2147483647)) (not (<= (+ c_~bag1~0 .cse88) 2147483647)) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse88) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse89 .cse4) .cse88) (+ c_~bag2~0 .cse86 .cse87 c_~sum2~0)) (not (<= 0 (+ c_~bag1~0 .cse88 2147483648))))))) (forall ((v_ArrVal_822 (Array Int Int))) (let ((.cse93 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_822) c_~A~0.base))) (let ((.cse90 (select .cse93 .cse6)) (.cse91 (select .cse93 .cse7)) (.cse92 (select .cse93 .cse5))) (or (not (<= 0 (+ .cse90 .cse91 2147483648))) (< c_~bag2~0 (+ .cse91 1)) (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse92 2147483648))) (not (<= (+ c_~bag2~0 .cse90) 2147483647)) (not (<= (+ c_~bag1~0 .cse92) 2147483647)) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse92) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse92 2147483648))) (< (+ c_~bag2~0 .cse90 .cse91 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse93 .cse4) .cse92 1))))))) .cse12)))))) .cse0)))) is different from false [2022-12-12 19:45:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:45:30,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439541977] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:45:30,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:45:30,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 32 [2022-12-12 19:45:30,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573999919] [2022-12-12 19:45:30,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:45:30,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-12 19:45:30,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:45:30,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-12 19:45:30,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=814, Unknown=1, NotChecked=60, Total=1056 [2022-12-12 19:45:30,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:45:30,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 3850 transitions, 208866 flow. Second operand has 33 states, 32 states have (on average 1.78125) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:45:30,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:45:30,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:45:30,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:45:58,662 INFO L130 PetriNetUnfolder]: 4626/7658 cut-off events. [2022-12-12 19:45:58,662 INFO L131 PetriNetUnfolder]: For 496/496 co-relation queries the response was YES. [2022-12-12 19:45:58,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214928 conditions, 7658 events. 4626/7658 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 51626 event pairs, 0 based on Foata normal form. 7/5971 useless extension candidates. Maximal degree in co-relation 100782. Up to 7520 conditions per place. [2022-12-12 19:45:58,739 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 2262 selfloop transitions, 2085 changer transitions 78/4425 dead transitions. [2022-12-12 19:45:58,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 4425 transitions, 248904 flow [2022-12-12 19:45:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-12-12 19:45:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2022-12-12 19:45:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 434 transitions. [2022-12-12 19:45:58,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31540697674418605 [2022-12-12 19:45:58,741 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 665 predicate places. [2022-12-12 19:45:58,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 685 places, 4425 transitions, 248904 flow [2022-12-12 19:45:58,881 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 684 places, 4347 transitions, 244473 flow [2022-12-12 19:45:58,882 INFO L495 AbstractCegarLoop]: Abstraction has has 684 places, 4347 transitions, 244473 flow [2022-12-12 19:45:58,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.78125) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:45:58,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:45:58,882 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:45:58,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-12 19:45:59,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:45:59,088 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:45:59,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:45:59,088 INFO L85 PathProgramCache]: Analyzing trace with hash 606399848, now seen corresponding path program 22 times [2022-12-12 19:45:59,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:45:59,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452081867] [2022-12-12 19:45:59,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:45:59,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:45:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:46:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:46:48,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:46:48,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452081867] [2022-12-12 19:46:48,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452081867] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:46:48,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010683818] [2022-12-12 19:46:48,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 19:46:48,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:46:48,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:46:48,495 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:46:48,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-12 19:46:48,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 19:46:48,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:46:48,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-12 19:46:48,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:46:49,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:46:49,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 320 treesize of output 216 [2022-12-12 19:46:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:46:49,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:46:53,444 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 19:46:53,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 740 treesize of output 284 [2022-12-12 19:46:53,503 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-12-12 19:46:53,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1096 treesize of output 1 [2022-12-12 19:46:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:46:53,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010683818] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:46:53,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:46:53,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 31 [2022-12-12 19:46:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951353868] [2022-12-12 19:46:53,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:46:53,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-12 19:46:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:46:53,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-12 19:46:53,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2022-12-12 19:46:53,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:46:53,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 4347 transitions, 244473 flow. Second operand has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:46:53,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:46:53,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:46:53,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:47:28,762 INFO L130 PetriNetUnfolder]: 4825/7936 cut-off events. [2022-12-12 19:47:28,763 INFO L131 PetriNetUnfolder]: For 470/470 co-relation queries the response was YES. [2022-12-12 19:47:28,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230644 conditions, 7936 events. 4825/7936 cut-off events. For 470/470 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 53089 event pairs, 0 based on Foata normal form. 6/6219 useless extension candidates. Maximal degree in co-relation 115352. Up to 7795 conditions per place. [2022-12-12 19:47:28,847 INFO L137 encePairwiseOnDemand]: 5/16 looper letters, 2296 selfloop transitions, 2271 changer transitions 25/4592 dead transitions. [2022-12-12 19:47:28,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 754 places, 4592 transitions, 267407 flow [2022-12-12 19:47:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-12 19:47:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-12-12 19:47:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 318 transitions. [2022-12-12 19:47:28,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27992957746478875 [2022-12-12 19:47:28,849 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 734 predicate places. [2022-12-12 19:47:28,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 754 places, 4592 transitions, 267407 flow [2022-12-12 19:47:29,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 750 places, 4567 transitions, 265933 flow [2022-12-12 19:47:29,015 INFO L495 AbstractCegarLoop]: Abstraction has has 750 places, 4567 transitions, 265933 flow [2022-12-12 19:47:29,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:47:29,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:47:29,015 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:47:29,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-12 19:47:29,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-12 19:47:29,221 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:47:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:47:29,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1877728864, now seen corresponding path program 23 times [2022-12-12 19:47:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:47:29,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186772750] [2022-12-12 19:47:29,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:47:29,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:47:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:47:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:47:35,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:47:35,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186772750] [2022-12-12 19:47:35,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186772750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:47:35,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563656490] [2022-12-12 19:47:35,511 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 19:47:35,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:47:35,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:47:35,513 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:47:35,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-12 19:47:35,631 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-12 19:47:35,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:47:35,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-12 19:47:35,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:47:35,690 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-12-12 19:47:35,733 INFO L350 Elim1Store]: Elim1 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-12-12 19:47:35,781 INFO L350 Elim1Store]: Elim1 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-12-12 19:47:36,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:47:36,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 168 [2022-12-12 19:47:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:47:36,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:47:41,993 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse94 (* c_~j~0 4)) (.cse95 (* c_~i~0 4))) (let ((.cse0 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse1 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse16 (< c_~i~0 c_~j~0)) (.cse7 (+ c_~A~0.offset .cse95 4)) (.cse8 (+ c_~A~0.offset .cse95)) (.cse10 (+ c_~A~0.offset .cse94)) (.cse9 (+ c_~A~0.offset .cse94 4)) (.cse17 (< c_~j~0 c_~i~0))) (and (or .cse0 .cse1 (and (or (and (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse2 (select .cse6 .cse10)) (.cse3 (select .cse6 .cse9)) (.cse4 (select .cse6 .cse8)) (.cse5 (select .cse6 .cse7))) (or (< (+ c_~bag2~0 .cse2 .cse3 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse4 .cse5 1)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse4 2147483648))) (not (<= (+ c_~bag1~0 .cse4) 2147483647)) (not (<= 0 (+ .cse2 .cse3 2147483648))) (not (<= (+ c_~bag2~0 .cse2 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse4 .cse5 2147483648))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 c_~sum2~0 2147483648))) (not (<= (+ .cse2 .cse3) 2147483647)) (not (<= (+ c_~bag1~0 .cse4 .cse5) 2147483647)))))) (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse11 (select .cse15 .cse10)) (.cse13 (select .cse15 .cse9)) (.cse12 (select .cse15 .cse8)) (.cse14 (select .cse15 .cse7))) (or (not (<= 0 (+ c_~bag2~0 .cse11 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse12 2147483648))) (not (<= (+ c_~bag1~0 .cse12) 2147483647)) (not (<= 0 (+ .cse11 .cse13 2147483648))) (not (<= (+ c_~bag2~0 .cse11 c_~sum2~0) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse12 .cse14) (+ c_~bag2~0 .cse11 .cse13 c_~sum2~0)) (not (<= 0 (+ c_~bag1~0 .cse12 .cse14 2147483648))) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse11 c_~sum2~0 2147483648))) (not (<= (+ .cse11 .cse13) 2147483647)) (not (<= (+ c_~bag1~0 .cse12 .cse14) 2147483647))))))) .cse16 .cse17) (or .cse16 .cse17 (and (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse19 (select .cse22 .cse9)) (.cse18 (select .cse22 .cse10)) (.cse20 (select .cse22 .cse8)) (.cse21 (select .cse22 .cse7))) (or (< (+ c_~bag2~0 .cse18 .cse19 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse20 .cse21 1)) (< c_~bag2~0 (+ .cse19 1)) (not (<= 0 (+ c_~bag1~0 .cse20 2147483648))) (not (<= (+ c_~bag1~0 .cse20) 2147483647)) (not (<= 0 (+ .cse18 .cse19 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse20 .cse21 2147483648))) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (not (<= (+ c_~bag1~0 .cse20 .cse21) 2147483647)))))) (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse23 (select .cse27 .cse9)) (.cse25 (select .cse27 .cse10)) (.cse24 (select .cse27 .cse8)) (.cse26 (select .cse27 .cse7))) (or (< c_~bag2~0 (+ .cse23 1)) (not (<= 0 (+ c_~bag1~0 .cse24 2147483648))) (not (<= (+ c_~bag1~0 .cse24) 2147483647)) (not (<= 0 (+ .cse25 .cse23 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse24 .cse26) (+ c_~bag2~0 .cse25 .cse23 c_~sum2~0)) (not (<= 0 (+ c_~bag1~0 .cse24 .cse26 2147483648))) (not (<= (+ c_~bag2~0 .cse25) 2147483647)) (not (<= (+ c_~bag1~0 .cse24 .cse26) 2147483647)))))))))) (or .cse16 (and (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse29 (select .cse32 .cse9)) (.cse28 (select .cse32 .cse10)) (.cse30 (select .cse32 .cse8)) (.cse31 (select .cse32 .cse7))) (or (< (+ c_~bag2~0 .cse28 .cse29 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse30 .cse31 1)) (not (<= (+ c_~bag2~0 .cse28 .cse29) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse28 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse30 2147483648))) (not (<= (+ c_~bag1~0 .cse30) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse28 .cse29 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse30 .cse31 2147483648))) (not (<= (+ c_~bag2~0 .cse28) 2147483647)) (not (<= (+ c_~bag1~0 .cse30 .cse31) 2147483647)))))) (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse34 (select .cse37 .cse9)) (.cse33 (select .cse37 .cse10)) (.cse35 (select .cse37 .cse8)) (.cse36 (select .cse37 .cse7))) (or (not (<= (+ c_~bag2~0 .cse33 .cse34) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse33 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse35 2147483648))) (not (<= (+ c_~bag1~0 .cse35) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse33 .cse34 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse35 .cse36) (+ c_~bag2~0 .cse33 .cse34 c_~sum2~0)) (not (<= 0 (+ c_~bag1~0 .cse35 .cse36 2147483648))) (not (<= (+ c_~bag2~0 .cse33) 2147483647)) (not (<= (+ c_~bag1~0 .cse35 .cse36) 2147483647))))))) .cse17) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) (and (or (and (or (and (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse39 (select .cse41 .cse9)) (.cse38 (select .cse41 .cse10)) (.cse40 (select .cse41 .cse8))) (or (< (+ c_~bag2~0 .cse38 .cse39 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse40 (select .cse41 .cse7) 1)) (< c_~bag2~0 (+ .cse39 1)) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse40) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse40 2147483648))) (not (<= (+ c_~bag1~0 .cse40) 2147483647)) (not (<= 0 (+ .cse38 .cse39 2147483648))) (not (<= (+ c_~bag2~0 .cse38) 2147483647)) (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse40 2147483648))))))) (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse42 (select .cse45 .cse9)) (.cse44 (select .cse45 .cse10)) (.cse43 (select .cse45 .cse8))) (or (< c_~bag2~0 (+ .cse42 1)) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse43) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse43 2147483648))) (not (<= (+ c_~bag1~0 .cse43) 2147483647)) (not (<= 0 (+ .cse44 .cse42 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse43 (select .cse45 .cse7)) (+ c_~bag2~0 .cse44 .cse42 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse44) 2147483647)) (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse43 2147483648)))))))) .cse16 .cse17) (or (and (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse50 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse49 (select .cse50 .cse7)) (.cse48 (select .cse50 .cse8)) (.cse47 (select .cse50 .cse9)) (.cse46 (select .cse50 .cse10))) (or (< (+ c_~bag2~0 .cse46 .cse47 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse48 .cse49 1)) (not (<= 0 (+ c_~bag2~0 .cse46 2147483648))) (< c_~bag1~0 (+ .cse49 1)) (not (<= (+ c_~bag1~0 .cse48) 2147483647)) (not (<= 0 (+ .cse46 .cse47 2147483648))) (not (<= (+ c_~bag2~0 .cse46 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse46) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse46 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse53 (select .cse55 .cse8)) (.cse52 (select .cse55 .cse7)) (.cse54 (select .cse55 .cse9)) (.cse51 (select .cse55 .cse10))) (or (not (<= 0 (+ c_~bag2~0 .cse51 2147483648))) (< c_~bag1~0 (+ .cse52 1)) (not (<= (+ c_~bag1~0 .cse53) 2147483647)) (not (<= 0 (+ .cse51 .cse54 2147483648))) (not (<= (+ c_~bag2~0 .cse51 c_~sum2~0) 2147483647)) (<= (+ c_~bag1~0 c_~sum1~0 .cse53 .cse52) (+ c_~bag2~0 .cse51 .cse54 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse51) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse51 c_~sum2~0 2147483648)))))))) .cse16 .cse17) (or .cse16 (and (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse60 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse59 (select .cse60 .cse7)) (.cse58 (select .cse60 .cse8)) (.cse57 (select .cse60 .cse9)) (.cse56 (select .cse60 .cse10))) (or (< (+ c_~bag2~0 .cse56 .cse57 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse58 .cse59 1)) (< c_~bag2~0 (+ .cse57 1)) (< c_~bag1~0 (+ .cse59 1)) (not (<= (+ c_~bag1~0 .cse58) 2147483647)) (not (<= 0 (+ .cse56 .cse57 2147483648))) (not (<= (+ c_~bag2~0 .cse56) 2147483647)))))) (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse65 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse63 (select .cse65 .cse8)) (.cse62 (select .cse65 .cse7)) (.cse61 (select .cse65 .cse9)) (.cse64 (select .cse65 .cse10))) (or (< c_~bag2~0 (+ .cse61 1)) (< c_~bag1~0 (+ .cse62 1)) (not (<= (+ c_~bag1~0 .cse63) 2147483647)) (not (<= 0 (+ .cse64 .cse61 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse63 .cse62) (+ c_~bag2~0 .cse64 .cse61 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse64) 2147483647))))))) .cse17) (or .cse16 (and (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse69 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse68 (select .cse69 .cse8)) (.cse66 (select .cse69 .cse10)) (.cse67 (select .cse69 .cse9))) (or (< (+ c_~bag2~0 .cse66 .cse67 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse68 (select .cse69 .cse7) 1)) (not (<= 0 (+ c_~bag2~0 .cse66 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse68 2147483648))) (not (<= (+ c_~bag1~0 .cse68) 2147483647)) (not (<= 0 (+ .cse66 .cse67 2147483648))) (not (<= (+ c_~bag2~0 .cse66 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse66) 2147483647)) (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse68 2147483648))) (not (<= (+ .cse66 .cse67) 2147483647)))))) (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse73 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse71 (select .cse73 .cse8)) (.cse70 (select .cse73 .cse10)) (.cse72 (select .cse73 .cse9))) (or (not (<= 0 (+ c_~bag2~0 .cse70 2147483648))) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse71) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse71 2147483648))) (not (<= (+ c_~bag1~0 .cse71) 2147483647)) (not (<= 0 (+ .cse70 .cse72 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse71 (select .cse73 .cse7)) (+ c_~bag2~0 .cse70 .cse72 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse70) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse70 c_~sum2~0 2147483648))) (not (<= (+ .cse70 .cse72) 2147483647))))))) .cse17)) .cse0 .cse1) (or .cse16 .cse17 (and (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse78 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse75 (select .cse78 .cse9)) (.cse74 (select .cse78 .cse10)) (.cse76 (select .cse78 .cse8)) (.cse77 (select .cse78 .cse7))) (or (< (+ c_~bag2~0 .cse74 .cse75 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse76 .cse77 1)) (not (<= (+ c_~bag2~0 .cse74 .cse75) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse74 2147483648))) (< c_~bag1~0 (+ .cse77 1)) (not (<= (+ c_~bag1~0 .cse76) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse74 .cse75 2147483648))) (not (<= (+ c_~bag2~0 .cse74) 2147483647)) (not (<= 0 (+ .cse76 .cse77 2147483648))))))) (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse83 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse80 (select .cse83 .cse9)) (.cse79 (select .cse83 .cse10)) (.cse82 (select .cse83 .cse8)) (.cse81 (select .cse83 .cse7))) (or (not (<= (+ c_~bag2~0 .cse79 .cse80) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse79 2147483648))) (< c_~bag1~0 (+ .cse81 1)) (not (<= (+ c_~bag1~0 .cse82) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse79 .cse80 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse82 .cse81) (+ c_~bag2~0 .cse79 .cse80 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse79) 2147483647)) (not (<= 0 (+ .cse82 .cse81 2147483648))))))))) (or .cse16 (and (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse88 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse87 (select .cse88 .cse9)) (.cse86 (select .cse88 .cse10)) (.cse84 (select .cse88 .cse8)) (.cse85 (select .cse88 .cse7))) (or (not (<= (+ .cse84 .cse85) 2147483647)) (not (<= (+ c_~bag2~0 .cse86 .cse87) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse86 2147483648))) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse84) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse84 2147483648))) (not (<= (+ c_~bag1~0 .cse84) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse86 .cse87 2147483648))) (<= (+ c_~bag1~0 c_~sum1~0 .cse84 .cse85) (+ c_~bag2~0 .cse86 .cse87 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse86) 2147483647)) (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse84 2147483648))) (not (<= 0 (+ .cse84 .cse85 2147483648))))))) (forall ((v_ArrVal_894 (Array Int Int))) (let ((.cse93 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_894) c_~A~0.base))) (let ((.cse90 (select .cse93 .cse9)) (.cse89 (select .cse93 .cse10)) (.cse91 (select .cse93 .cse8)) (.cse92 (select .cse93 .cse7))) (or (< (+ c_~bag2~0 .cse89 .cse90 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse91 .cse92 1)) (not (<= (+ .cse91 .cse92) 2147483647)) (not (<= (+ c_~bag2~0 .cse89 .cse90) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse89 2147483648))) (not (<= (+ c_~bag1~0 c_~sum1~0 .cse91) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse91 2147483648))) (not (<= (+ c_~bag1~0 .cse91) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse89 .cse90 2147483648))) (not (<= (+ c_~bag2~0 .cse89) 2147483647)) (not (<= 0 (+ c_~bag1~0 c_~sum1~0 .cse91 2147483648))) (not (<= 0 (+ .cse91 .cse92 2147483648)))))))) .cse17)) (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647)))))) is different from false [2022-12-12 19:47:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:47:42,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563656490] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:47:42,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:47:42,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 35 [2022-12-12 19:47:42,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995622368] [2022-12-12 19:47:42,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:47:42,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-12 19:47:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:47:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-12 19:47:42,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1017, Unknown=1, NotChecked=66, Total=1260 [2022-12-12 19:47:42,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:47:42,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 4567 transitions, 265933 flow. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:47:42,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:47:42,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:47:42,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:48:34,548 INFO L130 PetriNetUnfolder]: 5392/8847 cut-off events. [2022-12-12 19:48:34,548 INFO L131 PetriNetUnfolder]: For 567/567 co-relation queries the response was YES. [2022-12-12 19:48:34,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265962 conditions, 8847 events. 5392/8847 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 60205 event pairs, 0 based on Foata normal form. 4/6888 useless extension candidates. Maximal degree in co-relation 128206. Up to 8706 conditions per place. [2022-12-12 19:48:34,648 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 2782 selfloop transitions, 2250 changer transitions 67/5099 dead transitions. [2022-12-12 19:48:34,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 831 places, 5099 transitions, 307164 flow [2022-12-12 19:48:34,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-12-12 19:48:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2022-12-12 19:48:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 413 transitions. [2022-12-12 19:48:34,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31478658536585363 [2022-12-12 19:48:34,651 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 811 predicate places. [2022-12-12 19:48:34,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 831 places, 5099 transitions, 307164 flow [2022-12-12 19:48:34,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 827 places, 5032 transitions, 303096 flow [2022-12-12 19:48:34,836 INFO L495 AbstractCegarLoop]: Abstraction has has 827 places, 5032 transitions, 303096 flow [2022-12-12 19:48:34,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:48:34,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:48:34,836 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:48:34,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-12 19:48:35,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-12 19:48:35,041 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:48:35,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:48:35,041 INFO L85 PathProgramCache]: Analyzing trace with hash -462951712, now seen corresponding path program 24 times [2022-12-12 19:48:35,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:48:35,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503845812] [2022-12-12 19:48:35,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:48:35,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:48:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:48:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:48:39,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:48:39,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503845812] [2022-12-12 19:48:39,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503845812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:48:39,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679472007] [2022-12-12 19:48:39,706 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 19:48:39,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:48:39,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:48:39,709 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:48:39,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-12 19:48:39,913 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-12 19:48:39,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:48:39,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-12 19:48:39,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:48:39,984 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-12-12 19:48:40,035 INFO L350 Elim1Store]: Elim1 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-12-12 19:48:40,150 INFO L350 Elim1Store]: Elim1 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-12-12 19:48:40,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:48:40,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 216 [2022-12-12 19:48:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:48:41,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:48:48,896 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse129 (* c_~i~0 4)) (.cse130 (* c_~j~0 4))) (let ((.cse0 (not (< (+ c_~i~0 1) c_~N~0))) (.cse27 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse28 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse8 (+ c_~A~0.offset .cse130)) (.cse7 (+ c_~A~0.offset .cse129)) (.cse9 (+ c_~A~0.offset .cse130 4)) (.cse6 (+ c_~A~0.offset .cse129 4)) (.cse15 (<= (+ 3 c_~i~0) c_~N~0)) (.cse26 (not (< (+ c_~j~0 1) c_~N~0)))) (and (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) .cse0 (and (or (and (or (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse3 (select .cse5 .cse9)) (.cse4 (select .cse5 .cse8)) (.cse1 (select .cse5 .cse7)) (.cse2 (select .cse5 .cse6))) (or (<= (+ c_~bag1~0 .cse1 c_~sum1~0 .cse2) (+ c_~bag2~0 c_~sum2~0 .cse3 .cse4)) (not (<= (+ c_~bag2~0 .cse4) 2147483647)) (not (<= (+ c_~bag2~0 .cse3 .cse4) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse4))) (< (+ .cse1 .cse2 2147483648) 0) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648 .cse4))) (< 2147483647 (+ c_~bag1~0 .cse1)) (< 2147483647 (+ .cse1 .cse2)))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse11 (select .cse14 .cse9)) (.cse10 (select .cse14 .cse8)) (.cse12 (select .cse14 .cse7)) (.cse13 (select .cse14 .cse6))) (or (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (not (<= (+ c_~bag2~0 .cse11 .cse10) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse10))) (< (+ .cse12 .cse13 2147483648) 0) (not (<= 0 (+ c_~bag2~0 .cse11 2147483648 .cse10))) (< 2147483647 (+ c_~bag1~0 .cse12)) (< 2147483647 (+ .cse12 .cse13)) (<= (+ c_~bag2~0 c_~sum2~0 .cse11 .cse10) (+ c_~bag1~0 .cse12 c_~sum1~0 .cse13))))))) .cse15) (or (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse17 (select .cse20 .cse6)) (.cse18 (select .cse20 .cse9)) (.cse19 (select .cse20 .cse8)) (.cse16 (select .cse20 .cse7))) (or (<= (+ c_~bag1~0 .cse16 c_~sum1~0 .cse17) (+ c_~bag2~0 c_~sum2~0 .cse18 .cse19)) (not (<= (+ c_~bag2~0 .cse19) 2147483647)) (not (<= (+ c_~bag2~0 .cse18 .cse19) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse19))) (not (<= 0 (+ c_~bag1~0 .cse16 c_~sum1~0 2147483648))) (< (+ .cse16 .cse17 2147483648) 0) (not (<= (+ c_~bag1~0 .cse16 c_~sum1~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse18 2147483648 .cse19))) (< 2147483647 (+ c_~bag1~0 .cse16)))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse22 (select .cse25 .cse9)) (.cse21 (select .cse25 .cse8)) (.cse23 (select .cse25 .cse7)) (.cse24 (select .cse25 .cse6))) (or (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (not (<= (+ c_~bag2~0 .cse22 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse21))) (not (<= 0 (+ c_~bag1~0 .cse23 c_~sum1~0 2147483648))) (< (+ .cse23 .cse24 2147483648) 0) (not (<= (+ c_~bag1~0 .cse23 c_~sum1~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse22 2147483648 .cse21))) (< 2147483647 (+ c_~bag1~0 .cse23)) (<= (+ c_~bag2~0 c_~sum2~0 .cse22 .cse21) (+ c_~bag1~0 .cse23 c_~sum1~0 .cse24))))))) .cse15)) .cse26) (or .cse27 .cse28 (and (or .cse26 (and (or (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse29 (select .cse33 .cse9)) (.cse32 (select .cse33 .cse6)) (.cse31 (select .cse33 .cse7)) (.cse30 (select .cse33 .cse8))) (or (not (<= 0 (+ .cse29 2147483648 .cse30))) (<= (+ c_~bag1~0 .cse31 c_~sum1~0 .cse32) (+ c_~bag2~0 c_~sum2~0 .cse29 .cse30)) (not (<= (+ c_~bag2~0 .cse30) 2147483647)) (not (<= (+ .cse29 .cse30) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse30))) (not (<= 0 (+ c_~bag1~0 .cse31 c_~sum1~0 2147483648))) (< (+ .cse31 .cse32 2147483648) 0) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse30))) (not (<= (+ c_~bag1~0 .cse31 c_~sum1~0) 2147483647)) (< 2147483647 (+ c_~bag1~0 .cse31)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse30) 2147483647)))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse34 (select .cse38 .cse9)) (.cse36 (select .cse38 .cse7)) (.cse37 (select .cse38 .cse6)) (.cse35 (select .cse38 .cse8))) (or (not (<= 0 (+ .cse34 2147483648 .cse35))) (not (<= (+ c_~bag2~0 .cse35) 2147483647)) (not (<= (+ .cse34 .cse35) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse35))) (not (<= 0 (+ c_~bag1~0 .cse36 c_~sum1~0 2147483648))) (< (+ .cse36 .cse37 2147483648) 0) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse35))) (not (<= (+ c_~bag1~0 .cse36 c_~sum1~0) 2147483647)) (< 2147483647 (+ c_~bag1~0 .cse36)) (<= (+ c_~bag2~0 c_~sum2~0 .cse34 .cse35) (+ c_~bag1~0 .cse36 c_~sum1~0 .cse37)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse35) 2147483647))))))) .cse15) (or (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse39 (select .cse43 .cse9)) (.cse41 (select .cse43 .cse7)) (.cse42 (select .cse43 .cse6)) (.cse40 (select .cse43 .cse8))) (or (not (<= 0 (+ .cse39 2147483648 .cse40))) (not (<= (+ c_~bag2~0 .cse40) 2147483647)) (not (<= (+ .cse39 .cse40) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse40))) (< (+ .cse41 .cse42 2147483648) 0) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse40))) (< 2147483647 (+ c_~bag1~0 .cse41)) (< 2147483647 (+ .cse41 .cse42)) (<= (+ c_~bag2~0 c_~sum2~0 .cse39 .cse40) (+ c_~bag1~0 .cse41 c_~sum1~0 .cse42)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse40) 2147483647)))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse48 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse44 (select .cse48 .cse9)) (.cse46 (select .cse48 .cse7)) (.cse47 (select .cse48 .cse6)) (.cse45 (select .cse48 .cse8))) (or (not (<= 0 (+ .cse44 2147483648 .cse45))) (<= (+ c_~bag1~0 .cse46 c_~sum1~0 .cse47) (+ c_~bag2~0 c_~sum2~0 .cse44 .cse45)) (not (<= (+ c_~bag2~0 .cse45) 2147483647)) (not (<= (+ .cse44 .cse45) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse45))) (< (+ .cse46 .cse47 2147483648) 0) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse45))) (< 2147483647 (+ c_~bag1~0 .cse46)) (< 2147483647 (+ .cse46 .cse47)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse45) 2147483647))))))) .cse15))) (or (and (or (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse50 (select .cse53 .cse8)) (.cse49 (select .cse53 .cse9)) (.cse51 (select .cse53 .cse7)) (.cse52 (select .cse53 .cse6))) (or (not (<= 0 (+ .cse49 2147483648 .cse50))) (<= (+ c_~bag1~0 .cse51 c_~sum1~0 .cse52) (+ c_~bag2~0 c_~sum2~0 .cse49 .cse50)) (not (<= (+ c_~bag2~0 .cse50) 2147483647)) (< c_~bag2~0 (+ .cse49 1)) (< (+ .cse51 .cse52 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse51)) (< 2147483647 (+ .cse51 .cse52)))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse58 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse54 (select .cse58 .cse9)) (.cse55 (select .cse58 .cse8)) (.cse56 (select .cse58 .cse7)) (.cse57 (select .cse58 .cse6))) (or (not (<= 0 (+ .cse54 2147483648 .cse55))) (not (<= (+ c_~bag2~0 .cse55) 2147483647)) (< c_~bag2~0 (+ .cse54 1)) (< (+ .cse56 .cse57 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse56)) (< 2147483647 (+ .cse56 .cse57)) (<= (+ c_~bag2~0 c_~sum2~0 .cse54 .cse55) (+ c_~bag1~0 .cse56 c_~sum1~0 .cse57))))))) .cse15) (or (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse63 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse60 (select .cse63 .cse8)) (.cse59 (select .cse63 .cse9)) (.cse62 (select .cse63 .cse6)) (.cse61 (select .cse63 .cse7))) (or (not (<= 0 (+ .cse59 2147483648 .cse60))) (<= (+ c_~bag1~0 .cse61 c_~sum1~0 .cse62) (+ c_~bag2~0 c_~sum2~0 .cse59 .cse60)) (not (<= (+ c_~bag2~0 .cse60) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse61 c_~sum1~0 2147483648))) (< c_~bag2~0 (+ .cse59 1)) (< (+ .cse61 .cse62 2147483648) 0) (not (<= (+ c_~bag1~0 .cse61 c_~sum1~0) 2147483647)) (< 2147483647 (+ c_~bag1~0 .cse61)))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse68 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse64 (select .cse68 .cse9)) (.cse65 (select .cse68 .cse8)) (.cse66 (select .cse68 .cse7)) (.cse67 (select .cse68 .cse6))) (or (not (<= 0 (+ .cse64 2147483648 .cse65))) (not (<= (+ c_~bag2~0 .cse65) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse66 c_~sum1~0 2147483648))) (< c_~bag2~0 (+ .cse64 1)) (< (+ .cse66 .cse67 2147483648) 0) (not (<= (+ c_~bag1~0 .cse66 c_~sum1~0) 2147483647)) (< 2147483647 (+ c_~bag1~0 .cse66)) (<= (+ c_~bag2~0 c_~sum2~0 .cse64 .cse65) (+ c_~bag1~0 .cse66 c_~sum1~0 .cse67))))))) .cse15)) .cse26)))) (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (or .cse0 (and (or .cse26 (and (or (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse73 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse71 (select .cse73 .cse6)) (.cse70 (select .cse73 .cse7)) (.cse72 (select .cse73 .cse9)) (.cse69 (select .cse73 .cse8))) (or (< 2147483647 (+ c_~bag2~0 .cse69)) (< 2147483646 (+ c_~bag1~0 .cse70)) (< (+ c_~bag1~0 .cse70 .cse71 2147483648) 0) (< (+ c_~bag1~0 .cse70 2147483648) 0) (< (+ c_~bag2~0 .cse72 2147483648 .cse69) 0) (< (+ c_~bag1~0 .cse70 c_~sum1~0 2147483648) 0) (<= (+ c_~bag2~0 c_~sum2~0 .cse72 .cse69) (+ c_~bag1~0 .cse70 c_~sum1~0 .cse71)) (< 2147483647 (+ c_~bag1~0 .cse70 c_~sum1~0)) (< 2147483647 (+ c_~bag2~0 .cse72 .cse69)) (< (+ c_~bag2~0 2147483648 .cse69) 0))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse78 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse76 (select .cse78 .cse6)) (.cse75 (select .cse78 .cse7)) (.cse77 (select .cse78 .cse9)) (.cse74 (select .cse78 .cse8))) (or (< 2147483647 (+ c_~bag2~0 .cse74)) (<= (+ c_~bag1~0 .cse75 c_~sum1~0 .cse76) (+ c_~bag2~0 c_~sum2~0 .cse77 .cse74)) (< 2147483646 (+ c_~bag1~0 .cse75)) (< (+ c_~bag1~0 .cse75 .cse76 2147483648) 0) (< (+ c_~bag1~0 .cse75 2147483648) 0) (< (+ c_~bag2~0 .cse77 2147483648 .cse74) 0) (< (+ c_~bag1~0 .cse75 c_~sum1~0 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse75 c_~sum1~0)) (< 2147483647 (+ c_~bag2~0 .cse77 .cse74)) (< (+ c_~bag2~0 2147483648 .cse74) 0)))))) .cse15) (or (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse83 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse82 (select .cse83 .cse9)) (.cse81 (select .cse83 .cse8)) (.cse79 (select .cse83 .cse7)) (.cse80 (select .cse83 .cse6))) (or (not (<= 0 (+ c_~bag1~0 .cse79 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse79 .cse80 2147483648))) (not (<= (+ c_~bag2~0 .cse81) 2147483647)) (not (<= (+ c_~bag2~0 .cse82 .cse81) 2147483647)) (not (<= (+ c_~bag1~0 .cse79) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse81))) (not (<= (+ c_~bag1~0 .cse79 .cse80) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse82 2147483648 .cse81))) (<= (+ c_~bag2~0 c_~sum2~0 .cse82 .cse81) (+ c_~bag1~0 .cse79 c_~sum1~0 .cse80)))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse88 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse84 (select .cse88 .cse7)) (.cse85 (select .cse88 .cse6)) (.cse86 (select .cse88 .cse9)) (.cse87 (select .cse88 .cse8))) (or (not (<= 0 (+ c_~bag1~0 .cse84 2147483648))) (<= (+ c_~bag1~0 .cse84 c_~sum1~0 .cse85) (+ c_~bag2~0 c_~sum2~0 .cse86 .cse87)) (not (<= 0 (+ c_~bag1~0 .cse84 .cse85 2147483648))) (not (<= (+ c_~bag2~0 .cse87) 2147483647)) (not (<= (+ c_~bag2~0 .cse86 .cse87) 2147483647)) (not (<= (+ c_~bag1~0 .cse84) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse87))) (not (<= (+ c_~bag1~0 .cse84 .cse85) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse86 2147483648 .cse87)))))))) .cse15))) (or .cse27 .cse28 (and (or (and (or (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse93 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse89 (select .cse93 .cse8)) (.cse92 (select .cse93 .cse6)) (.cse90 (select .cse93 .cse9)) (.cse91 (select .cse93 .cse7))) (or (< 2147483647 (+ c_~bag2~0 .cse89)) (< (+ .cse90 2147483648 .cse89) 0) (<= (+ c_~bag1~0 .cse91 c_~sum1~0 .cse92) (+ c_~bag2~0 c_~sum2~0 .cse90 .cse89)) (< 2147483646 (+ c_~bag1~0 .cse91)) (< (+ c_~bag1~0 .cse91 .cse92 2147483648) 0) (< (+ c_~bag1~0 .cse91 2147483648) 0) (< c_~bag2~0 (+ .cse90 1)) (< (+ c_~bag1~0 .cse91 c_~sum1~0 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse91 c_~sum1~0)))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse98 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse95 (select .cse98 .cse9)) (.cse94 (select .cse98 .cse8)) (.cse97 (select .cse98 .cse6)) (.cse96 (select .cse98 .cse7))) (or (< 2147483647 (+ c_~bag2~0 .cse94)) (< (+ .cse95 2147483648 .cse94) 0) (< 2147483646 (+ c_~bag1~0 .cse96)) (< (+ c_~bag1~0 .cse96 .cse97 2147483648) 0) (< (+ c_~bag1~0 .cse96 2147483648) 0) (< c_~bag2~0 (+ .cse95 1)) (< (+ c_~bag1~0 .cse96 c_~sum1~0 2147483648) 0) (<= (+ c_~bag2~0 c_~sum2~0 .cse95 .cse94) (+ c_~bag1~0 .cse96 c_~sum1~0 .cse97)) (< 2147483647 (+ c_~bag1~0 .cse96 c_~sum1~0))))))) .cse15) (or .cse15 (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse103 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse99 (select .cse103 .cse9)) (.cse100 (select .cse103 .cse8)) (.cse101 (select .cse103 .cse7)) (.cse102 (select .cse103 .cse6))) (or (not (<= 0 (+ .cse99 2147483648 .cse100))) (not (<= 0 (+ c_~bag1~0 .cse101 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse101 .cse102 2147483648))) (not (<= (+ c_~bag2~0 .cse100) 2147483647)) (not (<= (+ c_~bag1~0 .cse101) 2147483647)) (< c_~bag2~0 (+ .cse99 1)) (not (<= (+ c_~bag1~0 .cse101 .cse102) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse99 .cse100) (+ c_~bag1~0 .cse101 c_~sum1~0 .cse102)))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse108 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse105 (select .cse108 .cse8)) (.cse104 (select .cse108 .cse9)) (.cse106 (select .cse108 .cse7)) (.cse107 (select .cse108 .cse6))) (or (not (<= 0 (+ .cse104 2147483648 .cse105))) (not (<= 0 (+ c_~bag1~0 .cse106 2147483648))) (<= (+ c_~bag1~0 .cse106 c_~sum1~0 .cse107) (+ c_~bag2~0 c_~sum2~0 .cse104 .cse105)) (not (<= 0 (+ c_~bag1~0 .cse106 .cse107 2147483648))) (not (<= (+ c_~bag2~0 .cse105) 2147483647)) (not (<= (+ c_~bag1~0 .cse106) 2147483647)) (< c_~bag2~0 (+ .cse104 1)) (not (<= (+ c_~bag1~0 .cse106 .cse107) 2147483647))))))))) .cse26) (or (and (or (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse113 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse109 (select .cse113 .cse9)) (.cse111 (select .cse113 .cse7)) (.cse112 (select .cse113 .cse6)) (.cse110 (select .cse113 .cse8))) (or (not (<= 0 (+ .cse109 2147483648 .cse110))) (not (<= 0 (+ c_~bag1~0 .cse111 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse111 .cse112 2147483648))) (not (<= (+ c_~bag2~0 .cse110) 2147483647)) (not (<= (+ .cse109 .cse110) 2147483647)) (not (<= (+ c_~bag1~0 .cse111) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse110))) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse110))) (not (<= (+ c_~bag1~0 .cse111 .cse112) 2147483647)) (<= (+ c_~bag2~0 c_~sum2~0 .cse109 .cse110) (+ c_~bag1~0 .cse111 c_~sum1~0 .cse112)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse110) 2147483647)))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse118 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse114 (select .cse118 .cse9)) (.cse116 (select .cse118 .cse7)) (.cse117 (select .cse118 .cse6)) (.cse115 (select .cse118 .cse8))) (or (not (<= 0 (+ .cse114 2147483648 .cse115))) (not (<= 0 (+ c_~bag1~0 .cse116 2147483648))) (<= (+ c_~bag1~0 .cse116 c_~sum1~0 .cse117) (+ c_~bag2~0 c_~sum2~0 .cse114 .cse115)) (not (<= 0 (+ c_~bag1~0 .cse116 .cse117 2147483648))) (not (<= (+ c_~bag2~0 .cse115) 2147483647)) (not (<= (+ .cse114 .cse115) 2147483647)) (not (<= (+ c_~bag1~0 .cse116) 2147483647)) (not (<= 0 (+ c_~bag2~0 2147483648 .cse115))) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse115))) (not (<= (+ c_~bag1~0 .cse116 .cse117) 2147483647)) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse115) 2147483647))))))) .cse15) (or (and (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse123 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse120 (select .cse123 .cse9)) (.cse122 (select .cse123 .cse6)) (.cse121 (select .cse123 .cse7)) (.cse119 (select .cse123 .cse8))) (or (< 2147483647 (+ c_~bag2~0 .cse119)) (< (+ .cse120 2147483648 .cse119) 0) (< 2147483646 (+ c_~bag1~0 .cse121)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse119)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse119) 0) (< (+ c_~bag1~0 .cse121 .cse122 2147483648) 0) (< 2147483647 (+ .cse120 .cse119)) (< (+ c_~bag1~0 .cse121 2147483648) 0) (< (+ c_~bag1~0 .cse121 c_~sum1~0 2147483648) 0) (<= (+ c_~bag2~0 c_~sum2~0 .cse120 .cse119) (+ c_~bag1~0 .cse121 c_~sum1~0 .cse122)) (< 2147483647 (+ c_~bag1~0 .cse121 c_~sum1~0)) (< (+ c_~bag2~0 2147483648 .cse119) 0))))) (forall ((v_ArrVal_932 (Array Int Int))) (let ((.cse128 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932) c_~A~0.base))) (let ((.cse127 (select .cse128 .cse6)) (.cse125 (select .cse128 .cse9)) (.cse126 (select .cse128 .cse7)) (.cse124 (select .cse128 .cse8))) (or (< 2147483647 (+ c_~bag2~0 .cse124)) (< (+ .cse125 2147483648 .cse124) 0) (<= (+ c_~bag1~0 .cse126 c_~sum1~0 .cse127) (+ c_~bag2~0 c_~sum2~0 .cse125 .cse124)) (< 2147483646 (+ c_~bag1~0 .cse126)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse124)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse124) 0) (< (+ c_~bag1~0 .cse126 .cse127 2147483648) 0) (< 2147483647 (+ .cse125 .cse124)) (< (+ c_~bag1~0 .cse126 2147483648) 0) (< (+ c_~bag1~0 .cse126 c_~sum1~0 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse126 c_~sum1~0)) (< (+ c_~bag2~0 2147483648 .cse124) 0)))))) .cse15)) .cse26)))))))) is different from false [2022-12-12 19:48:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:48:50,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679472007] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:48:50,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:48:50,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 35 [2022-12-12 19:48:50,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189631658] [2022-12-12 19:48:50,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:48:50,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-12 19:48:50,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:48:50,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-12 19:48:50,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1044, Unknown=1, NotChecked=66, Total=1260 [2022-12-12 19:48:50,602 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:48:50,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 827 places, 5032 transitions, 303096 flow. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:48:50,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:48:50,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:48:50,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:49:00,018 WARN L233 SmtUtils]: Spent 8.56s on a formula simplification. DAG size of input: 374 DAG size of output: 371 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:49:08,568 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 340 DAG size of output: 337 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:50:04,638 INFO L130 PetriNetUnfolder]: 5639/9241 cut-off events. [2022-12-12 19:50:04,638 INFO L131 PetriNetUnfolder]: For 576/576 co-relation queries the response was YES. [2022-12-12 19:50:04,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287027 conditions, 9241 events. 5639/9241 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 63274 event pairs, 0 based on Foata normal form. 5/7199 useless extension candidates. Maximal degree in co-relation 144566. Up to 9100 conditions per place. [2022-12-12 19:50:04,747 INFO L137 encePairwiseOnDemand]: 5/16 looper letters, 2785 selfloop transitions, 2518 changer transitions 31/5334 dead transitions. [2022-12-12 19:50:04,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 892 places, 5334 transitions, 331941 flow [2022-12-12 19:50:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-12 19:50:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-12-12 19:50:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 307 transitions. [2022-12-12 19:50:04,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29071969696969696 [2022-12-12 19:50:04,749 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 872 predicate places. [2022-12-12 19:50:04,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 892 places, 5334 transitions, 331941 flow [2022-12-12 19:50:04,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 888 places, 5303 transitions, 329989 flow [2022-12-12 19:50:04,965 INFO L495 AbstractCegarLoop]: Abstraction has has 888 places, 5303 transitions, 329989 flow [2022-12-12 19:50:04,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:50:04,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:50:04,965 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:50:04,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-12 19:50:05,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:50:05,170 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:50:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:50:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1428862522, now seen corresponding path program 25 times [2022-12-12 19:50:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:50:05,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77937812] [2022-12-12 19:50:05,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:50:05,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:50:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:50:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:50:12,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:50:12,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77937812] [2022-12-12 19:50:12,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77937812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:50:12,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788732260] [2022-12-12 19:50:12,997 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 19:50:12,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:50:12,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:50:12,998 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:50:12,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-12 19:50:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:50:13,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-12 19:50:13,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:50:13,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:50:13,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 166 [2022-12-12 19:50:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:50:13,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:50:15,430 INFO L321 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2022-12-12 19:50:15,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1136 treesize of output 670 [2022-12-12 19:50:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:50:34,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788732260] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:50:34,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:50:34,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 30 [2022-12-12 19:50:34,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92348205] [2022-12-12 19:50:34,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:50:34,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-12 19:50:34,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:50:34,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-12 19:50:34,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2022-12-12 19:50:34,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:50:34,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 888 places, 5303 transitions, 329989 flow. Second operand has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:50:34,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:50:34,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:50:34,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:50:58,023 INFO L130 PetriNetUnfolder]: 5957/9844 cut-off events. [2022-12-12 19:50:58,024 INFO L131 PetriNetUnfolder]: For 595/595 co-relation queries the response was YES. [2022-12-12 19:50:58,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315584 conditions, 9844 events. 5957/9844 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 69151 event pairs, 0 based on Foata normal form. 24/7705 useless extension candidates. Maximal degree in co-relation 154282. Up to 9703 conditions per place. [2022-12-12 19:50:58,133 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 3312 selfloop transitions, 2276 changer transitions 123/5711 dead transitions. [2022-12-12 19:50:58,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 5711 transitions, 366794 flow [2022-12-12 19:50:58,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-12 19:50:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-12-12 19:50:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 232 transitions. [2022-12-12 19:50:58,135 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29591836734693877 [2022-12-12 19:50:58,135 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 916 predicate places. [2022-12-12 19:50:58,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 936 places, 5711 transitions, 366794 flow [2022-12-12 19:50:58,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 924 places, 5588 transitions, 358838 flow [2022-12-12 19:50:58,343 INFO L495 AbstractCegarLoop]: Abstraction has has 924 places, 5588 transitions, 358838 flow [2022-12-12 19:50:58,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:50:58,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:50:58,343 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:50:58,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-12 19:50:58,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:50:58,547 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:50:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:50:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash 616902952, now seen corresponding path program 26 times [2022-12-12 19:50:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:50:58,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073812686] [2022-12-12 19:50:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:50:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:50:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:51:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:51:01,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:51:01,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073812686] [2022-12-12 19:51:01,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073812686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:51:01,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573447292] [2022-12-12 19:51:01,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 19:51:01,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:51:01,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:51:01,854 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:51:01,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-12 19:51:01,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 19:51:01,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:51:01,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-12 19:51:01,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:51:02,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:51:02,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 189 [2022-12-12 19:51:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:51:02,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:51:03,958 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-12 19:51:03,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1073 treesize of output 619 [2022-12-12 19:51:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:51:09,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573447292] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:51:09,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:51:09,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 28 [2022-12-12 19:51:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634824565] [2022-12-12 19:51:09,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:51:09,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-12 19:51:09,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:51:09,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-12 19:51:09,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2022-12-12 19:51:09,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-12 19:51:09,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 5588 transitions, 358838 flow. Second operand has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:51:09,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:51:09,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-12 19:51:09,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:51:31,621 INFO L130 PetriNetUnfolder]: 6032/9894 cut-off events. [2022-12-12 19:51:31,621 INFO L131 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2022-12-12 19:51:31,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327059 conditions, 9894 events. 6032/9894 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 68846 event pairs, 0 based on Foata normal form. 5/7722 useless extension candidates. Maximal degree in co-relation 160618. Up to 9750 conditions per place. [2022-12-12 19:51:31,731 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 3254 selfloop transitions, 2441 changer transitions 27/5722 dead transitions. [2022-12-12 19:51:31,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 5722 transitions, 378882 flow [2022-12-12 19:51:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-12 19:51:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-12-12 19:51:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 219 transitions. [2022-12-12 19:51:31,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26322115384615385 [2022-12-12 19:51:31,733 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 955 predicate places. [2022-12-12 19:51:31,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 975 places, 5722 transitions, 378882 flow [2022-12-12 19:51:31,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 975 places, 5695 transitions, 377070 flow [2022-12-12 19:51:31,941 INFO L495 AbstractCegarLoop]: Abstraction has has 975 places, 5695 transitions, 377070 flow [2022-12-12 19:51:31,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:51:31,941 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:51:31,941 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:51:31,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-12 19:51:32,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:51:32,146 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 19:51:32,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:51:32,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1137486142, now seen corresponding path program 27 times [2022-12-12 19:51:32,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:51:32,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635736309] [2022-12-12 19:51:32,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:51:32,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:51:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:51:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:51:42,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:51:42,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635736309] [2022-12-12 19:51:42,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635736309] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:51:42,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349991682] [2022-12-12 19:51:42,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 19:51:42,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:51:42,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:51:42,238 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:51:42,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-12 19:51:42,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-12 19:51:42,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:51:42,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-12 19:51:42,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:51:43,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:51:43,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 216 [2022-12-12 19:51:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:51:43,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:51:46,463 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-12 19:51:46,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2430 treesize of output 958 Received shutdown request... [2022-12-12 19:51:51,934 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 19:51:51,937 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-12 19:51:51,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-12 19:51:51,966 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 19:51:52,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:51:52,138 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-7-1 term,while PolyPacSimplificationTermWalker was simplifying 7 xjuncts wrt. a ∧-13-7-3-17-2-27-2-19-2-1 context. [2022-12-12 19:51:52,139 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-12 19:51:52,140 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-12 19:51:52,140 INFO L445 BasicCegarLoop]: Path program histogram: [27, 2, 1, 1, 1, 1] [2022-12-12 19:51:52,143 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 19:51:52,144 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 19:51:52,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 07:51:52 BasicIcfg [2022-12-12 19:51:52,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 19:51:52,146 INFO L158 Benchmark]: Toolchain (without parser) took 838739.95ms. Allocated memory was 209.7MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 186.9MB in the beginning and 872.8MB in the end (delta: -685.9MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-12 19:51:52,146 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 19:51:52,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.21ms. Allocated memory is still 209.7MB. Free memory was 186.9MB in the beginning and 174.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-12 19:51:52,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.89ms. Allocated memory is still 209.7MB. Free memory was 174.8MB in the beginning and 172.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 19:51:52,146 INFO L158 Benchmark]: Boogie Preprocessor took 47.22ms. Allocated memory is still 209.7MB. Free memory was 172.2MB in the beginning and 170.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 19:51:52,146 INFO L158 Benchmark]: RCFGBuilder took 483.04ms. Allocated memory is still 209.7MB. Free memory was 170.1MB in the beginning and 145.5MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-12 19:51:52,147 INFO L158 Benchmark]: TraceAbstraction took 837902.92ms. Allocated memory was 209.7MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 144.4MB in the beginning and 872.8MB in the end (delta: -728.3MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-12 19:51:52,147 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.21ms. Allocated memory is still 209.7MB. Free memory was 186.9MB in the beginning and 174.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.89ms. Allocated memory is still 209.7MB. Free memory was 174.8MB in the beginning and 172.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.22ms. Allocated memory is still 209.7MB. Free memory was 172.2MB in the beginning and 170.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 483.04ms. Allocated memory is still 209.7MB. Free memory was 170.1MB in the beginning and 145.5MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 837902.92ms. Allocated memory was 209.7MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 144.4MB in the beginning and 872.8MB in the end (delta: -728.3MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5s, 305 PlacesBefore, 20 PlacesAfterwards, 326 TransitionsBefore, 16 TransitionsAfterwards, 25652 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 91 TrivialYvCompositions, 194 ConcurrentYvCompositions, 25 ChoiceCompositions, 310 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 17021, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15363, independent: 15348, independent conditional: 0, independent unconditional: 15348, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15363, independent: 15348, independent conditional: 0, independent unconditional: 15348, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17040, independent: 1673, independent conditional: 0, independent unconditional: 1673, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 15363, unknown conditional: 0, unknown unconditional: 15363] , Statistics on independence cache: Total cache size (in pairs): 34757, Positive cache size: 34742, Positive conditional cache size: 0, Positive unconditional cache size: 34742, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-7-1 term,while PolyPacSimplificationTermWalker was simplifying 7 xjuncts wrt. a ∧-13-7-3-17-2-27-2-19-2-1 context. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-7-1 term,while PolyPacSimplificationTermWalker was simplifying 7 xjuncts wrt. a ∧-13-7-3-17-2-27-2-19-2-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-7-1 term,while PolyPacSimplificationTermWalker was simplifying 7 xjuncts wrt. a ∧-13-7-3-17-2-27-2-19-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 503 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 1.8s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 837.7s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 27, EmptinessCheckTime: 0.0s, AutomataDifference: 556.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.8s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 9119 SdHoareTripleChecker+Valid, 29.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9119 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 27.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 917 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21477 IncrementalHoareTripleChecker+Invalid, 24820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2399 mSolverCounterUnsat, 0 mSDtfsCounter, 21477 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2297 GetRequests, 559 SyntacticMatches, 55 SemanticMatches, 1683 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 43180 ImplicationChecksByTransitivity, 445.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=377070occurred in iteration=32, InterpolantAutomatonStates: 1172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 44255 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 238.6s InterpolantComputationTime, 1054 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 1467 ConstructedInterpolants, 37 QuantifiedInterpolants, 171982 SizeOfPredicates, 1810 NumberOfNonLiveVariables, 6576 ConjunctsInSsa, 1412 ConjunctsInUnsatCore, 88 InterpolantComputations, 6 PerfectInterpolantSequences, 124/543 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown