./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 198234a6cbed333832b896acc347872fc09d4c349ed801953a7aa6331aa2ab3f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:19:19,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:19:19,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:19:19,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:19:19,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:19:19,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:19:19,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:19:19,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:19:19,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:19:19,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:19:19,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:19:19,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:19:19,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:19:19,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:19:19,552 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:19:19,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:19:19,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:19:19,552 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:19:19,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:19:19,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:19:19,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:19:19,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:19:19,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:19:19,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:19:19,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:19:19,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:19:19,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:19:19,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:19:19,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:19:19,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:19:19,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:19:19,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:19:19,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:19:19,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:19:19,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:19:19,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:19:19,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:19:19,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:19:19,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:19:19,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:19:19,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:19:19,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:19:19,562 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-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 -> Automizer 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 -> 198234a6cbed333832b896acc347872fc09d4c349ed801953a7aa6331aa2ab3f [2024-10-11 04:19:19,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:19:19,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:19:19,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:19:19,826 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:19:19,826 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:19:19,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c [2024-10-11 04:19:21,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:19:21,563 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:19:21,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c [2024-10-11 04:19:21,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7d252adcb/9034f4d30921403d9dee5f300c09d984/FLAG6d5f778d8 [2024-10-11 04:19:21,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7d252adcb/9034f4d30921403d9dee5f300c09d984 [2024-10-11 04:19:21,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:19:21,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:19:21,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:19:21,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:19:21,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:19:21,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:19:21" (1/1) ... [2024-10-11 04:19:21,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78af460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:21, skipping insertion in model container [2024-10-11 04:19:21,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:19:21" (1/1) ... [2024-10-11 04:19:21,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:19:23,073 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c[380323,380336] [2024-10-11 04:19:23,094 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c[383339,383352] [2024-10-11 04:19:23,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:19:23,237 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:19:23,841 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c[380323,380336] [2024-10-11 04:19:23,850 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c[383339,383352] [2024-10-11 04:19:23,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:19:23,908 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:19:23,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23 WrapperNode [2024-10-11 04:19:23,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:19:23,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:19:23,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:19:23,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:19:23,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,269 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12693 [2024-10-11 04:19:24,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:19:24,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:19:24,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:19:24,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:19:24,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,406 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:19:24,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:19:24,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:19:24,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:19:24,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:19:24,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (1/1) ... [2024-10-11 04:19:24,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:19:24,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:19:24,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:19:24,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:19:24,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:19:24,916 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:19:24,916 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:19:24,916 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:19:24,916 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:19:24,916 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:19:24,916 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:19:24,916 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:19:24,916 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:19:24,917 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:19:24,917 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:19:24,917 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:19:24,917 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:19:24,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:19:24,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:19:24,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:19:25,055 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:19:25,057 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:19:30,946 INFO L? ?]: Removed 1701 outVars from TransFormulas that were not future-live. [2024-10-11 04:19:30,947 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:19:31,033 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:19:31,033 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-11 04:19:31,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:19:31 BoogieIcfgContainer [2024-10-11 04:19:31,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:19:31,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:19:31,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:19:31,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:19:31,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:19:21" (1/3) ... [2024-10-11 04:19:31,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dacc50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:19:31, skipping insertion in model container [2024-10-11 04:19:31,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:23" (2/3) ... [2024-10-11 04:19:31,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dacc50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:19:31, skipping insertion in model container [2024-10-11 04:19:31,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:19:31" (3/3) ... [2024-10-11 04:19:31,040 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.03.cil-2.c [2024-10-11 04:19:31,053 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:19:31,053 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:19:31,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:19:31,147 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=PETRI_NET, 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;@7ccd276c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:19:31,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:19:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 2264 states, 2238 states have (on average 1.8847184986595173) internal successors, (4218), 2241 states have internal predecessors, (4218), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 04:19:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 04:19:31,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:31,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:31,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:31,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1306743648, now seen corresponding path program 1 times [2024-10-11 04:19:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:31,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143263434] [2024-10-11 04:19:31,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:31,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:31,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:31,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:31,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:31,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:31,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:31,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143263434] [2024-10-11 04:19:31,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143263434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:31,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:31,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:19:31,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354406259] [2024-10-11 04:19:31,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:31,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:19:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:31,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:19:31,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:19:31,606 INFO L87 Difference]: Start difference. First operand has 2264 states, 2238 states have (on average 1.8847184986595173) internal successors, (4218), 2241 states have internal predecessors, (4218), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:32,582 INFO L93 Difference]: Finished difference Result 4732 states and 8845 transitions. [2024-10-11 04:19:32,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:19:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 04:19:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:32,614 INFO L225 Difference]: With dead ends: 4732 [2024-10-11 04:19:32,614 INFO L226 Difference]: Without dead ends: 2471 [2024-10-11 04:19:32,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:32,625 INFO L432 NwaCegarLoop]: 4074 mSDtfsCounter, 4459 mSDsluCounter, 12195 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4469 SdHoareTripleChecker+Valid, 16269 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:32,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4469 Valid, 16269 Invalid, 864 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:19:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2024-10-11 04:19:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2392. [2024-10-11 04:19:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2348 states have (on average 1.8373083475298126) internal successors, (4314), 2351 states have internal predecessors, (4314), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-10-11 04:19:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 4375 transitions. [2024-10-11 04:19:32,743 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 4375 transitions. Word has length 71 [2024-10-11 04:19:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:32,743 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 4375 transitions. [2024-10-11 04:19:32,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 4375 transitions. [2024-10-11 04:19:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 04:19:32,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:32,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:32,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:19:32,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:32,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:32,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2007992036, now seen corresponding path program 1 times [2024-10-11 04:19:32,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:32,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638897148] [2024-10-11 04:19:32,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:32,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:32,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:32,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:32,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:32,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:32,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:32,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638897148] [2024-10-11 04:19:32,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638897148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:32,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:32,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:32,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014876767] [2024-10-11 04:19:32,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:32,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:32,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:32,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:32,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:32,936 INFO L87 Difference]: Start difference. First operand 2392 states and 4375 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:34,033 INFO L93 Difference]: Finished difference Result 2906 states and 5181 transitions. [2024-10-11 04:19:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:34,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 04:19:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:34,044 INFO L225 Difference]: With dead ends: 2906 [2024-10-11 04:19:34,044 INFO L226 Difference]: Without dead ends: 2644 [2024-10-11 04:19:34,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:34,048 INFO L432 NwaCegarLoop]: 4151 mSDtfsCounter, 4453 mSDsluCounter, 16419 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4463 SdHoareTripleChecker+Valid, 20570 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:34,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4463 Valid, 20570 Invalid, 1329 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:19:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2024-10-11 04:19:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2515. [2024-10-11 04:19:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2452 states have (on average 1.8242251223491028) internal successors, (4473), 2456 states have internal predecessors, (4473), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-10-11 04:19:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 4560 transitions. [2024-10-11 04:19:34,129 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 4560 transitions. Word has length 71 [2024-10-11 04:19:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:34,130 INFO L471 AbstractCegarLoop]: Abstraction has 2515 states and 4560 transitions. [2024-10-11 04:19:34,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 4560 transitions. [2024-10-11 04:19:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 04:19:34,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:34,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:34,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:19:34,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:34,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1853246174, now seen corresponding path program 1 times [2024-10-11 04:19:34,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:34,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770647218] [2024-10-11 04:19:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:34,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:34,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:34,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:34,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:34,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:34,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770647218] [2024-10-11 04:19:34,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770647218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:34,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:34,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060714901] [2024-10-11 04:19:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:34,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:34,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:34,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:34,288 INFO L87 Difference]: Start difference. First operand 2515 states and 4560 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:35,462 INFO L93 Difference]: Finished difference Result 3352 states and 5868 transitions. [2024-10-11 04:19:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:35,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 04:19:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:35,476 INFO L225 Difference]: With dead ends: 3352 [2024-10-11 04:19:35,476 INFO L226 Difference]: Without dead ends: 2967 [2024-10-11 04:19:35,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:35,483 INFO L432 NwaCegarLoop]: 4149 mSDtfsCounter, 4451 mSDsluCounter, 16419 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4461 SdHoareTripleChecker+Valid, 20568 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:35,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4461 Valid, 20568 Invalid, 1327 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:19:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2024-10-11 04:19:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2762. [2024-10-11 04:19:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2661 states have (on average 1.8008267568583238) internal successors, (4792), 2667 states have internal predecessors, (4792), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-11 04:19:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4935 transitions. [2024-10-11 04:19:35,591 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4935 transitions. Word has length 71 [2024-10-11 04:19:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:35,591 INFO L471 AbstractCegarLoop]: Abstraction has 2762 states and 4935 transitions. [2024-10-11 04:19:35,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4935 transitions. [2024-10-11 04:19:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 04:19:35,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:35,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:35,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:19:35,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:35,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash -592328924, now seen corresponding path program 1 times [2024-10-11 04:19:35,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:35,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605827841] [2024-10-11 04:19:35,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:35,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:35,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:35,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605827841] [2024-10-11 04:19:35,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605827841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:35,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:35,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:35,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920680098] [2024-10-11 04:19:35,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:35,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:35,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:35,724 INFO L87 Difference]: Start difference. First operand 2762 states and 4935 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:36,305 INFO L93 Difference]: Finished difference Result 3589 states and 6236 transitions. [2024-10-11 04:19:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:36,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 04:19:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:36,316 INFO L225 Difference]: With dead ends: 3589 [2024-10-11 04:19:36,316 INFO L226 Difference]: Without dead ends: 2957 [2024-10-11 04:19:36,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:36,320 INFO L432 NwaCegarLoop]: 4057 mSDtfsCounter, 4387 mSDsluCounter, 12099 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4398 SdHoareTripleChecker+Valid, 16156 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:36,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4398 Valid, 16156 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 04:19:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2024-10-11 04:19:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2762. [2024-10-11 04:19:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2661 states have (on average 1.7989477639984968) internal successors, (4787), 2667 states have internal predecessors, (4787), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-11 04:19:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4930 transitions. [2024-10-11 04:19:36,415 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4930 transitions. Word has length 71 [2024-10-11 04:19:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:36,415 INFO L471 AbstractCegarLoop]: Abstraction has 2762 states and 4930 transitions. [2024-10-11 04:19:36,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4930 transitions. [2024-10-11 04:19:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 04:19:36,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:36,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:36,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:19:36,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:36,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:36,418 INFO L85 PathProgramCache]: Analyzing trace with hash -551654174, now seen corresponding path program 1 times [2024-10-11 04:19:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:36,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007262023] [2024-10-11 04:19:36,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:36,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:36,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007262023] [2024-10-11 04:19:36,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007262023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:36,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:36,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:36,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083646115] [2024-10-11 04:19:36,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:36,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:36,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:36,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:36,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:36,531 INFO L87 Difference]: Start difference. First operand 2762 states and 4930 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:37,732 INFO L93 Difference]: Finished difference Result 4380 states and 7425 transitions. [2024-10-11 04:19:37,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:19:37,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 04:19:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:37,746 INFO L225 Difference]: With dead ends: 4380 [2024-10-11 04:19:37,746 INFO L226 Difference]: Without dead ends: 3748 [2024-10-11 04:19:37,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:19:37,751 INFO L432 NwaCegarLoop]: 4147 mSDtfsCounter, 4558 mSDsluCounter, 16414 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4572 SdHoareTripleChecker+Valid, 20561 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:37,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4572 Valid, 20561 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:19:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2024-10-11 04:19:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3253. [2024-10-11 04:19:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3253 states, 3080 states have (on average 1.7603896103896104) internal successors, (5422), 3090 states have internal predecessors, (5422), 109 states have call successors, (109), 54 states have call predecessors, (109), 62 states have return successors, (144), 116 states have call predecessors, (144), 109 states have call successors, (144) [2024-10-11 04:19:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 5675 transitions. [2024-10-11 04:19:37,852 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 5675 transitions. Word has length 71 [2024-10-11 04:19:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:37,853 INFO L471 AbstractCegarLoop]: Abstraction has 3253 states and 5675 transitions. [2024-10-11 04:19:37,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 5675 transitions. [2024-10-11 04:19:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 04:19:37,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:37,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:37,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:19:37,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:37,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:37,856 INFO L85 PathProgramCache]: Analyzing trace with hash 835131236, now seen corresponding path program 1 times [2024-10-11 04:19:37,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:37,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120928813] [2024-10-11 04:19:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:37,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:37,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:37,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:37,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:37,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:37,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:37,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120928813] [2024-10-11 04:19:37,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120928813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:37,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:37,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:37,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608775146] [2024-10-11 04:19:37,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:37,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:37,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:37,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:37,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:37,982 INFO L87 Difference]: Start difference. First operand 3253 states and 5675 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:39,078 INFO L93 Difference]: Finished difference Result 6161 states and 10154 transitions. [2024-10-11 04:19:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:19:39,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 04:19:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:39,096 INFO L225 Difference]: With dead ends: 6161 [2024-10-11 04:19:39,097 INFO L226 Difference]: Without dead ends: 5038 [2024-10-11 04:19:39,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:19:39,103 INFO L432 NwaCegarLoop]: 4146 mSDtfsCounter, 4460 mSDsluCounter, 16411 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4469 SdHoareTripleChecker+Valid, 20557 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:39,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4469 Valid, 20557 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:19:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5038 states. [2024-10-11 04:19:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5038 to 4191. [2024-10-11 04:19:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4191 states, 3878 states have (on average 1.709128416709644) internal successors, (6628), 3896 states have internal predecessors, (6628), 193 states have call successors, (193), 102 states have call predecessors, (193), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2024-10-11 04:19:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 7111 transitions. [2024-10-11 04:19:39,252 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 7111 transitions. Word has length 71 [2024-10-11 04:19:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:39,253 INFO L471 AbstractCegarLoop]: Abstraction has 4191 states and 7111 transitions. [2024-10-11 04:19:39,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 7111 transitions. [2024-10-11 04:19:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 04:19:39,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:39,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:39,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:19:39,255 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:39,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1711150242, now seen corresponding path program 1 times [2024-10-11 04:19:39,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:39,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223254936] [2024-10-11 04:19:39,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:39,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:39,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223254936] [2024-10-11 04:19:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223254936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:39,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:39,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:39,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729486437] [2024-10-11 04:19:39,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:39,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:39,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:39,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:39,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:39,379 INFO L87 Difference]: Start difference. First operand 4191 states and 7111 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:40,481 INFO L93 Difference]: Finished difference Result 9281 states and 14962 transitions. [2024-10-11 04:19:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:19:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 04:19:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:40,514 INFO L225 Difference]: With dead ends: 9281 [2024-10-11 04:19:40,518 INFO L226 Difference]: Without dead ends: 7220 [2024-10-11 04:19:40,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:19:40,535 INFO L432 NwaCegarLoop]: 4147 mSDtfsCounter, 4448 mSDsluCounter, 16414 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4462 SdHoareTripleChecker+Valid, 20561 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:40,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4462 Valid, 20561 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:19:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2024-10-11 04:19:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 6122. [2024-10-11 04:19:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6122 states, 5537 states have (on average 1.6525194148455842) internal successors, (9150), 5571 states have internal predecessors, (9150), 353 states have call successors, (353), 198 states have call predecessors, (353), 230 states have return successors, (628), 384 states have call predecessors, (628), 353 states have call successors, (628) [2024-10-11 04:19:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6122 states to 6122 states and 10131 transitions. [2024-10-11 04:19:40,824 INFO L78 Accepts]: Start accepts. Automaton has 6122 states and 10131 transitions. Word has length 71 [2024-10-11 04:19:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:40,824 INFO L471 AbstractCegarLoop]: Abstraction has 6122 states and 10131 transitions. [2024-10-11 04:19:40,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6122 states and 10131 transitions. [2024-10-11 04:19:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 04:19:40,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:40,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:40,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:19:40,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:40,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1045477024, now seen corresponding path program 1 times [2024-10-11 04:19:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:40,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119710292] [2024-10-11 04:19:40,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:40,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:40,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:40,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:40,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:19:40,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:40,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119710292] [2024-10-11 04:19:40,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119710292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:40,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:40,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:19:40,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070892304] [2024-10-11 04:19:40,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:40,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:19:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:40,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:19:40,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:19:40,914 INFO L87 Difference]: Start difference. First operand 6122 states and 10131 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:41,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:41,950 INFO L93 Difference]: Finished difference Result 13461 states and 21515 transitions. [2024-10-11 04:19:41,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:19:41,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-11 04:19:41,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:41,982 INFO L225 Difference]: With dead ends: 13461 [2024-10-11 04:19:41,982 INFO L226 Difference]: Without dead ends: 9470 [2024-10-11 04:19:41,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:19:41,996 INFO L432 NwaCegarLoop]: 4178 mSDtfsCounter, 4606 mSDsluCounter, 12239 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4633 SdHoareTripleChecker+Valid, 16417 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:41,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4633 Valid, 16417 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:19:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9470 states. [2024-10-11 04:19:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9470 to 8136. [2024-10-11 04:19:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8136 states, 7244 states have (on average 1.6114025400331309) internal successors, (11673), 7311 states have internal predecessors, (11673), 542 states have call successors, (542), 300 states have call predecessors, (542), 348 states have return successors, (899), 556 states have call predecessors, (899), 542 states have call successors, (899) [2024-10-11 04:19:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8136 states to 8136 states and 13114 transitions. [2024-10-11 04:19:42,397 INFO L78 Accepts]: Start accepts. Automaton has 8136 states and 13114 transitions. Word has length 71 [2024-10-11 04:19:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:42,398 INFO L471 AbstractCegarLoop]: Abstraction has 8136 states and 13114 transitions. [2024-10-11 04:19:42,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:19:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8136 states and 13114 transitions. [2024-10-11 04:19:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:19:42,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:42,412 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:42,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:19:42,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:42,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash 998027817, now seen corresponding path program 1 times [2024-10-11 04:19:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:42,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988271399] [2024-10-11 04:19:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:19:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:19:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:19:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:19:42,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:42,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988271399] [2024-10-11 04:19:42,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988271399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:19:42,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646125442] [2024-10-11 04:19:42,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:42,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:19:42,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:19:42,530 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:19:42,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:19:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:42,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:19:42,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:19:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 04:19:42,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:19:42,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646125442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:42,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:19:42,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:19:42,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52226106] [2024-10-11 04:19:42,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:42,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:19:42,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:42,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:19:42,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:42,699 INFO L87 Difference]: Start difference. First operand 8136 states and 13114 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:19:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:43,271 INFO L93 Difference]: Finished difference Result 19993 states and 31344 transitions. [2024-10-11 04:19:43,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:19:43,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2024-10-11 04:19:43,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:43,314 INFO L225 Difference]: With dead ends: 19993 [2024-10-11 04:19:43,314 INFO L226 Difference]: Without dead ends: 13988 [2024-10-11 04:19:43,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:43,331 INFO L432 NwaCegarLoop]: 4149 mSDtfsCounter, 4122 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4122 SdHoareTripleChecker+Valid, 4322 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:43,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4122 Valid, 4322 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:19:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13988 states. [2024-10-11 04:19:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13988 to 13936. [2024-10-11 04:19:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13936 states, 12184 states have (on average 1.5635259356533158) internal successors, (19050), 12316 states have internal predecessors, (19050), 1054 states have call successors, (1054), 600 states have call predecessors, (1054), 696 states have return successors, (1737), 1051 states have call predecessors, (1737), 1054 states have call successors, (1737) [2024-10-11 04:19:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13936 states to 13936 states and 21841 transitions. [2024-10-11 04:19:44,152 INFO L78 Accepts]: Start accepts. Automaton has 13936 states and 21841 transitions. Word has length 115 [2024-10-11 04:19:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:44,153 INFO L471 AbstractCegarLoop]: Abstraction has 13936 states and 21841 transitions. [2024-10-11 04:19:44,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:19:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 13936 states and 21841 transitions. [2024-10-11 04:19:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:19:44,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:44,171 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:44,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:19:44,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:19:44,376 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:44,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:44,377 INFO L85 PathProgramCache]: Analyzing trace with hash 768706663, now seen corresponding path program 1 times [2024-10-11 04:19:44,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:44,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814760089] [2024-10-11 04:19:44,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:44,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:44,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:44,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:44,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:44,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:44,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:44,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:19:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:44,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:19:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:44,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:19:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:19:44,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:44,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814760089] [2024-10-11 04:19:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814760089] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:19:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27543544] [2024-10-11 04:19:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:44,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:19:44,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:19:44,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:19:44,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:19:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:44,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:19:44,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:19:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 04:19:44,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:19:44,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27543544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:44,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:19:44,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:19:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711679745] [2024-10-11 04:19:44,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:44,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:19:44,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:44,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:19:44,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:44,609 INFO L87 Difference]: Start difference. First operand 13936 states and 21841 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:19:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:45,597 INFO L93 Difference]: Finished difference Result 37241 states and 57483 transitions. [2024-10-11 04:19:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:19:45,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2024-10-11 04:19:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:45,695 INFO L225 Difference]: With dead ends: 37241 [2024-10-11 04:19:45,695 INFO L226 Difference]: Without dead ends: 25436 [2024-10-11 04:19:45,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:45,735 INFO L432 NwaCegarLoop]: 4149 mSDtfsCounter, 4127 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4127 SdHoareTripleChecker+Valid, 4322 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:45,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4127 Valid, 4322 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:19:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25436 states. [2024-10-11 04:19:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25436 to 25334. [2024-10-11 04:19:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25334 states, 21888 states have (on average 1.5295138888888888) internal successors, (33478), 22150 states have internal predecessors, (33478), 2052 states have call successors, (2052), 1200 states have call predecessors, (2052), 1392 states have return successors, (3387), 2015 states have call predecessors, (3387), 2052 states have call successors, (3387) [2024-10-11 04:19:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25334 states to 25334 states and 38917 transitions. [2024-10-11 04:19:46,947 INFO L78 Accepts]: Start accepts. Automaton has 25334 states and 38917 transitions. Word has length 115 [2024-10-11 04:19:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:46,947 INFO L471 AbstractCegarLoop]: Abstraction has 25334 states and 38917 transitions. [2024-10-11 04:19:46,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:19:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 25334 states and 38917 transitions. [2024-10-11 04:19:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 04:19:46,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:46,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:46,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 04:19:47,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:19:47,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:47,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash 652142825, now seen corresponding path program 1 times [2024-10-11 04:19:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669849192] [2024-10-11 04:19:47,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:47,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:47,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:47,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:47,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:47,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:19:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:47,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:19:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:47,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:19:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:19:47,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:47,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669849192] [2024-10-11 04:19:47,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669849192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:19:47,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213348017] [2024-10-11 04:19:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:47,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:19:47,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:19:47,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:19:47,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:19:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:47,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:19:47,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:19:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 04:19:47,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:19:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213348017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:47,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:19:47,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:19:47,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577597664] [2024-10-11 04:19:47,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:47,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:19:47,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:47,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:19:47,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:47,406 INFO L87 Difference]: Start difference. First operand 25334 states and 38917 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:19:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:49,797 INFO L93 Difference]: Finished difference Result 70731 states and 108607 transitions. [2024-10-11 04:19:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:19:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2024-10-11 04:19:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:49,970 INFO L225 Difference]: With dead ends: 70731 [2024-10-11 04:19:49,970 INFO L226 Difference]: Without dead ends: 47529 [2024-10-11 04:19:50,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:50,034 INFO L432 NwaCegarLoop]: 4325 mSDtfsCounter, 182 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 8474 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:50,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 8474 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:19:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47529 states. [2024-10-11 04:19:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47529 to 47529. [2024-10-11 04:19:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47529 states, 40776 states have (on average 1.5053217578968021) internal successors, (61381), 41231 states have internal predecessors, (61381), 3967 states have call successors, (3967), 2400 states have call predecessors, (3967), 2784 states have return successors, (7350), 3961 states have call predecessors, (7350), 3967 states have call successors, (7350) [2024-10-11 04:19:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47529 states to 47529 states and 72698 transitions. [2024-10-11 04:19:52,433 INFO L78 Accepts]: Start accepts. Automaton has 47529 states and 72698 transitions. Word has length 115 [2024-10-11 04:19:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:52,435 INFO L471 AbstractCegarLoop]: Abstraction has 47529 states and 72698 transitions. [2024-10-11 04:19:52,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:19:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 47529 states and 72698 transitions. [2024-10-11 04:19:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 04:19:52,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:52,775 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:19:52,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 04:19:52,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:19:52,980 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:52,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1486089404, now seen corresponding path program 1 times [2024-10-11 04:19:52,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:52,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413538784] [2024-10-11 04:19:52,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:52,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:19:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:19:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:19:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:19:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:19:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:19:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:19:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:19:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 04:19:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 04:19:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413538784] [2024-10-11 04:19:53,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413538784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:19:53,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115378964] [2024-10-11 04:19:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:53,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:19:53,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:19:53,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:19:53,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:19:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:53,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:19:53,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:19:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 04:19:53,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:19:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115378964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:53,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:19:53,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:19:53,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370872678] [2024-10-11 04:19:53,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:53,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:19:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:19:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:53,319 INFO L87 Difference]: Start difference. First operand 47529 states and 72698 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:19:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:57,837 INFO L93 Difference]: Finished difference Result 136273 states and 208325 transitions. [2024-10-11 04:19:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:19:57,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 148 [2024-10-11 04:19:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:58,230 INFO L225 Difference]: With dead ends: 136273 [2024-10-11 04:19:58,231 INFO L226 Difference]: Without dead ends: 90881 [2024-10-11 04:19:58,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:58,330 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4081 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 4331 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:58,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4081 Valid, 4331 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:19:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90881 states. [2024-10-11 04:20:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90881 to 90479. [2024-10-11 04:20:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90479 states, 77674 states have (on average 1.4913484563689265) internal successors, (115839), 78581 states have internal predecessors, (115839), 7381 states have call successors, (7381), 4654 states have call predecessors, (7381), 5422 states have return successors, (13774), 7307 states have call predecessors, (13774), 7381 states have call successors, (13774) [2024-10-11 04:20:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90479 states to 90479 states and 136994 transitions. [2024-10-11 04:20:03,946 INFO L78 Accepts]: Start accepts. Automaton has 90479 states and 136994 transitions. Word has length 148 [2024-10-11 04:20:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:03,947 INFO L471 AbstractCegarLoop]: Abstraction has 90479 states and 136994 transitions. [2024-10-11 04:20:03,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:20:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 90479 states and 136994 transitions. [2024-10-11 04:20:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 04:20:04,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:04,144 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:04,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 04:20:04,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 04:20:04,346 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:04,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:04,346 INFO L85 PathProgramCache]: Analyzing trace with hash -915408283, now seen corresponding path program 1 times [2024-10-11 04:20:04,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:04,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419640895] [2024-10-11 04:20:04,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:04,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:20:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:20:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:20:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:20:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 04:20:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 04:20:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:20:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 04:20:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:20:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 04:20:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 04:20:04,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:04,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419640895] [2024-10-11 04:20:04,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419640895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:20:04,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556866668] [2024-10-11 04:20:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:04,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:20:04,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:20:04,678 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:20:04,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:20:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:04,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:20:04,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:20:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 04:20:04,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:20:04,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556866668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:04,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:20:04,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:20:04,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075033477] [2024-10-11 04:20:04,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:04,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:20:04,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:04,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:20:04,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:04,869 INFO L87 Difference]: Start difference. First operand 90479 states and 136994 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:20:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:08,890 INFO L93 Difference]: Finished difference Result 137875 states and 209245 transitions. [2024-10-11 04:20:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:20:08,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 165 [2024-10-11 04:20:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:09,380 INFO L225 Difference]: With dead ends: 137875 [2024-10-11 04:20:09,380 INFO L226 Difference]: Without dead ends: 76999 [2024-10-11 04:20:09,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:09,494 INFO L432 NwaCegarLoop]: 4146 mSDtfsCounter, 4101 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4101 SdHoareTripleChecker+Valid, 4182 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:09,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4101 Valid, 4182 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:20:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76999 states.