./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_label46+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 23a748a14ab5667159adb09776d3545981eaa20034460211a51a13329e4251e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:02:57,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:02:57,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:02:57,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:02:57,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:02:57,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:02:57,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:02:57,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:02:57,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:02:57,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:02:57,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:02:57,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:02:57,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:02:57,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:02:57,926 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:02:57,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:02:57,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:02:57,927 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:02:57,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:02:57,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:02:57,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:02:57,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:02:57,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:02:57,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:02:57,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:02:57,930 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:02:57,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:02:57,930 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:02:57,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:02:57,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:02:57,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:02:57,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:02:57,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:02:57,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:02:57,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:02:57,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:02:57,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:02:57,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:02:57,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:02:57,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:02:57,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:02:57,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:02:57,934 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/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/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 -> 23a748a14ab5667159adb09776d3545981eaa20034460211a51a13329e4251e4 [2024-10-12 21:02:58,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:02:58,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:02:58,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:02:58,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:02:58,254 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:02:58,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-1.c [2024-10-12 21:02:59,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:03:00,165 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:03:00,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-1.c [2024-10-12 21:03:00,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407a497e9/a97059f75a3343eba356c5c07bf5df00/FLAG742f67574 [2024-10-12 21:03:00,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/407a497e9/a97059f75a3343eba356c5c07bf5df00 [2024-10-12 21:03:00,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:03:00,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:03:00,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:03:00,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:03:00,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:03:00,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:03:00" (1/1) ... [2024-10-12 21:03:00,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e00fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:00, skipping insertion in model container [2024-10-12 21:03:00,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:03:00" (1/1) ... [2024-10-12 21:03:00,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:03:02,553 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_label46+token_ring.07.cil-1.c[382357,382370] [2024-10-12 21:03:02,580 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_label46+token_ring.07.cil-1.c[383339,383352] [2024-10-12 21:03:02,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:03:02,779 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:03:03,583 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_label46+token_ring.07.cil-1.c[382357,382370] [2024-10-12 21:03:03,586 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_label46+token_ring.07.cil-1.c[383339,383352] [2024-10-12 21:03:03,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:03:03,661 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:03:03,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03 WrapperNode [2024-10-12 21:03:03,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:03:03,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:03:03,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:03:03,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:03:03,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:03,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:04,147 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12933 [2024-10-12 21:03:04,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:03:04,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:03:04,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:03:04,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:03:04,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:04,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:04,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:04,317 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-12 21:03:04,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:04,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:04,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:04,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:04,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:04,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:04,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:03:04,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:03:04,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:03:04,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:03:04,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (1/1) ... [2024-10-12 21:03:04,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:03:05,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:03:05,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:03:05,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:03:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 21:03:05,149 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 21:03:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:03:05,150 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:03:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 21:03:05,151 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 21:03:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 21:03:05,151 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 21:03:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 21:03:05,151 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 21:03:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 21:03:05,151 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 21:03:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:03:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:03:05,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:03:05,281 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:03:05,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:03:12,695 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2024-10-12 21:03:12,695 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:03:12,810 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:03:12,810 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-12 21:03:12,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:03:12 BoogieIcfgContainer [2024-10-12 21:03:12,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:03:12,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:03:12,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:03:12,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:03:12,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:03:00" (1/3) ... [2024-10-12 21:03:12,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5da1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:03:12, skipping insertion in model container [2024-10-12 21:03:12,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:03" (2/3) ... [2024-10-12 21:03:12,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5da1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:03:12, skipping insertion in model container [2024-10-12 21:03:12,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:03:12" (3/3) ... [2024-10-12 21:03:12,821 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.07.cil-1.c [2024-10-12 21:03:12,838 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:03:12,838 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:03:12,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:03:12,981 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;@38efa62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:03:12,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:03:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 2356 states, 2326 states have (on average 1.880481513327601) internal successors, (4374), 2329 states have internal predecessors, (4374), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-12 21:03:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:13,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:13,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:13,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:13,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:13,017 INFO L85 PathProgramCache]: Analyzing trace with hash 927840180, now seen corresponding path program 1 times [2024-10-12 21:03:13,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448432538] [2024-10-12 21:03:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:13,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:13,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:13,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:13,564 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-12 21:03:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:13,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448432538] [2024-10-12 21:03:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448432538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:13,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:13,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:03:13,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216062150] [2024-10-12 21:03:13,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:13,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:03:13,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:13,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:03:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:03:13,610 INFO L87 Difference]: Start difference. First operand has 2356 states, 2326 states have (on average 1.880481513327601) internal successors, (4374), 2329 states have internal predecessors, (4374), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:15,042 INFO L93 Difference]: Finished difference Result 4782 states and 8954 transitions. [2024-10-12 21:03:15,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:03:15,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-12 21:03:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:15,073 INFO L225 Difference]: With dead ends: 4782 [2024-10-12 21:03:15,073 INFO L226 Difference]: Without dead ends: 2432 [2024-10-12 21:03:15,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:03:15,093 INFO L432 NwaCegarLoop]: 4162 mSDtfsCounter, 618 mSDsluCounter, 12094 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 16256 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:15,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 16256 Invalid, 726 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:03:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2024-10-12 21:03:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2352. [2024-10-12 21:03:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2323 states have (on average 1.8441670253981919) internal successors, (4284), 2325 states have internal predecessors, (4284), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-12 21:03:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 4326 transitions. [2024-10-12 21:03:15,251 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 4326 transitions. Word has length 111 [2024-10-12 21:03:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:15,252 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 4326 transitions. [2024-10-12 21:03:15,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 4326 transitions. [2024-10-12 21:03:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:15,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:15,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:15,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:03:15,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:15,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:15,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1460723850, now seen corresponding path program 1 times [2024-10-12 21:03:15,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:15,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841900445] [2024-10-12 21:03:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:15,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:15,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:15,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:15,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:15,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:15,585 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-12 21:03:15,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841900445] [2024-10-12 21:03:15,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841900445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:15,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:15,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:03:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012280857] [2024-10-12 21:03:15,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:15,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:03:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:15,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:03:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:03:15,594 INFO L87 Difference]: Start difference. First operand 2352 states and 4326 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-12 21:03:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:17,559 INFO L93 Difference]: Finished difference Result 2957 states and 5322 transitions. [2024-10-12 21:03:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:03:17,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:17,577 INFO L225 Difference]: With dead ends: 2957 [2024-10-12 21:03:17,578 INFO L226 Difference]: Without dead ends: 2739 [2024-10-12 21:03:17,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:03:17,581 INFO L432 NwaCegarLoop]: 4137 mSDtfsCounter, 4889 mSDsluCounter, 12392 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 16529 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:17,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 16529 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:03:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2024-10-12 21:03:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2580. [2024-10-12 21:03:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2580 states, 2528 states have (on average 1.8263449367088607) internal successors, (4617), 2531 states have internal predecessors, (4617), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-12 21:03:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 4694 transitions. [2024-10-12 21:03:17,668 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 4694 transitions. Word has length 111 [2024-10-12 21:03:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:17,669 INFO L471 AbstractCegarLoop]: Abstraction has 2580 states and 4694 transitions. [2024-10-12 21:03:17,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-12 21:03:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 4694 transitions. [2024-10-12 21:03:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:17,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:17,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:17,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:03:17,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:17,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:17,673 INFO L85 PathProgramCache]: Analyzing trace with hash -181725190, now seen corresponding path program 1 times [2024-10-12 21:03:17,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:17,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425246436] [2024-10-12 21:03:17,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:17,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:17,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:17,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:17,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:17,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:17,935 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-12 21:03:17,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425246436] [2024-10-12 21:03:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425246436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:17,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:17,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:17,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782462112] [2024-10-12 21:03:17,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:17,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:17,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:17,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:17,938 INFO L87 Difference]: Start difference. First operand 2580 states and 4694 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:20,319 INFO L93 Difference]: Finished difference Result 3502 states and 6208 transitions. [2024-10-12 21:03:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:03:20,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:20,336 INFO L225 Difference]: With dead ends: 3502 [2024-10-12 21:03:20,338 INFO L226 Difference]: Without dead ends: 3056 [2024-10-12 21:03:20,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:03:20,344 INFO L432 NwaCegarLoop]: 4270 mSDtfsCounter, 4904 mSDsluCounter, 16836 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4918 SdHoareTripleChecker+Valid, 21106 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:20,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4918 Valid, 21106 Invalid, 2424 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 21:03:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2024-10-12 21:03:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2791. [2024-10-12 21:03:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2716 states have (on average 1.8100147275405007) internal successors, (4916), 2720 states have internal predecessors, (4916), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-12 21:03:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 5027 transitions. [2024-10-12 21:03:20,442 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 5027 transitions. Word has length 111 [2024-10-12 21:03:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:20,442 INFO L471 AbstractCegarLoop]: Abstraction has 2791 states and 5027 transitions. [2024-10-12 21:03:20,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 5027 transitions. [2024-10-12 21:03:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:20,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:20,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:20,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:03:20,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:20,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:20,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1800700104, now seen corresponding path program 1 times [2024-10-12 21:03:20,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:20,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409936625] [2024-10-12 21:03:20,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:20,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:20,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:20,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:20,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:20,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:20,713 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-12 21:03:20,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:20,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409936625] [2024-10-12 21:03:20,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409936625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:20,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:20,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:20,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525322325] [2024-10-12 21:03:20,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:20,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:20,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:20,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:20,715 INFO L87 Difference]: Start difference. First operand 2791 states and 5027 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:22,996 INFO L93 Difference]: Finished difference Result 4300 states and 7499 transitions. [2024-10-12 21:03:22,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:03:22,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:23,014 INFO L225 Difference]: With dead ends: 4300 [2024-10-12 21:03:23,015 INFO L226 Difference]: Without dead ends: 3643 [2024-10-12 21:03:23,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:03:23,026 INFO L432 NwaCegarLoop]: 4268 mSDtfsCounter, 4902 mSDsluCounter, 16836 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4916 SdHoareTripleChecker+Valid, 21104 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:23,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4916 Valid, 21104 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 21:03:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2024-10-12 21:03:23,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3214. [2024-10-12 21:03:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7830585192369868) internal successors, (5515), 3099 states have internal predecessors, (5515), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-12 21:03:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5698 transitions. [2024-10-12 21:03:23,154 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5698 transitions. Word has length 111 [2024-10-12 21:03:23,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:23,155 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5698 transitions. [2024-10-12 21:03:23,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5698 transitions. [2024-10-12 21:03:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:23,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:23,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:23,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:03:23,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:23,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1610758202, now seen corresponding path program 1 times [2024-10-12 21:03:23,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:23,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547620119] [2024-10-12 21:03:23,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:23,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,353 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-12 21:03:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:23,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547620119] [2024-10-12 21:03:23,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547620119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:23,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:23,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:23,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357333645] [2024-10-12 21:03:23,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:23,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:23,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:23,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:23,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:23,359 INFO L87 Difference]: Start difference. First operand 3214 states and 5698 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:24,415 INFO L93 Difference]: Finished difference Result 4713 states and 8163 transitions. [2024-10-12 21:03:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:03:24,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:24,432 INFO L225 Difference]: With dead ends: 4713 [2024-10-12 21:03:24,432 INFO L226 Difference]: Without dead ends: 3633 [2024-10-12 21:03:24,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:03:24,438 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4645 mSDsluCounter, 16334 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4660 SdHoareTripleChecker+Valid, 20458 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:24,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4660 Valid, 20458 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:03:24,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2024-10-12 21:03:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3214. [2024-10-12 21:03:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7814419657290657) internal successors, (5510), 3099 states have internal predecessors, (5510), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-12 21:03:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5693 transitions. [2024-10-12 21:03:24,559 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5693 transitions. Word has length 111 [2024-10-12 21:03:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:24,559 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5693 transitions. [2024-10-12 21:03:24,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5693 transitions. [2024-10-12 21:03:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:24,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:24,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:24,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:03:24,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:24,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1582257912, now seen corresponding path program 1 times [2024-10-12 21:03:24,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:24,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635663096] [2024-10-12 21:03:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:24,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:24,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:24,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:24,845 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-12 21:03:24,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:24,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635663096] [2024-10-12 21:03:24,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635663096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:24,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:24,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:24,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925510783] [2024-10-12 21:03:24,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:24,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:24,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:24,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:24,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:24,851 INFO L87 Difference]: Start difference. First operand 3214 states and 5693 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:25,891 INFO L93 Difference]: Finished difference Result 4707 states and 8137 transitions. [2024-10-12 21:03:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:03:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:25,907 INFO L225 Difference]: With dead ends: 4707 [2024-10-12 21:03:25,907 INFO L226 Difference]: Without dead ends: 3627 [2024-10-12 21:03:25,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:03:25,914 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4740 mSDsluCounter, 12269 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4755 SdHoareTripleChecker+Valid, 16393 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:25,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4755 Valid, 16393 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:03:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2024-10-12 21:03:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3214. [2024-10-12 21:03:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7798254122211445) internal successors, (5505), 3099 states have internal predecessors, (5505), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-12 21:03:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5688 transitions. [2024-10-12 21:03:26,032 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5688 transitions. Word has length 111 [2024-10-12 21:03:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:26,032 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5688 transitions. [2024-10-12 21:03:26,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5688 transitions. [2024-10-12 21:03:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:26,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:26,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:26,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:03:26,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:26,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash -358324102, now seen corresponding path program 1 times [2024-10-12 21:03:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:26,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478359852] [2024-10-12 21:03:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:26,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:26,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:26,216 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-12 21:03:26,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:26,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478359852] [2024-10-12 21:03:26,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478359852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:26,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:26,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:26,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679253211] [2024-10-12 21:03:26,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:26,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:26,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:26,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:26,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:26,218 INFO L87 Difference]: Start difference. First operand 3214 states and 5688 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:27,346 INFO L93 Difference]: Finished difference Result 4700 states and 8109 transitions. [2024-10-12 21:03:27,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:03:27,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:27,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:27,361 INFO L225 Difference]: With dead ends: 4700 [2024-10-12 21:03:27,361 INFO L226 Difference]: Without dead ends: 3620 [2024-10-12 21:03:27,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:03:27,367 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4646 mSDsluCounter, 16334 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 20458 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:27,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 20458 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:03:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2024-10-12 21:03:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 3214. [2024-10-12 21:03:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7782088587132234) internal successors, (5500), 3099 states have internal predecessors, (5500), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-12 21:03:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5683 transitions. [2024-10-12 21:03:27,483 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5683 transitions. Word has length 111 [2024-10-12 21:03:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:27,484 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5683 transitions. [2024-10-12 21:03:27,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5683 transitions. [2024-10-12 21:03:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:27,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:27,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:27,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:03:27,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:27,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1518739128, now seen corresponding path program 1 times [2024-10-12 21:03:27,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:27,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95841231] [2024-10-12 21:03:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:27,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:27,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:27,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:27,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:27,669 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-12 21:03:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95841231] [2024-10-12 21:03:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95841231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:27,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:27,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:27,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271694000] [2024-10-12 21:03:27,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:27,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:27,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:27,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:27,671 INFO L87 Difference]: Start difference. First operand 3214 states and 5683 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:28,920 INFO L93 Difference]: Finished difference Result 4688 states and 8071 transitions. [2024-10-12 21:03:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:03:28,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:28,936 INFO L225 Difference]: With dead ends: 4688 [2024-10-12 21:03:28,937 INFO L226 Difference]: Without dead ends: 3608 [2024-10-12 21:03:28,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:03:28,943 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4643 mSDsluCounter, 16334 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4658 SdHoareTripleChecker+Valid, 20458 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:28,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4658 Valid, 20458 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:03:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2024-10-12 21:03:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3214. [2024-10-12 21:03:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7765923052053023) internal successors, (5495), 3099 states have internal predecessors, (5495), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-12 21:03:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5678 transitions. [2024-10-12 21:03:29,110 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5678 transitions. Word has length 111 [2024-10-12 21:03:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:29,111 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5678 transitions. [2024-10-12 21:03:29,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5678 transitions. [2024-10-12 21:03:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:29,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:29,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:29,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:03:29,114 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:29,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:29,115 INFO L85 PathProgramCache]: Analyzing trace with hash 524045430, now seen corresponding path program 1 times [2024-10-12 21:03:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:29,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844031262] [2024-10-12 21:03:29,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:29,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,355 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-12 21:03:29,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:29,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844031262] [2024-10-12 21:03:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844031262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:29,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:29,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:29,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619669680] [2024-10-12 21:03:29,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:29,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:29,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:29,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:29,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:29,359 INFO L87 Difference]: Start difference. First operand 3214 states and 5678 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:31,838 INFO L93 Difference]: Finished difference Result 6166 states and 10402 transitions. [2024-10-12 21:03:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:03:31,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:31,852 INFO L225 Difference]: With dead ends: 6166 [2024-10-12 21:03:31,853 INFO L226 Difference]: Without dead ends: 5086 [2024-10-12 21:03:31,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:03:31,856 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 5132 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5154 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:31,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5154 Valid, 21097 Invalid, 2285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 21:03:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2024-10-12 21:03:32,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 4075. [2024-10-12 21:03:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4075 states, 3866 states have (on average 1.734092084842214) internal successors, (6704), 3876 states have internal predecessors, (6704), 145 states have call successors, (145), 54 states have call predecessors, (145), 62 states have return successors, (180), 152 states have call predecessors, (180), 145 states have call successors, (180) [2024-10-12 21:03:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 4075 states and 7029 transitions. [2024-10-12 21:03:32,015 INFO L78 Accepts]: Start accepts. Automaton has 4075 states and 7029 transitions. Word has length 111 [2024-10-12 21:03:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:32,015 INFO L471 AbstractCegarLoop]: Abstraction has 4075 states and 7029 transitions. [2024-10-12 21:03:32,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4075 states and 7029 transitions. [2024-10-12 21:03:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:32,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:32,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:32,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:03:32,019 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:32,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash -62230792, now seen corresponding path program 1 times [2024-10-12 21:03:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:32,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388505437] [2024-10-12 21:03:32,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:32,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,204 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-12 21:03:32,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:32,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388505437] [2024-10-12 21:03:32,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388505437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:32,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:32,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148155951] [2024-10-12 21:03:32,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:32,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:32,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:32,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:32,206 INFO L87 Difference]: Start difference. First operand 4075 states and 7029 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:34,472 INFO L93 Difference]: Finished difference Result 9483 states and 15673 transitions. [2024-10-12 21:03:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:03:34,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:34,500 INFO L225 Difference]: With dead ends: 9483 [2024-10-12 21:03:34,500 INFO L226 Difference]: Without dead ends: 7542 [2024-10-12 21:03:34,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:03:34,510 INFO L432 NwaCegarLoop]: 4265 mSDtfsCounter, 4927 mSDsluCounter, 16828 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4940 SdHoareTripleChecker+Valid, 21093 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:34,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4940 Valid, 21093 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:03:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7542 states. [2024-10-12 21:03:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7542 to 5746. [2024-10-12 21:03:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5746 states, 5365 states have (on average 1.6857409133271202) internal successors, (9044), 5383 states have internal predecessors, (9044), 261 states have call successors, (261), 102 states have call predecessors, (261), 118 states have return successors, (358), 276 states have call predecessors, (358), 261 states have call successors, (358) [2024-10-12 21:03:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5746 states to 5746 states and 9663 transitions. [2024-10-12 21:03:34,940 INFO L78 Accepts]: Start accepts. Automaton has 5746 states and 9663 transitions. Word has length 111 [2024-10-12 21:03:34,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:34,941 INFO L471 AbstractCegarLoop]: Abstraction has 5746 states and 9663 transitions. [2024-10-12 21:03:34,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 5746 states and 9663 transitions. [2024-10-12 21:03:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:34,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:34,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:34,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:03:34,947 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:34,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2020805578, now seen corresponding path program 1 times [2024-10-12 21:03:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:34,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586831048] [2024-10-12 21:03:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:35,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:35,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:35,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:35,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:35,122 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-12 21:03:35,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586831048] [2024-10-12 21:03:35,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586831048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:35,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:35,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:35,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949993701] [2024-10-12 21:03:35,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:35,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:35,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:35,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:35,124 INFO L87 Difference]: Start difference. First operand 5746 states and 9663 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:37,429 INFO L93 Difference]: Finished difference Result 15876 states and 25869 transitions. [2024-10-12 21:03:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:03:37,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:37,476 INFO L225 Difference]: With dead ends: 15876 [2024-10-12 21:03:37,476 INFO L226 Difference]: Without dead ends: 12264 [2024-10-12 21:03:37,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:03:37,494 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 5060 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2203 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:37,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 21097 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2203 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:03:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12264 states. [2024-10-12 21:03:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12264 to 9127. [2024-10-12 21:03:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9127 states, 8410 states have (on average 1.641141498216409) internal successors, (13802), 8444 states have internal predecessors, (13802), 485 states have call successors, (485), 198 states have call predecessors, (485), 230 states have return successors, (760), 516 states have call predecessors, (760), 485 states have call successors, (760) [2024-10-12 21:03:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9127 states to 9127 states and 15047 transitions. [2024-10-12 21:03:38,148 INFO L78 Accepts]: Start accepts. Automaton has 9127 states and 15047 transitions. Word has length 111 [2024-10-12 21:03:38,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:38,148 INFO L471 AbstractCegarLoop]: Abstraction has 9127 states and 15047 transitions. [2024-10-12 21:03:38,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 9127 states and 15047 transitions. [2024-10-12 21:03:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:38,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:38,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:38,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:03:38,156 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:38,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:38,156 INFO L85 PathProgramCache]: Analyzing trace with hash -144322760, now seen corresponding path program 1 times [2024-10-12 21:03:38,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:38,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140018673] [2024-10-12 21:03:38,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:38,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:38,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:38,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:38,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:38,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:38,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:38,329 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-12 21:03:38,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:38,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140018673] [2024-10-12 21:03:38,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140018673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:38,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:38,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:38,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144616987] [2024-10-12 21:03:38,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:38,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:38,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:38,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:38,331 INFO L87 Difference]: Start difference. First operand 9127 states and 15047 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:41,575 INFO L93 Difference]: Finished difference Result 28527 states and 46239 transitions. [2024-10-12 21:03:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:03:41,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:41,648 INFO L225 Difference]: With dead ends: 28527 [2024-10-12 21:03:41,649 INFO L226 Difference]: Without dead ends: 21534 [2024-10-12 21:03:41,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:03:41,678 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 5024 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5046 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:41,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5046 Valid, 21097 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:03:41,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21534 states. [2024-10-12 21:03:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21534 to 15888. [2024-10-12 21:03:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15888 states, 14515 states have (on average 1.608542886668963) internal successors, (23348), 14581 states have internal predecessors, (23348), 917 states have call successors, (917), 390 states have call predecessors, (917), 454 states have return successors, (1710), 980 states have call predecessors, (1710), 917 states have call successors, (1710) [2024-10-12 21:03:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15888 states to 15888 states and 25975 transitions. [2024-10-12 21:03:42,749 INFO L78 Accepts]: Start accepts. Automaton has 15888 states and 25975 transitions. Word has length 111 [2024-10-12 21:03:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:42,750 INFO L471 AbstractCegarLoop]: Abstraction has 15888 states and 25975 transitions. [2024-10-12 21:03:42,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 15888 states and 25975 transitions. [2024-10-12 21:03:42,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:42,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:42,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:42,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:03:42,761 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:42,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:42,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2023453706, now seen corresponding path program 1 times [2024-10-12 21:03:42,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:42,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157968287] [2024-10-12 21:03:42,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:42,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:42,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:42,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:42,925 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-12 21:03:42,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:42,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157968287] [2024-10-12 21:03:42,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157968287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:42,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:42,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324208208] [2024-10-12 21:03:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:42,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:42,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:42,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:42,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:42,928 INFO L87 Difference]: Start difference. First operand 15888 states and 25975 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:47,009 INFO L93 Difference]: Finished difference Result 53350 states and 86797 transitions. [2024-10-12 21:03:47,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:03:47,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:47,147 INFO L225 Difference]: With dead ends: 53350 [2024-10-12 21:03:47,148 INFO L226 Difference]: Without dead ends: 39596 [2024-10-12 21:03:47,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:03:47,189 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 4898 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4911 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:47,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4911 Valid, 21097 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:03:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39596 states. [2024-10-12 21:03:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39596 to 29409. [2024-10-12 21:03:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29409 states, 26756 states have (on average 1.5885035132306773) internal successors, (42502), 26886 states have internal predecessors, (42502), 1749 states have call successors, (1749), 774 states have call predecessors, (1749), 902 states have return successors, (4064), 1876 states have call predecessors, (4064), 1749 states have call successors, (4064) [2024-10-12 21:03:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29409 states to 29409 states and 48315 transitions. [2024-10-12 21:03:49,442 INFO L78 Accepts]: Start accepts. Automaton has 29409 states and 48315 transitions. Word has length 111 [2024-10-12 21:03:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:49,442 INFO L471 AbstractCegarLoop]: Abstraction has 29409 states and 48315 transitions. [2024-10-12 21:03:49,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 29409 states and 48315 transitions. [2024-10-12 21:03:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:03:49,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:49,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:03:49,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:03:49,462 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:49,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash -698597512, now seen corresponding path program 1 times [2024-10-12 21:03:49,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:49,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74377262] [2024-10-12 21:03:49,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:49,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:49,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:49,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:03:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:49,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:03:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:49,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:03:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:03:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:49,622 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-12 21:03:49,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:49,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74377262] [2024-10-12 21:03:49,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74377262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:49,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:49,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:49,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565771549] [2024-10-12 21:03:49,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:49,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:49,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:49,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:49,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:49,624 INFO L87 Difference]: Start difference. First operand 29409 states and 48315 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:03:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:55,881 INFO L93 Difference]: Finished difference Result 102037 states and 168195 transitions. [2024-10-12 21:03:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:03:55,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-12 21:03:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:56,238 INFO L225 Difference]: With dead ends: 102037 [2024-10-12 21:03:56,238 INFO L226 Difference]: Without dead ends: 74762 [2024-10-12 21:03:56,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:03:56,327 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 4958 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4980 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:56,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4980 Valid, 21097 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:03:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2024-10-12 21:04:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 56450. [2024-10-12 21:04:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56450 states, 51301 states have (on average 1.57766905128555) internal successors, (80936), 51559 states have internal predecessors, (80936), 3349 states have call successors, (3349), 1542 states have call predecessors, (3349), 1798 states have return successors, (10166), 3604 states have call predecessors, (10166), 3349 states have call successors, (10166) [2024-10-12 21:04:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56450 states to 56450 states and 94451 transitions. [2024-10-12 21:04:00,718 INFO L78 Accepts]: Start accepts. Automaton has 56450 states and 94451 transitions. Word has length 111 [2024-10-12 21:04:00,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:04:00,719 INFO L471 AbstractCegarLoop]: Abstraction has 56450 states and 94451 transitions. [2024-10-12 21:04:00,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-12 21:04:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 56450 states and 94451 transitions. [2024-10-12 21:04:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 21:04:00,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:04:00,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:04:00,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:04:00,759 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:04:00,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:04:00,760 INFO L85 PathProgramCache]: Analyzing trace with hash 868160438, now seen corresponding path program 1 times [2024-10-12 21:04:00,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:04:00,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062256997] [2024-10-12 21:04:00,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:04:00,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:04:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:00,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:04:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:04:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:00,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 21:04:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:00,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 21:04:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:00,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 21:04:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:00,929 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-12 21:04:00,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:04:00,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062256997] [2024-10-12 21:04:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062256997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:04:00,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:04:00,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:04:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54565223] [2024-10-12 21:04:00,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:04:00,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:04:00,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:04:00,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:04:00,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:04:00,932 INFO L87 Difference]: Start difference. First operand 56450 states and 94451 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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)