./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_label48+token_ring.02.cil-1.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_label48+token_ring.02.cil-1.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 abf153d7504404447837d5448d411c139d9bf5ab64e9e6700e63ddfa19d4209f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:25:04,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:25:04,633 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:25:04,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:25:04,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:25:04,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:25:04,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:25:04,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:25:04,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:25:04,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:25:04,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:25:04,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:25:04,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:25:04,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:25:04,662 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:25:04,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:25:04,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:25:04,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:25:04,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:25:04,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:25:04,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:25:04,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:25:04,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:25:04,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:25:04,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:25:04,666 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:25:04,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:25:04,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:25:04,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:25:04,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:25:04,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:25:04,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:25:04,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:25:04,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:25:04,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:25:04,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:25:04,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:25:04,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:25:04,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:25:04,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:25:04,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:25:04,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:25:04,671 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 -> abf153d7504404447837d5448d411c139d9bf5ab64e9e6700e63ddfa19d4209f [2024-10-11 04:25:04,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:25:04,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:25:04,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:25:04,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:25:04,952 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:25:04,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.02.cil-1.c [2024-10-11 04:25:06,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:25:07,084 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:25:07,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.02.cil-1.c [2024-10-11 04:25:07,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/00e18ea80/372007a8a41a4b828e8014643667f030/FLAG9245de1b2 [2024-10-11 04:25:07,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/00e18ea80/372007a8a41a4b828e8014643667f030 [2024-10-11 04:25:07,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:25:07,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:25:07,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:25:07,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:25:07,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:25:07,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:25:07" (1/1) ... [2024-10-11 04:25:07,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706caadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:07, skipping insertion in model container [2024-10-11 04:25:07,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:25:07" (1/1) ... [2024-10-11 04:25:07,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:25:08,928 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_label48+token_ring.02.cil-1.c[375709,375722] [2024-10-11 04:25:08,982 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_label48+token_ring.02.cil-1.c[383339,383352] [2024-10-11 04:25:09,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:25:09,145 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:25:09,896 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_label48+token_ring.02.cil-1.c[375709,375722] [2024-10-11 04:25:09,906 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_label48+token_ring.02.cil-1.c[383339,383352] [2024-10-11 04:25:09,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:25:09,981 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:25:09,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09 WrapperNode [2024-10-11 04:25:09,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:25:09,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:25:09,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:25:09,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:25:09,990 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:25:09" (1/1) ... [2024-10-11 04:25:10,070 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:25:09" (1/1) ... [2024-10-11 04:25:10,555 INFO L138 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12633 [2024-10-11 04:25:10,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:25:10,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:25:10,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:25:10,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:25:10,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09" (1/1) ... [2024-10-11 04:25:10,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09" (1/1) ... [2024-10-11 04:25:10,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09" (1/1) ... [2024-10-11 04:25:10,823 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:25:10,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09" (1/1) ... [2024-10-11 04:25:10,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09" (1/1) ... [2024-10-11 04:25:11,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09" (1/1) ... [2024-10-11 04:25:11,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09" (1/1) ... [2024-10-11 04:25:11,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09" (1/1) ... [2024-10-11 04:25:11,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09" (1/1) ... [2024-10-11 04:25:11,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:25:11,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:25:11,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:25:11,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:25:11,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09" (1/1) ... [2024-10-11 04:25:11,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:25:11,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:25:11,246 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:25:11,248 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:25:11,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:25:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:25:11,295 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:25:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:25:11,295 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:25:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:25:11,295 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:25:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:25:11,295 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:25:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:25:11,296 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:25:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:25:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:25:11,296 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:25:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:25:11,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:25:11,395 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:25:11,398 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:25:18,998 INFO L? ?]: Removed 1695 outVars from TransFormulas that were not future-live. [2024-10-11 04:25:18,998 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:25:19,106 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:25:19,107 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 04:25:19,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:25:19 BoogieIcfgContainer [2024-10-11 04:25:19,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:25:19,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:25:19,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:25:19,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:25:19,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:25:07" (1/3) ... [2024-10-11 04:25:19,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6802f1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:25:19, skipping insertion in model container [2024-10-11 04:25:19,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:25:09" (2/3) ... [2024-10-11 04:25:19,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6802f1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:25:19, skipping insertion in model container [2024-10-11 04:25:19,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:25:19" (3/3) ... [2024-10-11 04:25:19,118 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.02.cil-1.c [2024-10-11 04:25:19,133 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:25:19,133 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:25:19,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:25:19,262 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;@26787424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:25:19,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:25:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 2241 states, 2216 states have (on average 1.8858303249097472) internal successors, (4179), 2219 states have internal predecessors, (4179), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 04:25:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:25:19,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:19,287 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] [2024-10-11 04:25:19,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:19,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:19,294 INFO L85 PathProgramCache]: Analyzing trace with hash -584044612, now seen corresponding path program 1 times [2024-10-11 04:25:19,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:19,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653611025] [2024-10-11 04:25:19,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:19,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:19,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:19,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:19,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:19,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:19,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:19,841 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:25:19,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:19,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653611025] [2024-10-11 04:25:19,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653611025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:19,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:19,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:25:19,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958046951] [2024-10-11 04:25:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:19,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:25:19,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:19,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:25:19,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:25:19,888 INFO L87 Difference]: Start difference. First operand has 2241 states, 2216 states have (on average 1.8858303249097472) internal successors, (4179), 2219 states have internal predecessors, (4179), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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:25:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:20,942 INFO L93 Difference]: Finished difference Result 4643 states and 8686 transitions. [2024-10-11 04:25:20,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:25:20,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2024-10-11 04:25:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:20,977 INFO L225 Difference]: With dead ends: 4643 [2024-10-11 04:25:20,977 INFO L226 Difference]: Without dead ends: 2404 [2024-10-11 04:25:20,988 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:25:20,992 INFO L432 NwaCegarLoop]: 4057 mSDtfsCounter, 4350 mSDsluCounter, 12142 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4359 SdHoareTripleChecker+Valid, 16199 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:20,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4359 Valid, 16199 Invalid, 691 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:25:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-10-11 04:25:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2345. [2024-10-11 04:25:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2303 states have (on average 1.84020842379505) internal successors, (4238), 2306 states have internal predecessors, (4238), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2024-10-11 04:25:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 4295 transitions. [2024-10-11 04:25:21,150 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 4295 transitions. Word has length 61 [2024-10-11 04:25:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:21,150 INFO L471 AbstractCegarLoop]: Abstraction has 2345 states and 4295 transitions. [2024-10-11 04:25:21,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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:25:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 4295 transitions. [2024-10-11 04:25:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:25:21,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:21,154 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] [2024-10-11 04:25:21,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:25:21,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:21,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1424404092, now seen corresponding path program 1 times [2024-10-11 04:25:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:21,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103309341] [2024-10-11 04:25:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:21,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:21,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:21,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:21,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:21,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:21,354 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:25:21,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:21,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103309341] [2024-10-11 04:25:21,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103309341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:21,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:21,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:21,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471686898] [2024-10-11 04:25:21,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:21,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:21,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:21,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:21,359 INFO L87 Difference]: Start difference. First operand 2345 states and 4295 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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:25:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:22,431 INFO L93 Difference]: Finished difference Result 2757 states and 4924 transitions. [2024-10-11 04:25:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:25:22,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2024-10-11 04:25:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:22,445 INFO L225 Difference]: With dead ends: 2757 [2024-10-11 04:25:22,445 INFO L226 Difference]: Without dead ends: 2541 [2024-10-11 04:25:22,448 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:25:22,449 INFO L432 NwaCegarLoop]: 4121 mSDtfsCounter, 4342 mSDsluCounter, 16314 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4351 SdHoareTripleChecker+Valid, 20435 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:22,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4351 Valid, 20435 Invalid, 1048 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:25:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2024-10-11 04:25:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 2446. [2024-10-11 04:25:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2386 states have (on average 1.8281642917015926) internal successors, (4362), 2390 states have internal predecessors, (4362), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-10-11 04:25:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4443 transitions. [2024-10-11 04:25:22,523 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4443 transitions. Word has length 61 [2024-10-11 04:25:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:22,524 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 4443 transitions. [2024-10-11 04:25:22,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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:25:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4443 transitions. [2024-10-11 04:25:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:25:22,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:22,527 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] [2024-10-11 04:25:22,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:25:22,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:22,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:22,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1408885374, now seen corresponding path program 1 times [2024-10-11 04:25:22,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:22,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142646386] [2024-10-11 04:25:22,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:22,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:22,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:22,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:22,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:22,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:22,827 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:25:22,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:22,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142646386] [2024-10-11 04:25:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142646386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:22,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:22,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:22,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736690129] [2024-10-11 04:25:22,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:22,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:22,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:22,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:22,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:22,830 INFO L87 Difference]: Start difference. First operand 2446 states and 4443 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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:25:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:23,763 INFO L93 Difference]: Finished difference Result 3115 states and 5460 transitions. [2024-10-11 04:25:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:25:23,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2024-10-11 04:25:23,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:23,780 INFO L225 Difference]: With dead ends: 3115 [2024-10-11 04:25:23,781 INFO L226 Difference]: Without dead ends: 2798 [2024-10-11 04:25:23,784 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:25:23,786 INFO L432 NwaCegarLoop]: 4062 mSDtfsCounter, 4378 mSDsluCounter, 16167 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4387 SdHoareTripleChecker+Valid, 20229 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:23,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4387 Valid, 20229 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:25:23,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2024-10-11 04:25:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2649. [2024-10-11 04:25:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2553 states have (on average 1.8061104582843712) internal successors, (4611), 2559 states have internal predecessors, (4611), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2024-10-11 04:25:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 4744 transitions. [2024-10-11 04:25:23,887 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 4744 transitions. Word has length 61 [2024-10-11 04:25:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:23,887 INFO L471 AbstractCegarLoop]: Abstraction has 2649 states and 4744 transitions. [2024-10-11 04:25:23,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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:25:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 4744 transitions. [2024-10-11 04:25:23,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:25:23,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:23,891 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] [2024-10-11 04:25:23,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:25:23,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:23,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:23,892 INFO L85 PathProgramCache]: Analyzing trace with hash -946919876, now seen corresponding path program 1 times [2024-10-11 04:25:23,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:23,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113396574] [2024-10-11 04:25:23,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:23,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:23,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:23,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:24,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:24,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:24,017 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:25:24,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:24,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113396574] [2024-10-11 04:25:24,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113396574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:24,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:24,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:24,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175783579] [2024-10-11 04:25:24,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:24,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:24,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:24,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:24,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:24,020 INFO L87 Difference]: Start difference. First operand 2649 states and 4744 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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:25:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:25,142 INFO L93 Difference]: Finished difference Result 3887 states and 6619 transitions. [2024-10-11 04:25:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:25:25,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2024-10-11 04:25:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:25,160 INFO L225 Difference]: With dead ends: 3887 [2024-10-11 04:25:25,160 INFO L226 Difference]: Without dead ends: 3367 [2024-10-11 04:25:25,165 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:25:25,166 INFO L432 NwaCegarLoop]: 4116 mSDtfsCounter, 4350 mSDsluCounter, 16306 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4358 SdHoareTripleChecker+Valid, 20422 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:25,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4358 Valid, 20422 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:25:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2024-10-11 04:25:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 3033. [2024-10-11 04:25:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 2869 states have (on average 1.7716974555594285) internal successors, (5083), 2879 states have internal predecessors, (5083), 100 states have call successors, (100), 54 states have call predecessors, (100), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2024-10-11 04:25:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 5318 transitions. [2024-10-11 04:25:25,311 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 5318 transitions. Word has length 61 [2024-10-11 04:25:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:25,312 INFO L471 AbstractCegarLoop]: Abstraction has 3033 states and 5318 transitions. [2024-10-11 04:25:25,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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:25:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 5318 transitions. [2024-10-11 04:25:25,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:25:25,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:25,314 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] [2024-10-11 04:25:25,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:25:25,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:25,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash 981352826, now seen corresponding path program 1 times [2024-10-11 04:25:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:25,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473615272] [2024-10-11 04:25:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:25,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:25,438 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:25:25,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:25,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473615272] [2024-10-11 04:25:25,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473615272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:25,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:25,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:25,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017272517] [2024-10-11 04:25:25,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:25,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:25,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:25,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:25,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:25,445 INFO L87 Difference]: Start difference. First operand 3033 states and 5318 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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:25:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:26,772 INFO L93 Difference]: Finished difference Result 5185 states and 8559 transitions. [2024-10-11 04:25:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:25:26,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 61 [2024-10-11 04:25:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:26,799 INFO L225 Difference]: With dead ends: 5185 [2024-10-11 04:25:26,800 INFO L226 Difference]: Without dead ends: 4281 [2024-10-11 04:25:26,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:25:26,806 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4350 mSDsluCounter, 16309 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4362 SdHoareTripleChecker+Valid, 20426 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:26,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4362 Valid, 20426 Invalid, 999 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:25:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2024-10-11 04:25:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 3818. [2024-10-11 04:25:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3818 states, 3522 states have (on average 1.7208972174900625) internal successors, (6061), 3540 states have internal predecessors, (6061), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2024-10-11 04:25:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 6510 transitions. [2024-10-11 04:25:27,042 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 6510 transitions. Word has length 61 [2024-10-11 04:25:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:27,042 INFO L471 AbstractCegarLoop]: Abstraction has 3818 states and 6510 transitions. [2024-10-11 04:25:27,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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:25:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 6510 transitions. [2024-10-11 04:25:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:25:27,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:27,046 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] [2024-10-11 04:25:27,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:25:27,046 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:27,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1874839164, now seen corresponding path program 1 times [2024-10-11 04:25:27,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:27,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995195836] [2024-10-11 04:25:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:27,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:27,142 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:25:27,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:27,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995195836] [2024-10-11 04:25:27,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995195836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:27,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:25:27,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124280778] [2024-10-11 04:25:27,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:27,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:25:27,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:27,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:25:27,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:25:27,146 INFO L87 Difference]: Start difference. First operand 3818 states and 6510 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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:25:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:28,360 INFO L93 Difference]: Finished difference Result 6913 states and 11211 transitions. [2024-10-11 04:25:28,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:25:28,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 61 [2024-10-11 04:25:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:28,392 INFO L225 Difference]: With dead ends: 6913 [2024-10-11 04:25:28,393 INFO L226 Difference]: Without dead ends: 5225 [2024-10-11 04:25:28,399 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:25:28,400 INFO L432 NwaCegarLoop]: 4142 mSDtfsCounter, 4472 mSDsluCounter, 12167 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4497 SdHoareTripleChecker+Valid, 16309 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:28,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4497 Valid, 16309 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:25:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2024-10-11 04:25:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4690. [2024-10-11 04:25:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4690 states, 4236 states have (on average 1.674929178470255) internal successors, (7095), 4271 states have internal predecessors, (7095), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2024-10-11 04:25:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 7764 transitions. [2024-10-11 04:25:28,620 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 7764 transitions. Word has length 61 [2024-10-11 04:25:28,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:28,620 INFO L471 AbstractCegarLoop]: Abstraction has 4690 states and 7764 transitions. [2024-10-11 04:25:28,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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:25:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 7764 transitions. [2024-10-11 04:25:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 04:25:28,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:28,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:28,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:25:28,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:28,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2042674346, now seen corresponding path program 1 times [2024-10-11 04:25:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:28,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449829697] [2024-10-11 04:25:28,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:28,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:28,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:28,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:28,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:28,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:28,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:25:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:28,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 04:25:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:25:28,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:28,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449829697] [2024-10-11 04:25:28,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449829697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:25:28,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406897292] [2024-10-11 04:25:28,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:28,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:28,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:25:28,783 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:25:28,800 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:25:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:28,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:25:28,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:25:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 04:25:28,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:25:28,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406897292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:28,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:25:28,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:25:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741324724] [2024-10-11 04:25:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:28,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:25:28,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:28,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:25:28,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:28,973 INFO L87 Difference]: Start difference. First operand 4690 states and 7764 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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:25:29,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:29,304 INFO L93 Difference]: Finished difference Result 9693 states and 15244 transitions. [2024-10-11 04:25:29,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:25:29,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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 99 [2024-10-11 04:25:29,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:29,363 INFO L225 Difference]: With dead ends: 9693 [2024-10-11 04:25:29,363 INFO L226 Difference]: Without dead ends: 7133 [2024-10-11 04:25:29,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 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:25:29,376 INFO L432 NwaCegarLoop]: 4114 mSDtfsCounter, 4092 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4092 SdHoareTripleChecker+Valid, 4254 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:29,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4092 Valid, 4254 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:25:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7133 states. [2024-10-11 04:25:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7133 to 7105. [2024-10-11 04:25:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7105 states, 6237 states have (on average 1.6091069424402757) internal successors, (10036), 6305 states have internal predecessors, (10036), 510 states have call successors, (510), 308 states have call predecessors, (510), 356 states have return successors, (745), 507 states have call predecessors, (745), 510 states have call successors, (745) [2024-10-11 04:25:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 11291 transitions. [2024-10-11 04:25:29,913 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 11291 transitions. Word has length 99 [2024-10-11 04:25:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:29,914 INFO L471 AbstractCegarLoop]: Abstraction has 7105 states and 11291 transitions. [2024-10-11 04:25:29,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 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:25:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 11291 transitions. [2024-10-11 04:25:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 04:25:29,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:29,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:29,946 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:25:30,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:30,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:30,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:30,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1877378954, now seen corresponding path program 1 times [2024-10-11 04:25:30,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:30,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110152534] [2024-10-11 04:25:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:25:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 04:25:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:25:30,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:30,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110152534] [2024-10-11 04:25:30,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110152534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:25:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059763033] [2024-10-11 04:25:30,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:30,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:30,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:25:30,242 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:25:30,243 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:25:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:30,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:25:30,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:25:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 04:25:30,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:25:30,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059763033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:25:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:25:30,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893039249] [2024-10-11 04:25:30,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:30,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:25:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:30,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:25:30,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:30,368 INFO L87 Difference]: Start difference. First operand 7105 states and 11291 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:25:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:30,956 INFO L93 Difference]: Finished difference Result 16767 states and 25811 transitions. [2024-10-11 04:25:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:25:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 99 [2024-10-11 04:25:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:31,007 INFO L225 Difference]: With dead ends: 16767 [2024-10-11 04:25:31,007 INFO L226 Difference]: Without dead ends: 11793 [2024-10-11 04:25:31,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 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:25:31,027 INFO L432 NwaCegarLoop]: 4254 mSDtfsCounter, 145 mSDsluCounter, 4113 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 8367 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:31,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 8367 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:25:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2024-10-11 04:25:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 11793. [2024-10-11 04:25:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11793 states, 10112 states have (on average 1.5505340189873418) internal successors, (15679), 10229 states have internal predecessors, (15679), 975 states have call successors, (975), 608 states have call predecessors, (975), 704 states have return successors, (1596), 987 states have call predecessors, (1596), 975 states have call successors, (1596) [2024-10-11 04:25:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11793 states to 11793 states and 18250 transitions. [2024-10-11 04:25:31,640 INFO L78 Accepts]: Start accepts. Automaton has 11793 states and 18250 transitions. Word has length 99 [2024-10-11 04:25:31,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:31,640 INFO L471 AbstractCegarLoop]: Abstraction has 11793 states and 18250 transitions. [2024-10-11 04:25:31,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:25:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 11793 states and 18250 transitions. [2024-10-11 04:25:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 04:25:31,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:31,668 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:25:31,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:25:31,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:31,870 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:31,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1335572908, now seen corresponding path program 1 times [2024-10-11 04:25:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:31,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485609901] [2024-10-11 04:25:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:25:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 04:25:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 04:25:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-11 04:25:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:32,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485609901] [2024-10-11 04:25:32,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485609901] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:25:32,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752476033] [2024-10-11 04:25:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:32,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:32,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:25:32,003 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:25:32,005 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:25:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:32,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:25:32,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:25:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 04:25:32,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:25:32,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752476033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:32,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:25:32,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:25:32,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936782892] [2024-10-11 04:25:32,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:32,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:25:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:32,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:25:32,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:32,337 INFO L87 Difference]: Start difference. First operand 11793 states and 18250 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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:25:33,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:33,665 INFO L93 Difference]: Finished difference Result 30733 states and 46555 transitions. [2024-10-11 04:25:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:25:33,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 127 [2024-10-11 04:25:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:33,771 INFO L225 Difference]: With dead ends: 30733 [2024-10-11 04:25:33,771 INFO L226 Difference]: Without dead ends: 21075 [2024-10-11 04:25:33,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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:25:33,822 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4053 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4053 SdHoareTripleChecker+Valid, 4257 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:33,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4053 Valid, 4257 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:25:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21075 states. [2024-10-11 04:25:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21075 to 20969. [2024-10-11 04:25:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20969 states, 17708 states have (on average 1.5070589564038852) internal successors, (26687), 17939 states have internal predecessors, (26687), 1869 states have call successors, (1869), 1198 states have call predecessors, (1869), 1390 states have return successors, (3038), 1863 states have call predecessors, (3038), 1869 states have call successors, (3038) [2024-10-11 04:25:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 31594 transitions. [2024-10-11 04:25:35,083 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 31594 transitions. Word has length 127 [2024-10-11 04:25:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:35,084 INFO L471 AbstractCegarLoop]: Abstraction has 20969 states and 31594 transitions. [2024-10-11 04:25:35,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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:25:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 31594 transitions. [2024-10-11 04:25:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 04:25:35,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:35,143 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, 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:25:35,161 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:25:35,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:35,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:35,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash 791512030, now seen corresponding path program 1 times [2024-10-11 04:25:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:35,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912143742] [2024-10-11 04:25:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:35,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 04:25:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 04:25:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:25:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 04:25:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:25:35,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:35,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912143742] [2024-10-11 04:25:35,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912143742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:25:35,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651088650] [2024-10-11 04:25:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:35,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:35,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:25:35,463 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:25:35,465 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:25:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:35,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:25:35,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:25:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 04:25:35,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:25:35,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651088650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:35,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:25:35,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:25:35,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840906808] [2024-10-11 04:25:35,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:35,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:25:35,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:35,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:25:35,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:35,640 INFO L87 Difference]: Start difference. First operand 20969 states and 31594 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:25:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:36,732 INFO L93 Difference]: Finished difference Result 33443 states and 50451 transitions. [2024-10-11 04:25:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:25:36,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 143 [2024-10-11 04:25:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:36,815 INFO L225 Difference]: With dead ends: 33443 [2024-10-11 04:25:36,815 INFO L226 Difference]: Without dead ends: 18715 [2024-10-11 04:25:36,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 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:25:36,862 INFO L432 NwaCegarLoop]: 4114 mSDtfsCounter, 4086 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4086 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:36,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4086 Valid, 4142 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:25:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18715 states. [2024-10-11 04:25:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18715 to 14099. [2024-10-11 04:25:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14099 states, 12046 states have (on average 1.4857214012950357) internal successors, (17897), 12167 states have internal predecessors, (17897), 1161 states have call successors, (1161), 794 states have call predecessors, (1161), 890 states have return successors, (1648), 1153 states have call predecessors, (1648), 1161 states have call successors, (1648) [2024-10-11 04:25:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14099 states to 14099 states and 20706 transitions. [2024-10-11 04:25:37,642 INFO L78 Accepts]: Start accepts. Automaton has 14099 states and 20706 transitions. Word has length 143 [2024-10-11 04:25:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:37,643 INFO L471 AbstractCegarLoop]: Abstraction has 14099 states and 20706 transitions. [2024-10-11 04:25:37,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:25:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 14099 states and 20706 transitions. [2024-10-11 04:25:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 04:25:37,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:37,672 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, 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] [2024-10-11 04:25:37,690 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:25:37,872 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,SelfDestructingSolverStorable9 [2024-10-11 04:25:37,873 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:37,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2075302660, now seen corresponding path program 1 times [2024-10-11 04:25:37,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:37,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908290471] [2024-10-11 04:25:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:37,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:37,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:37,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:38,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:38,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 04:25:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:38,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 04:25:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:38,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:25:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:38,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:38,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 04:25:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:25:38,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908290471] [2024-10-11 04:25:38,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908290471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:25:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839171163] [2024-10-11 04:25:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:38,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:38,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:25:38,030 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:25:38,032 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:25:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:38,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 04:25:38,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:25:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 04:25:38,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:25:38,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839171163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:38,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:25:38,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:25:38,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288513875] [2024-10-11 04:25:38,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:38,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:25:38,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:38,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:25:38,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:38,192 INFO L87 Difference]: Start difference. First operand 14099 states and 20706 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 04:25:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:39,121 INFO L93 Difference]: Finished difference Result 23244 states and 33469 transitions. [2024-10-11 04:25:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:25:39,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 143 [2024-10-11 04:25:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:39,186 INFO L225 Difference]: With dead ends: 23244 [2024-10-11 04:25:39,186 INFO L226 Difference]: Without dead ends: 14923 [2024-10-11 04:25:39,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 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:25:39,212 INFO L432 NwaCegarLoop]: 4144 mSDtfsCounter, 4079 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4079 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:39,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4079 Valid, 4289 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:25:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14923 states. [2024-10-11 04:25:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14923 to 14857. [2024-10-11 04:25:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14857 states, 12716 states have (on average 1.4599716892104435) internal successors, (18565), 12837 states have internal predecessors, (18565), 1183 states have call successors, (1183), 860 states have call predecessors, (1183), 956 states have return successors, (1736), 1175 states have call predecessors, (1736), 1183 states have call successors, (1736) [2024-10-11 04:25:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 21484 transitions. [2024-10-11 04:25:40,294 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 21484 transitions. Word has length 143 [2024-10-11 04:25:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:40,295 INFO L471 AbstractCegarLoop]: Abstraction has 14857 states and 21484 transitions. [2024-10-11 04:25:40,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 04:25:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 21484 transitions. [2024-10-11 04:25:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 04:25:40,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:40,330 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, 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:25:40,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 04:25:40,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 04:25:40,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:40,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1556193784, now seen corresponding path program 1 times [2024-10-11 04:25:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:40,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802385531] [2024-10-11 04:25:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:25:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 04:25:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 04:25:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 04:25:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:25:40,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:40,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802385531] [2024-10-11 04:25:40,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802385531] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:25:40,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198252513] [2024-10-11 04:25:40,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:40,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:40,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:25:40,672 INFO L229 MonitoredProcess]: Starting monitored process 7 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:25:40,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 04:25:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:40,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:25:40,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:25:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 04:25:40,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:25:40,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198252513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:40,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:25:40,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:25:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260992984] [2024-10-11 04:25:40,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:40,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:25:40,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:40,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:25:40,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:40,828 INFO L87 Difference]: Start difference. First operand 14857 states and 21484 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:25:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:41,886 INFO L93 Difference]: Finished difference Result 39509 states and 55950 transitions. [2024-10-11 04:25:41,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:25:41,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2024-10-11 04:25:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:42,017 INFO L225 Difference]: With dead ends: 39509 [2024-10-11 04:25:42,017 INFO L226 Difference]: Without dead ends: 26789 [2024-10-11 04:25:42,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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:25:42,063 INFO L432 NwaCegarLoop]: 4252 mSDtfsCounter, 135 mSDsluCounter, 4111 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 8363 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:42,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 8363 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:25:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26789 states. [2024-10-11 04:25:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26789 to 26743. [2024-10-11 04:25:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26743 states, 22644 states have (on average 1.4140169581346052) internal successors, (32019), 22885 states have internal predecessors, (32019), 2245 states have call successors, (2245), 1660 states have call predecessors, (2245), 1852 states have return successors, (3798), 2229 states have call predecessors, (3798), 2245 states have call successors, (3798) [2024-10-11 04:25:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26743 states to 26743 states and 38062 transitions. [2024-10-11 04:25:43,572 INFO L78 Accepts]: Start accepts. Automaton has 26743 states and 38062 transitions. Word has length 144 [2024-10-11 04:25:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:43,572 INFO L471 AbstractCegarLoop]: Abstraction has 26743 states and 38062 transitions. [2024-10-11 04:25:43,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:25:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 26743 states and 38062 transitions. [2024-10-11 04:25:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 04:25:43,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:43,617 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, 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:25:43,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 04:25:43,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 04:25:43,818 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:43,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash 125794537, now seen corresponding path program 1 times [2024-10-11 04:25:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:43,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837289023] [2024-10-11 04:25:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:25:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 04:25:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:25:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 04:25:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:25:43,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:43,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837289023] [2024-10-11 04:25:43,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837289023] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:25:43,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276186386] [2024-10-11 04:25:43,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:43,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:43,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:25:43,962 INFO L229 MonitoredProcess]: Starting monitored process 8 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:25:43,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 04:25:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:44,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:25:44,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:25:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 04:25:44,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:25:44,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276186386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:44,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:25:44,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:25:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441693625] [2024-10-11 04:25:44,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:44,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:25:44,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:44,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:25:44,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:44,168 INFO L87 Difference]: Start difference. First operand 26743 states and 38062 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:25:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:45,441 INFO L93 Difference]: Finished difference Result 52491 states and 75074 transitions. [2024-10-11 04:25:45,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:25:45,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 144 [2024-10-11 04:25:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:45,577 INFO L225 Difference]: With dead ends: 52491 [2024-10-11 04:25:45,578 INFO L226 Difference]: Without dead ends: 27885 [2024-10-11 04:25:45,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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:25:45,650 INFO L432 NwaCegarLoop]: 4108 mSDtfsCounter, 4065 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4065 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:45,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4065 Valid, 4135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:25:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27885 states. [2024-10-11 04:25:47,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27885 to 27841. [2024-10-11 04:25:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27841 states, 23682 states have (on average 1.3691833460011824) internal successors, (32425), 23923 states have internal predecessors, (32425), 2245 states have call successors, (2245), 1720 states have call predecessors, (2245), 1912 states have return successors, (3754), 2229 states have call predecessors, (3754), 2245 states have call successors, (3754) [2024-10-11 04:25:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27841 states to 27841 states and 38424 transitions. [2024-10-11 04:25:47,909 INFO L78 Accepts]: Start accepts. Automaton has 27841 states and 38424 transitions. Word has length 144 [2024-10-11 04:25:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:47,910 INFO L471 AbstractCegarLoop]: Abstraction has 27841 states and 38424 transitions. [2024-10-11 04:25:47,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:25:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 27841 states and 38424 transitions. [2024-10-11 04:25:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 04:25:47,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:47,963 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, 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] [2024-10-11 04:25:47,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 04:25:48,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:48,165 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:48,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash -782339540, now seen corresponding path program 1 times [2024-10-11 04:25:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:48,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501819433] [2024-10-11 04:25:48,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:25:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 04:25:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:25:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 04:25:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-11 04:25:48,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:48,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501819433] [2024-10-11 04:25:48,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501819433] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:25:48,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835443686] [2024-10-11 04:25:48,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:48,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:48,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:25:48,310 INFO L229 MonitoredProcess]: Starting monitored process 9 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:25:48,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 04:25:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:48,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:25:48,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:25:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 04:25:48,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:25:48,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835443686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:48,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:25:48,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:25:48,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473985046] [2024-10-11 04:25:48,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:48,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:25:48,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:48,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:25:48,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:48,464 INFO L87 Difference]: Start difference. First operand 27841 states and 38424 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:25:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:51,334 INFO L93 Difference]: Finished difference Result 75539 states and 103548 transitions. [2024-10-11 04:25:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:25:51,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2024-10-11 04:25:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:51,516 INFO L225 Difference]: With dead ends: 75539 [2024-10-11 04:25:51,516 INFO L226 Difference]: Without dead ends: 49843 [2024-10-11 04:25:51,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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:25:51,571 INFO L432 NwaCegarLoop]: 4247 mSDtfsCounter, 139 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 8354 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:51,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 8354 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:25:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49843 states. [2024-10-11 04:25:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49843 to 49841. [2024-10-11 04:25:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49841 states, 41974 states have (on average 1.333468337542288) internal successors, (55971), 42455 states have internal predecessors, (55971), 4265 states have call successors, (4265), 3216 states have call predecessors, (4265), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2024-10-11 04:25:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49841 states to 49841 states and 68436 transitions. [2024-10-11 04:25:55,100 INFO L78 Accepts]: Start accepts. Automaton has 49841 states and 68436 transitions. Word has length 144 [2024-10-11 04:25:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:55,101 INFO L471 AbstractCegarLoop]: Abstraction has 49841 states and 68436 transitions. [2024-10-11 04:25:55,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:25:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 49841 states and 68436 transitions. [2024-10-11 04:25:55,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 04:25:55,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:55,146 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, 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] [2024-10-11 04:25:55,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 04:25:55,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 04:25:55,346 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:55,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash -873894743, now seen corresponding path program 1 times [2024-10-11 04:25:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:55,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698746457] [2024-10-11 04:25:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:25:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:25:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:25:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:25:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:25:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 04:25:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:25:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 04:25:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-11 04:25:55,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:55,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698746457] [2024-10-11 04:25:55,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698746457] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:25:55,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526182166] [2024-10-11 04:25:55,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:55,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:25:55,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:25:55,481 INFO L229 MonitoredProcess]: Starting monitored process 10 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:25:55,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 04:25:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:55,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 04:25:55,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:25:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 04:25:55,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:25:55,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526182166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:55,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:25:55,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:25:55,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604310168] [2024-10-11 04:25:55,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:55,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:25:55,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:55,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:25:55,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:55,641 INFO L87 Difference]: Start difference. First operand 49841 states and 68436 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 04:25:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:58,446 INFO L93 Difference]: Finished difference Result 87149 states and 119166 transitions. [2024-10-11 04:25:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:25:58,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 145 [2024-10-11 04:25:58,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:58,650 INFO L225 Difference]: With dead ends: 87149 [2024-10-11 04:25:58,651 INFO L226 Difference]: Without dead ends: 51011 [2024-10-11 04:25:58,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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:25:58,731 INFO L432 NwaCegarLoop]: 4134 mSDtfsCounter, 4085 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4085 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:58,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4085 Valid, 4275 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:25:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51011 states.