./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 06:02:54,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 06:02:54,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 06:02:54,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 06:02:54,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 06:02:54,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 06:02:54,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 06:02:54,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 06:02:54,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 06:02:54,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 06:02:54,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 06:02:54,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 06:02:54,936 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 06:02:54,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 06:02:54,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 06:02:54,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 06:02:54,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 06:02:54,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 06:02:54,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 06:02:54,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 06:02:54,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 06:02:54,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 06:02:54,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 06:02:54,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 06:02:54,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 06:02:54,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 06:02:54,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 06:02:54,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 06:02:54,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 06:02:54,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 06:02:54,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 06:02:54,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 06:02:54,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 06:02:54,944 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 06:02:54,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 06:02:54,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 06:02:54,944 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 06:02:54,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 06:02:54,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 06:02:54,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 06:02:54,946 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 06:02:54,946 INFO L153 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/UGemCutter-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR_WITH_CONTEXT [2024-10-17 06:02:55,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 06:02:55,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 06:02:55,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 06:02:55,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 06:02:55,229 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 06:02:55,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-17 06:02:56,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 06:02:56,836 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 06:02:56,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-10-17 06:02:56,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b2ede0978/69567160bd574a739772befae893e2df/FLAG7f5d292cf [2024-10-17 06:02:56,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b2ede0978/69567160bd574a739772befae893e2df [2024-10-17 06:02:56,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 06:02:56,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 06:02:56,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 06:02:56,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 06:02:56,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 06:02:56,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 06:02:56" (1/1) ... [2024-10-17 06:02:56,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197b205a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:56, skipping insertion in model container [2024-10-17 06:02:56,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 06:02:56" (1/1) ... [2024-10-17 06:02:56,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 06:02:57,105 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3425,3438] [2024-10-17 06:02:57,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 06:02:57,126 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 06:02:57,151 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3425,3438] [2024-10-17 06:02:57,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 06:02:57,168 INFO L204 MainTranslator]: Completed translation [2024-10-17 06:02:57,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57 WrapperNode [2024-10-17 06:02:57,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 06:02:57,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 06:02:57,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 06:02:57,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 06:02:57,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (1/1) ... [2024-10-17 06:02:57,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (1/1) ... [2024-10-17 06:02:57,202 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-10-17 06:02:57,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 06:02:57,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 06:02:57,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 06:02:57,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 06:02:57,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (1/1) ... [2024-10-17 06:02:57,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (1/1) ... [2024-10-17 06:02:57,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (1/1) ... [2024-10-17 06:02:57,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (1/1) ... [2024-10-17 06:02:57,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (1/1) ... [2024-10-17 06:02:57,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (1/1) ... [2024-10-17 06:02:57,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (1/1) ... [2024-10-17 06:02:57,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (1/1) ... [2024-10-17 06:02:57,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 06:02:57,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 06:02:57,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 06:02:57,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 06:02:57,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (1/1) ... [2024-10-17 06:02:57,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 06:02:57,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:02:57,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 06:02:57,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 06:02:57,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 06:02:57,324 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-17 06:02:57,324 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-17 06:02:57,324 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-17 06:02:57,324 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-17 06:02:57,324 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-17 06:02:57,324 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-17 06:02:57,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-17 06:02:57,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-17 06:02:57,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 06:02:57,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 06:02:57,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 06:02:57,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 06:02:57,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 06:02:57,335 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 06:02:57,426 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 06:02:57,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 06:02:57,644 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 06:02:57,645 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 06:02:57,808 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 06:02:57,808 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-17 06:02:57,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 06:02:57 BoogieIcfgContainer [2024-10-17 06:02:57,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 06:02:57,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 06:02:57,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 06:02:57,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 06:02:57,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 06:02:56" (1/3) ... [2024-10-17 06:02:57,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22559dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 06:02:57, skipping insertion in model container [2024-10-17 06:02:57,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:02:57" (2/3) ... [2024-10-17 06:02:57,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22559dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 06:02:57, skipping insertion in model container [2024-10-17 06:02:57,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 06:02:57" (3/3) ... [2024-10-17 06:02:57,820 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-10-17 06:02:57,838 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 06:02:57,838 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 06:02:57,838 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 06:02:57,918 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-17 06:02:57,964 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 06:02:57,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 06:02:57,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:02:57,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 06:02:57,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 06:02:58,051 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 06:02:58,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:02:58,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 06:02:58,081 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1fdf0a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 06:02:58,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-17 06:03:00,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 06:03:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1319336203, now seen corresponding path program 1 times [2024-10-17 06:03:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:00,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 564378240, now seen corresponding path program 1 times [2024-10-17 06:03:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:03:02,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:02,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:03:03,771 INFO L85 PathProgramCache]: Analyzing trace with hash -650195845, now seen corresponding path program 1 times [2024-10-17 06:03:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:03,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:03,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1928252765, now seen corresponding path program 1 times [2024-10-17 06:03:03,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:03,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-17 06:03:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:04,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-17 06:03:04,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1526022233, now seen corresponding path program 1 times [2024-10-17 06:03:04,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:04,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:03:06,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:03:07,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:03:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1752138499, now seen corresponding path program 1 times [2024-10-17 06:03:07,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:03:07,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428100693] [2024-10-17 06:03:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:07,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-17 06:03:07,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:03:07,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428100693] [2024-10-17 06:03:07,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428100693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:03:07,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 06:03:07,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-17 06:03:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345053787] [2024-10-17 06:03:07,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:03:07,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-17 06:03:07,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:03:08,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-17 06:03:08,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-17 06:03:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:03:08,021 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:03:08,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:03:08,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:03:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:08,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable0 [2024-10-17 06:03:08,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 06:03:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656764, now seen corresponding path program 1 times [2024-10-17 06:03:08,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:08,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:08,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458473, now seen corresponding path program 1 times [2024-10-17 06:03:08,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:08,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:03:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:03:14,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2103179361, now seen corresponding path program 1 times [2024-10-17 06:03:14,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:14,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-17 06:03:14,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:14,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-17 06:03:15,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:03:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash -506789776, now seen corresponding path program 2 times [2024-10-17 06:03:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:03:15,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481657721] [2024-10-17 06:03:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 111 proven. 94 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 06:03:17,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:03:17,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481657721] [2024-10-17 06:03:17,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481657721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:03:17,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320503510] [2024-10-17 06:03:17,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 06:03:17,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:03:17,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:03:17,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:03:17,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-17 06:03:17,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 06:03:17,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 06:03:17,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 06:03:17,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:03:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-17 06:03:17,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 06:03:17,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320503510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:03:17,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 06:03:17,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-10-17 06:03:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768540703] [2024-10-17 06:03:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:03:17,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 06:03:17,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:03:17,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 06:03:17,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-10-17 06:03:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:03:17,613 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:03:17,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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) [2024-10-17 06:03:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:03:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:18,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-17 06:03:18,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2024-10-17 06:03:18,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 06:03:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1765656771, now seen corresponding path program 1 times [2024-10-17 06:03:18,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:18,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458464, now seen corresponding path program 1 times [2024-10-17 06:03:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:03:20,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:20,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:03:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2103179370, now seen corresponding path program 1 times [2024-10-17 06:03:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:23,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-17 06:03:23,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:23,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-17 06:03:23,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:03:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash 564381910, now seen corresponding path program 3 times [2024-10-17 06:03:23,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:03:23,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122021652] [2024-10-17 06:03:23,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:23,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 06:03:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:03:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122021652] [2024-10-17 06:03:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122021652] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:03:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786761167] [2024-10-17 06:03:24,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 06:03:24,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:03:24,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:03:24,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:03:24,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-17 06:03:24,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-17 06:03:24,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 06:03:24,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-17 06:03:24,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:03:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 06:03:24,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:03:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-17 06:03:24,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786761167] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:03:24,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:03:24,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-17 06:03:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767674638] [2024-10-17 06:03:24,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:03:24,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 06:03:24,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:03:24,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 06:03:24,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-17 06:03:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:03:24,615 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:03:24,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:03:24,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:24,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:24,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:03:25,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 06:03:25,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-17 06:03:25,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-17 06:03:25,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 06:03:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164568, now seen corresponding path program 1 times [2024-10-17 06:03:26,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:26,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:26,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1012446633, now seen corresponding path program 1 times [2024-10-17 06:03:26,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:26,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:26,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1243371769, now seen corresponding path program 1 times [2024-10-17 06:03:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:26,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1493601783, now seen corresponding path program 1 times [2024-10-17 06:03:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:27,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:27,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash 148797668, now seen corresponding path program 1 times [2024-10-17 06:03:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-17 06:03:28,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:28,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-17 06:03:28,859 INFO L85 PathProgramCache]: Analyzing trace with hash -356756191, now seen corresponding path program 1 times [2024-10-17 06:03:28,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:28,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-17 06:03:29,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:29,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-17 06:03:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1946192339, now seen corresponding path program 1 times [2024-10-17 06:03:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-17 06:03:30,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-17 06:03:30,684 INFO L85 PathProgramCache]: Analyzing trace with hash 999052783, now seen corresponding path program 1 times [2024-10-17 06:03:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:30,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-17 06:03:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:31,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-10-17 06:03:31,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:03:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1323657417, now seen corresponding path program 4 times [2024-10-17 06:03:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:03:31,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265290292] [2024-10-17 06:03:31,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:31,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 438 proven. 298 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-17 06:03:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:03:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265290292] [2024-10-17 06:03:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265290292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:03:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076887499] [2024-10-17 06:03:37,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 06:03:37,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:03:37,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:03:37,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:03:37,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-17 06:03:37,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 06:03:37,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 06:03:37,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 06:03:37,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:03:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-17 06:03:37,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 06:03:37,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076887499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:03:37,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 06:03:37,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 28 [2024-10-17 06:03:37,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373862910] [2024-10-17 06:03:37,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:03:37,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 06:03:37,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:03:37,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 06:03:37,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-10-17 06:03:37,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:03:37,420 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:03:37,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:03:37,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:37,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:37,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 06:03:37,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:03:37,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:37,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:37,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 06:03:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:03:37,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-17 06:03:38,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-17 06:03:38,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 06:03:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164596, now seen corresponding path program 1 times [2024-10-17 06:03:38,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:38,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:38,651 INFO L85 PathProgramCache]: Analyzing trace with hash -749118961, now seen corresponding path program 1 times [2024-10-17 06:03:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:38,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash -396186417, now seen corresponding path program 1 times [2024-10-17 06:03:39,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:39,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:39,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1197215620, now seen corresponding path program 1 times [2024-10-17 06:03:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:39,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash 368111905, now seen corresponding path program 1 times [2024-10-17 06:03:39,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:40,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash -595742186, now seen corresponding path program 1 times [2024-10-17 06:03:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:40,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash -955123052, now seen corresponding path program 1 times [2024-10-17 06:03:41,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:41,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:41,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash 83246338, now seen corresponding path program 1 times [2024-10-17 06:03:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:41,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:41,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:03:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:03:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1650497023, now seen corresponding path program 1 times [2024-10-17 06:03:42,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:42,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:03:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 06:03:55,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:03:55,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:03:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:04:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 06:04:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash 25582910, now seen corresponding path program 1 times [2024-10-17 06:04:05,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:05,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:04:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-17 06:04:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:04:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-10-17 06:04:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1702001674, now seen corresponding path program 1 times [2024-10-17 06:04:06,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:06,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:04:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 237 proven. 307 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-17 06:04:23,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:23,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:04:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 237 proven. 307 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-17 06:04:38,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2146642938, now seen corresponding path program 1 times [2024-10-17 06:04:38,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:38,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:04:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-17 06:04:39,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:39,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:04:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-17 06:04:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:04:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash 589879332, now seen corresponding path program 5 times [2024-10-17 06:04:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:04:39,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479489505] [2024-10-17 06:04:39,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:04:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-17 06:04:40,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:04:40,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479489505] [2024-10-17 06:04:40,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479489505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:04:40,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369048784] [2024-10-17 06:04:40,355 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-17 06:04:40,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:04:40,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:04:40,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:04:40,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-17 06:04:40,587 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-17 06:04:40,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 06:04:40,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-17 06:04:40,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:04:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 986 proven. 82 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked. [2024-10-17 06:04:40,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:04:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 967 proven. 4 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2024-10-17 06:04:40,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369048784] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:04:40,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:04:40,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2024-10-17 06:04:40,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153975491] [2024-10-17 06:04:40,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:04:40,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-17 06:04:40,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:04:40,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-17 06:04:40,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-17 06:04:40,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:04:40,822 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:04:40,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:04:40,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:04:40,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:04:40,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 06:04:40,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:04:40,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:04:41,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:04:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:04:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 06:04:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:04:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 06:04:41,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-17 06:04:41,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable45,SelfDestructingSolverStorable35,SelfDestructingSolverStorable46,SelfDestructingSolverStorable36,SelfDestructingSolverStorable47,SelfDestructingSolverStorable37,SelfDestructingSolverStorable48,SelfDestructingSolverStorable38,SelfDestructingSolverStorable49,SelfDestructingSolverStorable39 [2024-10-17 06:04:41,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 06:04:42,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2057164644, now seen corresponding path program 1 times [2024-10-17 06:04:42,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:42,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:42,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:04:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:42,400 INFO L85 PathProgramCache]: Analyzing trace with hash -749118913, now seen corresponding path program 1 times [2024-10-17 06:04:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:42,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:04:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash -396186369, now seen corresponding path program 1 times [2024-10-17 06:04:42,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:42,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:04:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1197215572, now seen corresponding path program 1 times [2024-10-17 06:04:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:43,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:04:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:43,534 INFO L85 PathProgramCache]: Analyzing trace with hash 368111953, now seen corresponding path program 1 times [2024-10-17 06:04:43,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:43,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:43,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:04:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:44,037 INFO L85 PathProgramCache]: Analyzing trace with hash -595742138, now seen corresponding path program 1 times [2024-10-17 06:04:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:44,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:44,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:04:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:44,430 INFO L85 PathProgramCache]: Analyzing trace with hash -955123004, now seen corresponding path program 1 times [2024-10-17 06:04:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:44,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:04:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash 83246386, now seen corresponding path program 1 times [2024-10-17 06:04:44,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:44,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:44,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:04:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:04:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1650496975, now seen corresponding path program 1 times [2024-10-17 06:04:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:04:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 06:04:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:04:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:04:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:05:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 420 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-17 06:05:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2054584073, now seen corresponding path program 1 times [2024-10-17 06:05:04,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:05:04,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:05:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:05:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 19 proven. 552 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-17 06:05:22,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:05:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:05:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:05:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 19 proven. 552 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-17 06:05:35,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:05:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1596812803, now seen corresponding path program 6 times [2024-10-17 06:05:35,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:05:35,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268703518] [2024-10-17 06:05:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:05:35,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:05:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:05:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 319 proven. 1653 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-17 06:05:50,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:05:50,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268703518] [2024-10-17 06:05:50,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268703518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:05:50,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685875136] [2024-10-17 06:05:50,000 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-17 06:05:50,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:05:50,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:05:50,002 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:05:50,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-17 06:05:50,441 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2024-10-17 06:05:50,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 06:05:50,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-17 06:05:50,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:06:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 227 proven. 1735 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-17 06:06:06,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:06:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 234 proven. 1757 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-17 06:06:15,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685875136] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:06:15,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:06:15,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 70, 95] total 241 [2024-10-17 06:06:15,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124615414] [2024-10-17 06:06:15,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:06:15,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 242 states [2024-10-17 06:06:15,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:06:15,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2024-10-17 06:06:15,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12422, Invalid=45900, Unknown=0, NotChecked=0, Total=58322 [2024-10-17 06:06:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:06:15,364 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:06:15,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 242 states, 242 states have (on average 2.731404958677686) internal successors, (661), 241 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:06:15,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:06:15,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:06:15,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 06:06:15,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:06:15,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-17 06:06:15,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:07:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:07:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:07:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 06:07:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:07:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 06:07:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 446 states. [2024-10-17 06:07:27,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-17 06:07:28,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable51,SelfDestructingSolverStorable62,SelfDestructingSolverStorable52,SelfDestructingSolverStorable63,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2024-10-17 06:07:28,014 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 06:07:28,443 INFO L85 PathProgramCache]: Analyzing trace with hash 916806546, now seen corresponding path program 1 times [2024-10-17 06:07:28,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:07:28,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:07:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:07:28,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:07:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:07:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash 740751600, now seen corresponding path program 1 times [2024-10-17 06:07:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:07:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:07:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:07:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 306 proven. 3 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2024-10-17 06:07:29,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:07:29,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:07:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:07:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 306 proven. 3 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2024-10-17 06:07:30,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:07:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash 29873356, now seen corresponding path program 7 times [2024-10-17 06:07:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:07:30,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337812384] [2024-10-17 06:07:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:07:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:07:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:07:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-17 06:07:30,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:07:30,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337812384] [2024-10-17 06:07:30,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337812384] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:07:30,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297409329] [2024-10-17 06:07:30,599 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-17 06:07:30,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:07:30,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:07:30,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:07:30,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-17 06:07:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:07:30,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-17 06:07:30,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:07:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 973 proven. 1 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2024-10-17 06:07:30,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:07:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 907 proven. 394 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-17 06:07:31,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297409329] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:07:31,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:07:31,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 23] total 30 [2024-10-17 06:07:31,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520845667] [2024-10-17 06:07:31,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:07:31,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-17 06:07:31,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:07:31,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-17 06:07:31,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2024-10-17 06:07:31,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:07:31,354 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:07:31,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.833333333333333) internal successors, (145), 30 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:07:31,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:07:31,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:07:31,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 06:07:31,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:07:31,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-17 06:07:31,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 446 states. [2024-10-17 06:07:31,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:07:33,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:07:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:07:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 06:07:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:07:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 06:07:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 450 states. [2024-10-17 06:07:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-17 06:07:33,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-17 06:07:33,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67 [2024-10-17 06:07:33,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-17 06:07:34,087 INFO L85 PathProgramCache]: Analyzing trace with hash 916806574, now seen corresponding path program 1 times [2024-10-17 06:07:34,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:07:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:07:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:07:34,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:07:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:07:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1814554615, now seen corresponding path program 1 times [2024-10-17 06:07:34,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:07:34,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:07:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:07:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 123 proven. 772 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-17 06:07:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:07:41,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:07:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:07:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 123 proven. 772 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-17 06:07:46,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2049167267, now seen corresponding path program 1 times [2024-10-17 06:07:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:07:46,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:07:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:07:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 138 proven. 814 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-17 06:07:57,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:07:57,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:07:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:08:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 138 proven. 814 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-17 06:08:03,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:08:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1221599718, now seen corresponding path program 8 times [2024-10-17 06:08:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:08:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093503562] [2024-10-17 06:08:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:08:03,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:08:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:08:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 308 proven. 611 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-17 06:08:10,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:08:10,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093503562] [2024-10-17 06:08:10,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093503562] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:08:10,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054545965] [2024-10-17 06:08:10,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 06:08:10,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:08:10,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:08:10,909 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:08:10,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-17 06:08:11,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 06:08:11,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 06:08:11,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-17 06:08:11,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:08:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 230 proven. 684 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-17 06:08:19,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:13:00,046 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse5 (< 36 c_~n2~0)) (.cse0 (* 36 c_~p1~0)) (.cse2 (* (- 36) c_~p1~0)) (.cse51 (< c_~n2~0 39)) (.cse20 (* c_~p1~0 (- 39))) (.cse19 (* 39 c_~p1~0)) (.cse21 (< 39 c_~n2~0)) (.cse22 (* (- 40) c_~p1~0)) (.cse23 (* 40 c_~p1~0)) (.cse26 (< 40 c_~n2~0)) (.cse28 (< c_~n2~0 43)) (.cse29 (* c_~p1~0 (- 43))) (.cse30 (* c_~p1~0 43)) (.cse33 (< 43 c_~n2~0)) (.cse34 (* 44 c_~p1~0)) (.cse35 (* (- 44) c_~p1~0)) (.cse38 (= c_~n2~0 43)) (.cse44 (= 42 c_~n2~0)) (.cse45 (* 41 c_~p1~0)) (.cse46 (* (- 41) c_~p1~0)) (.cse41 (* 42 c_~p1~0)) (.cse42 (* c_~p1~0 (- 42))) (.cse43 (= 41 c_~n2~0)) (.cse49 (< 42 c_~n2~0)) (.cse27 (= 40 c_~n2~0)) (.cse50 (= c_~n2~0 39)) (.cse16 (= c_~n2~0 37)) (.cse14 (* c_~p1~0 38)) (.cse15 (* (- 38) c_~p1~0)) (.cse7 (= c_~n2~0 38)) (.cse11 (* (- 37) c_~p1~0)) (.cse10 (* c_~p1~0 37)) (.cse6 (< 38 c_~n2~0)) (.cse52 (= c_~n2~0 36))) (and (or (let ((.cse1 (* (mod (* 1073741817 c_~p1~0) 1073741824) 4))) (and (or (and (forall ((v_z_82 Int)) (or (= (+ .cse0 .cse1 (* (div (+ c_~p2~0 (* v_z_82 47985151860) .cse2) 4294967296) 4294967296)) (+ (* v_z_82 47985151859) 4294967296 c_~p2~0)) (< (+ .cse1 v_z_82) 4294967296) (< 4294967295 v_z_82))) (forall ((v_z_82 Int)) (or (= (+ (* v_z_82 47985151859) c_~p2~0) (+ .cse0 .cse1 (* (div (+ c_~p2~0 (* v_z_82 47985151860) .cse2) 4294967296) 4294967296))) (< 4294967295 (+ .cse1 v_z_82)) (< v_z_82 0))) (forall ((v_z_82 Int)) (let ((.cse4 (* v_z_82 47985151859)) (.cse3 (+ .cse0 .cse1 (* (div (+ c_~p2~0 (* v_z_82 47985151860) .cse2) 4294967296) 4294967296)))) (or (= .cse3 (+ .cse4 4294967296 c_~p2~0)) (= (+ .cse4 c_~p2~0) .cse3) (< 4294967295 v_z_82) (< v_z_82 0))))) .cse5) (or (and (or .cse6 (and (or .cse7 (and (forall ((v_z_80 Int)) (let ((.cse8 (+ .cse1 .cse10 (* (div (+ (* v_z_80 49318072745) .cse11 c_~p2~0) 4294967296) 4294967296))) (.cse9 (* v_z_80 49318072744))) (or (< 4294967295 v_z_80) (< v_z_80 0) (= .cse8 (+ 4294967296 c_~p2~0 .cse9)) (= .cse8 (+ c_~p2~0 .cse9))))) (forall ((v_z_80 Int)) (or (< 4294967295 v_z_80) (< (+ .cse1 v_z_80) 4294967296) (= (+ .cse1 .cse10 (* (div (+ (* v_z_80 49318072745) .cse11 c_~p2~0) 4294967296) 4294967296)) (+ 4294967296 c_~p2~0 (* v_z_80 49318072744))))) (forall ((v_z_80 Int)) (or (< v_z_80 0) (< 4294967295 (+ .cse1 v_z_80)) (= (+ .cse1 .cse10 (* (div (+ (* v_z_80 49318072745) .cse11 c_~p2~0) 4294967296) 4294967296)) (+ c_~p2~0 (* v_z_80 49318072744))))))) (or (and (forall ((v_z_81 Int)) (let ((.cse12 (+ .cse14 (* (div (+ (* 50650993630 v_z_81) .cse15 c_~p2~0) 4294967296) 4294967296) .cse1)) (.cse13 (* v_z_81 50650993629))) (or (= .cse12 (+ .cse13 4294967296 c_~p2~0)) (< v_z_81 0) (< 4294967295 v_z_81) (= .cse12 (+ .cse13 c_~p2~0))))) (forall ((v_z_81 Int)) (or (< (+ .cse1 v_z_81) 4294967296) (= (+ .cse14 (* (div (+ (* 50650993630 v_z_81) .cse15 c_~p2~0) 4294967296) 4294967296) .cse1) (+ (* v_z_81 50650993629) 4294967296 c_~p2~0)) (< 4294967295 v_z_81))) (forall ((v_z_81 Int)) (or (< 4294967295 (+ .cse1 v_z_81)) (< v_z_81 0) (= (+ .cse14 (* (div (+ (* 50650993630 v_z_81) .cse15 c_~p2~0) 4294967296) 4294967296) .cse1) (+ (* v_z_81 50650993629) c_~p2~0))))) .cse16))) (or (and (or (and (forall ((v_z_79 Int)) (let ((.cse18 (* v_z_79 51983914514)) (.cse17 (+ .cse1 .cse19 (* (div (+ .cse20 (* 51983914515 v_z_79) c_~p2~0) 4294967296) 4294967296)))) (or (< v_z_79 0) (= .cse17 (+ .cse18 4294967296 c_~p2~0)) (= (+ .cse18 c_~p2~0) .cse17) (< 4294967295 v_z_79)))) (forall ((v_z_79 Int)) (or (= (+ .cse1 .cse19 (* (div (+ .cse20 (* 51983914515 v_z_79) c_~p2~0) 4294967296) 4294967296)) (+ (* v_z_79 51983914514) 4294967296 c_~p2~0)) (< (+ .cse1 v_z_79) 4294967296) (< 4294967295 v_z_79))) (forall ((v_z_79 Int)) (or (< 4294967295 (+ .cse1 v_z_79)) (< v_z_79 0) (= (+ (* v_z_79 51983914514) c_~p2~0) (+ .cse1 .cse19 (* (div (+ .cse20 (* 51983914515 v_z_79) c_~p2~0) 4294967296) 4294967296)))))) .cse21) (or (and (or (and (forall ((v_z_74 Int)) (or (< v_z_74 0) (= (+ (* v_z_74 53316835399) c_~p2~0) (+ .cse1 (* (div (+ (* v_z_74 53316835400) c_~p2~0 .cse22) 4294967296) 4294967296) .cse23)) (< 4294967295 (+ .cse1 v_z_74)))) (forall ((v_z_74 Int)) (let ((.cse25 (+ .cse1 (* (div (+ (* v_z_74 53316835400) c_~p2~0 .cse22) 4294967296) 4294967296) .cse23)) (.cse24 (* v_z_74 53316835399))) (or (< v_z_74 0) (= (+ .cse24 c_~p2~0) .cse25) (= .cse25 (+ .cse24 4294967296 c_~p2~0)) (< 4294967295 v_z_74)))) (forall ((v_z_74 Int)) (or (= (+ .cse1 (* (div (+ (* v_z_74 53316835400) c_~p2~0 .cse22) 4294967296) 4294967296) .cse23) (+ (* v_z_74 53316835399) 4294967296 c_~p2~0)) (< (+ .cse1 v_z_74) 4294967296) (< 4294967295 v_z_74)))) .cse26) (or .cse27 (and (or .cse28 (and (or (and (forall ((v_z_78 Int)) (or (= (+ 4294967296 (* v_z_78 57315598054) c_~p2~0) (+ (* (div (+ .cse29 (* 57315598055 v_z_78) c_~p2~0) 4294967296) 4294967296) .cse1 .cse30)) (< (+ .cse1 v_z_78) 4294967296) (< 4294967295 v_z_78))) (forall ((v_z_78 Int)) (or (< 4294967295 (+ .cse1 v_z_78)) (= (+ (* (div (+ .cse29 (* 57315598055 v_z_78) c_~p2~0) 4294967296) 4294967296) .cse1 .cse30) (+ (* v_z_78 57315598054) c_~p2~0)) (< v_z_78 0))) (forall ((v_z_78 Int)) (let ((.cse32 (+ (* (div (+ .cse29 (* 57315598055 v_z_78) c_~p2~0) 4294967296) 4294967296) .cse1 .cse30)) (.cse31 (* v_z_78 57315598054))) (or (= (+ 4294967296 .cse31 c_~p2~0) .cse32) (= .cse32 (+ .cse31 c_~p2~0)) (< 4294967295 v_z_78) (< v_z_78 0))))) .cse33) (or (and (forall ((v_z_77 Int)) (or (< (+ .cse1 v_z_77) 4294967296) (= (+ .cse1 .cse34 (* 4294967296 (div (+ (* v_z_77 58648518940) .cse35 c_~p2~0) 4294967296))) (+ (* v_z_77 58648518939) 4294967296 c_~p2~0)) (< 4294967295 v_z_77))) (forall ((v_z_77 Int)) (let ((.cse36 (+ .cse1 .cse34 (* 4294967296 (div (+ (* v_z_77 58648518940) .cse35 c_~p2~0) 4294967296)))) (.cse37 (* v_z_77 58648518939))) (or (= .cse36 (+ .cse37 4294967296 c_~p2~0)) (= .cse36 (+ .cse37 c_~p2~0)) (< 4294967295 v_z_77) (< v_z_77 0)))) (forall ((v_z_77 Int)) (or (< 4294967295 (+ .cse1 v_z_77)) (= (+ .cse1 .cse34 (* 4294967296 (div (+ (* v_z_77 58648518940) .cse35 c_~p2~0) 4294967296))) (+ (* v_z_77 58648518939) c_~p2~0)) (< v_z_77 0)))) .cse38))) (or (and (or (and (forall ((v_z_76 Int)) (let ((.cse39 (* 55982677169 v_z_76)) (.cse40 (+ .cse1 .cse41 (* (div (+ (* 55982677170 v_z_76) .cse42 c_~p2~0) 4294967296) 4294967296)))) (or (= (+ .cse39 4294967296 c_~p2~0) .cse40) (< 4294967295 v_z_76) (= (+ .cse39 c_~p2~0) .cse40) (< v_z_76 0)))) (forall ((v_z_76 Int)) (or (= (+ (* 55982677169 v_z_76) c_~p2~0) (+ .cse1 .cse41 (* (div (+ (* 55982677170 v_z_76) .cse42 c_~p2~0) 4294967296) 4294967296))) (< 4294967295 (+ .cse1 v_z_76)) (< v_z_76 0))) (forall ((v_z_76 Int)) (or (= (+ (* 55982677169 v_z_76) 4294967296 c_~p2~0) (+ .cse1 .cse41 (* (div (+ (* 55982677170 v_z_76) .cse42 c_~p2~0) 4294967296) 4294967296))) (< 4294967295 v_z_76) (< (+ .cse1 v_z_76) 4294967296)))) .cse43) (or .cse44 (and (forall ((v_z_75 Int)) (or (< 4294967295 v_z_75) (= (+ .cse45 .cse1 (* (div (+ (* 54649756285 v_z_75) .cse46 c_~p2~0) 4294967296) 4294967296)) (+ (* 54649756284 v_z_75) 4294967296 c_~p2~0)) (< (+ .cse1 v_z_75) 4294967296))) (forall ((v_z_75 Int)) (or (= (+ (* 54649756284 v_z_75) c_~p2~0) (+ .cse45 .cse1 (* (div (+ (* 54649756285 v_z_75) .cse46 c_~p2~0) 4294967296) 4294967296))) (< v_z_75 0) (< 4294967295 (+ .cse1 v_z_75)))) (forall ((v_z_75 Int)) (let ((.cse48 (+ .cse45 .cse1 (* (div (+ (* 54649756285 v_z_75) .cse46 c_~p2~0) 4294967296) 4294967296))) (.cse47 (* 54649756284 v_z_75))) (or (< 4294967295 v_z_75) (= (+ .cse47 c_~p2~0) .cse48) (< v_z_75 0) (= .cse48 (+ .cse47 4294967296 c_~p2~0)))))))) .cse49)))) .cse50)) .cse51)) .cse52))) (not (= 29 c_~n1~0))) (or (let ((.cse55 (* (mod (* 2147483635 c_~p1~0) 2147483648) 2))) (and (or .cse5 (and (forall ((v_z_83 Int)) (let ((.cse53 (+ .cse0 (* (div (+ (* 62992853676 v_z_83) c_~p2~0 .cse2) 4294967296) 4294967296) .cse55)) (.cse54 (* v_z_83 62992853675))) (or (< 4294967295 v_z_83) (= .cse53 (+ .cse54 4294967296 c_~p2~0)) (= .cse53 (+ .cse54 c_~p2~0)) (< v_z_83 0)))) (forall ((v_z_83 Int)) (or (< 4294967295 v_z_83) (= (+ .cse0 (* (div (+ (* 62992853676 v_z_83) c_~p2~0 .cse2) 4294967296) 4294967296) .cse55) (+ (* v_z_83 62992853675) 4294967296 c_~p2~0)) (< (+ v_z_83 .cse55) 4294967296))) (forall ((v_z_83 Int)) (or (< 4294967295 (+ v_z_83 .cse55)) (= (+ .cse0 (* (div (+ (* 62992853676 v_z_83) c_~p2~0 .cse2) 4294967296) 4294967296) .cse55) (+ (* v_z_83 62992853675) c_~p2~0)) (< v_z_83 0))))) (or (and (or .cse51 (and (or (and (forall ((v_z_86 Int)) (or (< v_z_86 0) (< 4294967295 (+ v_z_86 .cse55)) (= (+ (* (div (+ .cse20 (* v_z_86 68242258149) c_~p2~0) 4294967296) 4294967296) .cse19 .cse55) (+ (* 68242258148 v_z_86) c_~p2~0)))) (forall ((v_z_86 Int)) (or (< (+ v_z_86 .cse55) 4294967296) (= (+ (* (div (+ .cse20 (* v_z_86 68242258149) c_~p2~0) 4294967296) 4294967296) .cse19 .cse55) (+ (* 68242258148 v_z_86) 4294967296 c_~p2~0)) (< 4294967295 v_z_86))) (forall ((v_z_86 Int)) (let ((.cse56 (+ (* (div (+ .cse20 (* v_z_86 68242258149) c_~p2~0) 4294967296) 4294967296) .cse19 .cse55)) (.cse57 (* 68242258148 v_z_86))) (or (< v_z_86 0) (= .cse56 (+ .cse57 c_~p2~0)) (= .cse56 (+ .cse57 4294967296 c_~p2~0)) (< 4294967295 v_z_86))))) .cse21) (or (and (or (and (forall ((v_z_87 Int)) (or (= (+ (* (div (+ (* v_z_87 69992059640) c_~p2~0 .cse22) 4294967296) 4294967296) .cse55 .cse23) (+ (* 69992059639 v_z_87) 4294967296 c_~p2~0)) (< (+ v_z_87 .cse55) 4294967296) (< 4294967295 v_z_87))) (forall ((v_z_87 Int)) (or (= (+ (* (div (+ (* v_z_87 69992059640) c_~p2~0 .cse22) 4294967296) 4294967296) .cse55 .cse23) (+ (* 69992059639 v_z_87) c_~p2~0)) (< v_z_87 0) (< 4294967295 (+ v_z_87 .cse55)))) (forall ((v_z_87 Int)) (let ((.cse58 (+ (* (div (+ (* v_z_87 69992059640) c_~p2~0 .cse22) 4294967296) 4294967296) .cse55 .cse23)) (.cse59 (* 69992059639 v_z_87))) (or (= .cse58 (+ .cse59 c_~p2~0)) (= .cse58 (+ .cse59 4294967296 c_~p2~0)) (< v_z_87 0) (< 4294967295 v_z_87))))) .cse26) (or (and (or .cse28 (and (or (and (forall ((v_z_89 Int)) (or (< (+ v_z_89 .cse55) 4294967296) (< 4294967295 v_z_89) (= (+ (* v_z_89 75241464112) 4294967296 c_~p2~0) (+ (* 4294967296 (div (+ .cse29 c_~p2~0 (* v_z_89 75241464113)) 4294967296)) .cse30 .cse55)))) (forall ((v_z_89 Int)) (let ((.cse61 (* v_z_89 75241464112)) (.cse60 (+ (* 4294967296 (div (+ .cse29 c_~p2~0 (* v_z_89 75241464113)) 4294967296)) .cse30 .cse55))) (or (= .cse60 (+ .cse61 c_~p2~0)) (< 4294967295 v_z_89) (< v_z_89 0) (= (+ .cse61 4294967296 c_~p2~0) .cse60)))) (forall ((v_z_89 Int)) (or (= (+ (* 4294967296 (div (+ .cse29 c_~p2~0 (* v_z_89 75241464113)) 4294967296)) .cse30 .cse55) (+ (* v_z_89 75241464112) c_~p2~0)) (< v_z_89 0) (< 4294967295 (+ v_z_89 .cse55))))) .cse33) (or (and (forall ((v_z_88 Int)) (or (< v_z_88 0) (< 4294967295 (+ v_z_88 .cse55)) (= (+ (* v_z_88 76991265603) c_~p2~0) (+ .cse34 (* (div (+ .cse35 (* v_z_88 76991265604) c_~p2~0) 4294967296) 4294967296) .cse55)))) (forall ((v_z_88 Int)) (or (= (+ (* v_z_88 76991265603) 4294967296 c_~p2~0) (+ .cse34 (* (div (+ .cse35 (* v_z_88 76991265604) c_~p2~0) 4294967296) 4294967296) .cse55)) (< (+ v_z_88 .cse55) 4294967296) (< 4294967295 v_z_88))) (forall ((v_z_88 Int)) (let ((.cse62 (* v_z_88 76991265603)) (.cse63 (+ .cse34 (* (div (+ .cse35 (* v_z_88 76991265604) c_~p2~0) 4294967296) 4294967296) .cse55))) (or (< v_z_88 0) (= (+ .cse62 4294967296 c_~p2~0) .cse63) (< 4294967295 v_z_88) (= (+ .cse62 c_~p2~0) .cse63))))) .cse38))) (or (and (or .cse44 (and (forall ((v_z_91 Int)) (or (= (+ (* v_z_91 71741861130) c_~p2~0) (+ .cse45 (* (div (+ (* v_z_91 71741861131) .cse46 c_~p2~0) 4294967296) 4294967296) .cse55)) (< 4294967295 (+ v_z_91 .cse55)) (< v_z_91 0))) (forall ((v_z_91 Int)) (let ((.cse64 (* v_z_91 71741861130)) (.cse65 (+ .cse45 (* (div (+ (* v_z_91 71741861131) .cse46 c_~p2~0) 4294967296) 4294967296) .cse55))) (or (= (+ .cse64 c_~p2~0) .cse65) (= (+ .cse64 4294967296 c_~p2~0) .cse65) (< v_z_91 0) (< 4294967295 v_z_91)))) (forall ((v_z_91 Int)) (or (= (+ (* v_z_91 71741861130) 4294967296 c_~p2~0) (+ .cse45 (* (div (+ (* v_z_91 71741861131) .cse46 c_~p2~0) 4294967296) 4294967296) .cse55)) (< (+ v_z_91 .cse55) 4294967296) (< 4294967295 v_z_91))))) (or (and (forall ((v_z_90 Int)) (or (< v_z_90 0) (= (+ .cse41 (* (div (+ (* 73491662622 v_z_90) .cse42 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_90 73491662621) c_~p2~0)) (< 4294967295 (+ v_z_90 .cse55)))) (forall ((v_z_90 Int)) (let ((.cse67 (* v_z_90 73491662621)) (.cse66 (+ .cse41 (* (div (+ (* 73491662622 v_z_90) .cse42 c_~p2~0) 4294967296) 4294967296) .cse55))) (or (< v_z_90 0) (= .cse66 (+ .cse67 c_~p2~0)) (< 4294967295 v_z_90) (= (+ .cse67 4294967296 c_~p2~0) .cse66)))) (forall ((v_z_90 Int)) (or (< 4294967295 v_z_90) (= (+ (* v_z_90 73491662621) 4294967296 c_~p2~0) (+ .cse41 (* (div (+ (* 73491662622 v_z_90) .cse42 c_~p2~0) 4294967296) 4294967296) .cse55)) (< (+ v_z_90 .cse55) 4294967296)))) .cse43)) .cse49)) .cse27)) .cse50))) (or (and (or .cse16 (and (forall ((v_z_84 Int)) (or (= (+ .cse14 (* (div (+ (* 66492456658 v_z_84) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_84 66492456657) c_~p2~0)) (< v_z_84 0) (< 4294967295 (+ v_z_84 .cse55)))) (forall ((v_z_84 Int)) (or (< 4294967295 v_z_84) (< (+ v_z_84 .cse55) 4294967296) (= (+ .cse14 (* (div (+ (* 66492456658 v_z_84) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55) (+ (* v_z_84 66492456657) 4294967296 c_~p2~0)))) (forall ((v_z_84 Int)) (let ((.cse68 (+ .cse14 (* (div (+ (* 66492456658 v_z_84) .cse15 c_~p2~0) 4294967296) 4294967296) .cse55)) (.cse69 (* v_z_84 66492456657))) (or (< 4294967295 v_z_84) (= .cse68 (+ .cse69 c_~p2~0)) (< v_z_84 0) (= .cse68 (+ .cse69 4294967296 c_~p2~0))))))) (or .cse7 (and (forall ((v_z_85 Int)) (or (< 4294967295 v_z_85) (= (+ (* (div (+ (* v_z_85 64742655167) .cse11 c_~p2~0) 4294967296) 4294967296) .cse10 .cse55) (+ (* v_z_85 64742655166) 4294967296 c_~p2~0)) (< (+ v_z_85 .cse55) 4294967296))) (forall ((v_z_85 Int)) (let ((.cse70 (+ (* (div (+ (* v_z_85 64742655167) .cse11 c_~p2~0) 4294967296) 4294967296) .cse10 .cse55)) (.cse71 (* v_z_85 64742655166))) (or (< 4294967295 v_z_85) (= .cse70 (+ .cse71 4294967296 c_~p2~0)) (< v_z_85 0) (= .cse70 (+ .cse71 c_~p2~0))))) (forall ((v_z_85 Int)) (or (< 4294967295 (+ v_z_85 .cse55)) (< v_z_85 0) (= (+ (* (div (+ (* v_z_85 64742655167) .cse11 c_~p2~0) 4294967296) 4294967296) .cse10 .cse55) (+ (* v_z_85 64742655166) c_~p2~0))))))) .cse6)) .cse52))) (not (= c_~n1~0 27))))) (= (mod c_thread1Thread1of1ForFork1_~cond~0 256) 0) (< c_~n2~0 36)) is different from false [2024-10-17 06:13:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 0 proven. 969 refuted. 4 times theorem prover too weak. 0 trivial. 11 not checked. [2024-10-17 06:13:27,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054545965] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:13:27,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:13:27,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 42, 66] total 164 [2024-10-17 06:13:27,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14767842] [2024-10-17 06:13:27,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:13:27,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 165 states [2024-10-17 06:13:27,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:13:27,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2024-10-17 06:13:27,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4802, Invalid=21926, Unknown=8, NotChecked=324, Total=27060 [2024-10-17 06:13:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:13:27,887 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:13:27,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 165 states, 165 states have (on average 2.7696969696969695) internal successors, (457), 164 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:13:27,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:13:27,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:13:27,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-17 06:13:27,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:13:27,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-17 06:13:27,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 450 states. [2024-10-17 06:13:27,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-17 06:13:27,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15