./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_label49+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_label49+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 212f1e6cc1aae5a1223162e16d5bd8071b486da78643961fa0a66e81c45b8eae --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:35:58,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:35:58,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:35:58,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:35:58,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:35:58,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:35:58,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:35:58,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:35:58,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:35:58,306 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:35:58,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:35:58,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:35:58,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:35:58,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:35:58,313 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:35:58,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:35:58,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:35:58,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:35:58,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:35:58,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:35:58,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:35:58,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:35:58,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:35:58,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:35:58,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:35:58,317 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:35:58,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:35:58,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:35:58,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:35:58,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:35:58,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:35:58,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:35:58,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:35:58,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:35:58,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:35:58,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:35:58,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:35:58,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:35:58,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:35:58,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:35:58,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:35:58,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:35:58,333 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 -> 212f1e6cc1aae5a1223162e16d5bd8071b486da78643961fa0a66e81c45b8eae [2024-10-14 04:35:58,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:35:58,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:35:58,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:35:58,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:35:58,618 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:35:58,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-1.c [2024-10-14 04:36:00,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:36:00,704 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:36:00,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.07.cil-1.c [2024-10-14 04:36:00,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4a44ef1/6301f3d04b8243beb264afcf0eb31dc6/FLAG140da7853 [2024-10-14 04:36:00,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4a44ef1/6301f3d04b8243beb264afcf0eb31dc6 [2024-10-14 04:36:00,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:36:00,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:36:00,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:36:00,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:36:00,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:36:00,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:36:00" (1/1) ... [2024-10-14 04:36:00,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478dd0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:00, skipping insertion in model container [2024-10-14 04:36:00,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:36:00" (1/1) ... [2024-10-14 04:36:00,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:36:02,596 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_label49+token_ring.07.cil-1.c[380593,380606] [2024-10-14 04:36:02,626 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_label49+token_ring.07.cil-1.c[383339,383352] [2024-10-14 04:36:02,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:36:02,843 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:36:03,658 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_label49+token_ring.07.cil-1.c[380593,380606] [2024-10-14 04:36:03,663 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_label49+token_ring.07.cil-1.c[383339,383352] [2024-10-14 04:36:03,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:36:03,752 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:36:03,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03 WrapperNode [2024-10-14 04:36:03,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:36:03,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:36:03,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:36:03,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:36:03,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:03,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:04,321 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12933 [2024-10-14 04:36:04,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:36:04,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:36:04,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:36:04,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:36:04,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:04,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:04,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:04,518 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-14 04:36:04,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:04,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:04,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:04,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:04,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:04,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:04,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:36:04,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:36:04,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:36:04,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:36:04,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (1/1) ... [2024-10-14 04:36:04,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:36:04,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:36:05,001 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-14 04:36:05,007 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-14 04:36:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:36:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:36:05,053 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:36:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:36:05,054 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:36:05,054 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:36:05,055 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:36:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:36:05,055 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:36:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:36:05,055 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:36:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:36:05,056 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:36:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:36:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:36:05,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:36:05,192 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:36:05,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:36:13,067 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2024-10-14 04:36:13,067 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:36:13,194 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:36:13,195 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-14 04:36:13,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:36:13 BoogieIcfgContainer [2024-10-14 04:36:13,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:36:13,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:36:13,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:36:13,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:36:13,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:36:00" (1/3) ... [2024-10-14 04:36:13,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c5d599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:36:13, skipping insertion in model container [2024-10-14 04:36:13,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:36:03" (2/3) ... [2024-10-14 04:36:13,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c5d599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:36:13, skipping insertion in model container [2024-10-14 04:36:13,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:36:13" (3/3) ... [2024-10-14 04:36:13,206 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.07.cil-1.c [2024-10-14 04:36:13,225 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:36:13,225 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:36:13,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:36:13,363 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;@615f9b61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:36:13,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:36:13,375 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-14 04:36:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:13,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:13,392 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-14 04:36:13,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:13,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:13,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1751521651, now seen corresponding path program 1 times [2024-10-14 04:36:13,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:13,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184638474] [2024-10-14 04:36:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:13,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:13,976 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-14 04:36:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184638474] [2024-10-14 04:36:13,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184638474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:13,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:13,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:36:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932700124] [2024-10-14 04:36:13,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:13,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:36:13,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:14,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:36:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:36:14,025 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-14 04:36:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:15,412 INFO L93 Difference]: Finished difference Result 4782 states and 8954 transitions. [2024-10-14 04:36:15,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:36:15,416 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-14 04:36:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:15,450 INFO L225 Difference]: With dead ends: 4782 [2024-10-14 04:36:15,450 INFO L226 Difference]: Without dead ends: 2432 [2024-10-14 04:36:15,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:36:15,468 INFO L432 NwaCegarLoop]: 4162 mSDtfsCounter, 618 mSDsluCounter, 12094 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-14 04:36:15,469 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-14 04:36:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2024-10-14 04:36:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2352. [2024-10-14 04:36:15,616 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-14 04:36:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 4326 transitions. [2024-10-14 04:36:15,629 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 4326 transitions. Word has length 111 [2024-10-14 04:36:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:15,630 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 4326 transitions. [2024-10-14 04:36:15,630 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-14 04:36:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 4326 transitions. [2024-10-14 04:36:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:15,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:15,635 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-14 04:36:15,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:36:15,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:15,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash -637042379, now seen corresponding path program 1 times [2024-10-14 04:36:15,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:15,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476987553] [2024-10-14 04:36:15,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:15,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:15,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:15,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:15,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:15,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:15,957 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-14 04:36:15,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:15,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476987553] [2024-10-14 04:36:15,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476987553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:15,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:15,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:36:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653370330] [2024-10-14 04:36:15,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:15,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:36:15,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:15,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:36:15,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:36:15,962 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-14 04:36:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:18,181 INFO L93 Difference]: Finished difference Result 2957 states and 5322 transitions. [2024-10-14 04:36:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:36:18,182 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-14 04:36:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:18,197 INFO L225 Difference]: With dead ends: 2957 [2024-10-14 04:36:18,197 INFO L226 Difference]: Without dead ends: 2739 [2024-10-14 04:36:18,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:36:18,201 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.1s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:36:18,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 16529 Invalid, 1541 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [88 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 04:36:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2024-10-14 04:36:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2580. [2024-10-14 04:36:18,304 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-14 04:36:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 4694 transitions. [2024-10-14 04:36:18,320 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 4694 transitions. Word has length 111 [2024-10-14 04:36:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:18,321 INFO L471 AbstractCegarLoop]: Abstraction has 2580 states and 4694 transitions. [2024-10-14 04:36:18,322 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-14 04:36:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 4694 transitions. [2024-10-14 04:36:18,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:18,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:18,332 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-14 04:36:18,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:36:18,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:18,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:18,333 INFO L85 PathProgramCache]: Analyzing trace with hash 641956281, now seen corresponding path program 1 times [2024-10-14 04:36:18,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:18,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36589611] [2024-10-14 04:36:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:18,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:18,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:18,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:18,656 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-14 04:36:18,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:18,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36589611] [2024-10-14 04:36:18,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36589611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:18,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:18,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:18,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494317730] [2024-10-14 04:36:18,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:18,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:18,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:18,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:18,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:18,660 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-14 04:36:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:21,394 INFO L93 Difference]: Finished difference Result 3502 states and 6208 transitions. [2024-10-14 04:36:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:36:21,395 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-14 04:36:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:21,415 INFO L225 Difference]: With dead ends: 3502 [2024-10-14 04:36:21,416 INFO L226 Difference]: Without dead ends: 3056 [2024-10-14 04:36:21,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:36:21,422 INFO L432 NwaCegarLoop]: 4270 mSDtfsCounter, 4904 mSDsluCounter, 16836 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:36:21,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4918 Valid, 21106 Invalid, 2424 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 04:36:21,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2024-10-14 04:36:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2791. [2024-10-14 04:36:21,527 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-14 04:36:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 5027 transitions. [2024-10-14 04:36:21,540 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 5027 transitions. Word has length 111 [2024-10-14 04:36:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:21,541 INFO L471 AbstractCegarLoop]: Abstraction has 2791 states and 5027 transitions. [2024-10-14 04:36:21,541 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-14 04:36:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 5027 transitions. [2024-10-14 04:36:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:21,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:21,544 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-14 04:36:21,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:36:21,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:21,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash -977018633, now seen corresponding path program 1 times [2024-10-14 04:36:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:21,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146565243] [2024-10-14 04:36:21,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:21,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:21,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:21,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:21,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:21,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:21,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:21,802 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-14 04:36:21,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:21,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146565243] [2024-10-14 04:36:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146565243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:21,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:21,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:21,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569531006] [2024-10-14 04:36:21,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:21,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:21,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:21,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:21,805 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-14 04:36:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:24,056 INFO L93 Difference]: Finished difference Result 4300 states and 7499 transitions. [2024-10-14 04:36:24,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:36:24,058 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-14 04:36:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:24,076 INFO L225 Difference]: With dead ends: 4300 [2024-10-14 04:36:24,077 INFO L226 Difference]: Without dead ends: 3643 [2024-10-14 04:36:24,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:36:24,082 INFO L432 NwaCegarLoop]: 4268 mSDtfsCounter, 4902 mSDsluCounter, 16836 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4916 SdHoareTripleChecker+Valid, 21104 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:36:24,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4916 Valid, 21104 Invalid, 2422 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 04:36:24,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2024-10-14 04:36:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3214. [2024-10-14 04:36:24,192 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-14 04:36:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5698 transitions. [2024-10-14 04:36:24,305 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5698 transitions. Word has length 111 [2024-10-14 04:36:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:24,305 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5698 transitions. [2024-10-14 04:36:24,306 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-14 04:36:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5698 transitions. [2024-10-14 04:36:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:24,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:24,309 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-14 04:36:24,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:36:24,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:24,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:24,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1860527623, now seen corresponding path program 1 times [2024-10-14 04:36:24,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771791645] [2024-10-14 04:36:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:24,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:24,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:24,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:24,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:24,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:24,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:24,513 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-14 04:36:24,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:24,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771791645] [2024-10-14 04:36:24,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771791645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:24,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:24,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:24,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921953991] [2024-10-14 04:36:24,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:24,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:24,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:24,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:24,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:24,521 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-14 04:36:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:25,801 INFO L93 Difference]: Finished difference Result 4713 states and 8163 transitions. [2024-10-14 04:36:25,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:36:25,802 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-14 04:36:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:25,836 INFO L225 Difference]: With dead ends: 4713 [2024-10-14 04:36:25,841 INFO L226 Difference]: Without dead ends: 3633 [2024-10-14 04:36:25,847 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-14 04:36:25,848 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4645 mSDsluCounter, 16334 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:36:25,848 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.9s Time] [2024-10-14 04:36:25,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2024-10-14 04:36:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3214. [2024-10-14 04:36:25,976 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-14 04:36:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5693 transitions. [2024-10-14 04:36:25,987 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5693 transitions. Word has length 111 [2024-10-14 04:36:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:25,988 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5693 transitions. [2024-10-14 04:36:25,988 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-14 04:36:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5693 transitions. [2024-10-14 04:36:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:25,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:25,992 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-14 04:36:25,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:36:25,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:25,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1889027913, now seen corresponding path program 1 times [2024-10-14 04:36:25,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:25,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005481408] [2024-10-14 04:36:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:25,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:26,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:26,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:26,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:26,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:26,171 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-14 04:36:26,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005481408] [2024-10-14 04:36:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005481408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:26,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:26,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:26,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707179119] [2024-10-14 04:36:26,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:26,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:26,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:26,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:26,174 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-14 04:36:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:27,218 INFO L93 Difference]: Finished difference Result 4707 states and 8137 transitions. [2024-10-14 04:36:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:36:27,219 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-14 04:36:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:27,236 INFO L225 Difference]: With dead ends: 4707 [2024-10-14 04:36:27,237 INFO L226 Difference]: Without dead ends: 3627 [2024-10-14 04:36:27,242 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-14 04:36:27,244 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-14 04:36:27,244 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-14 04:36:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2024-10-14 04:36:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3214. [2024-10-14 04:36:27,525 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-14 04:36:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5688 transitions. [2024-10-14 04:36:27,538 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5688 transitions. Word has length 111 [2024-10-14 04:36:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:27,539 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5688 transitions. [2024-10-14 04:36:27,539 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-14 04:36:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5688 transitions. [2024-10-14 04:36:27,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:27,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:27,541 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-14 04:36:27,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:36:27,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:27,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:27,542 INFO L85 PathProgramCache]: Analyzing trace with hash 465357369, now seen corresponding path program 1 times [2024-10-14 04:36:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:27,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338590646] [2024-10-14 04:36:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:27,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:27,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:27,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:27,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:27,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:27,730 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-14 04:36:27,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338590646] [2024-10-14 04:36:27,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338590646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:27,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:27,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172337085] [2024-10-14 04:36:27,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:27,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:27,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:27,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:27,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:27,733 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-14 04:36:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:28,810 INFO L93 Difference]: Finished difference Result 4700 states and 8109 transitions. [2024-10-14 04:36:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:36:28,811 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-14 04:36:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:28,826 INFO L225 Difference]: With dead ends: 4700 [2024-10-14 04:36:28,827 INFO L226 Difference]: Without dead ends: 3620 [2024-10-14 04:36:28,836 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-14 04:36:28,838 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-14 04:36:28,839 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-14 04:36:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2024-10-14 04:36:28,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 3214. [2024-10-14 04:36:28,957 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-14 04:36:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5683 transitions. [2024-10-14 04:36:28,970 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5683 transitions. Word has length 111 [2024-10-14 04:36:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:28,973 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5683 transitions. [2024-10-14 04:36:28,973 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-14 04:36:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5683 transitions. [2024-10-14 04:36:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:28,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:28,975 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-14 04:36:28,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:36:28,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:28,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1952546697, now seen corresponding path program 1 times [2024-10-14 04:36:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314313836] [2024-10-14 04:36:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:29,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:29,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:29,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:29,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:29,157 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-14 04:36:29,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:29,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314313836] [2024-10-14 04:36:29,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314313836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:29,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:29,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:29,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766075039] [2024-10-14 04:36:29,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:29,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:29,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:29,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:29,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:29,160 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-14 04:36:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:30,325 INFO L93 Difference]: Finished difference Result 4688 states and 8071 transitions. [2024-10-14 04:36:30,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:36:30,327 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-14 04:36:30,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:30,341 INFO L225 Difference]: With dead ends: 4688 [2024-10-14 04:36:30,342 INFO L226 Difference]: Without dead ends: 3608 [2024-10-14 04:36:30,346 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-14 04:36:30,347 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-14 04:36:30,348 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-14 04:36:30,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2024-10-14 04:36:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3214. [2024-10-14 04:36:30,504 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-14 04:36:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5678 transitions. [2024-10-14 04:36:30,515 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5678 transitions. Word has length 111 [2024-10-14 04:36:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:30,516 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5678 transitions. [2024-10-14 04:36:30,516 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-14 04:36:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5678 transitions. [2024-10-14 04:36:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:30,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:30,521 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-14 04:36:30,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:36:30,521 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:30,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:30,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1347726901, now seen corresponding path program 1 times [2024-10-14 04:36:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:30,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270458737] [2024-10-14 04:36:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:30,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:30,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:30,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:30,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:30,759 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-14 04:36:30,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:30,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270458737] [2024-10-14 04:36:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270458737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:30,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:30,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:30,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56449902] [2024-10-14 04:36:30,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:30,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:30,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:30,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:30,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:30,763 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-14 04:36:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:33,319 INFO L93 Difference]: Finished difference Result 6166 states and 10402 transitions. [2024-10-14 04:36:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:36:33,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-14 04:36:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:33,352 INFO L225 Difference]: With dead ends: 6166 [2024-10-14 04:36:33,353 INFO L226 Difference]: Without dead ends: 5086 [2024-10-14 04:36:33,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:36:33,364 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.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:36:33,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5154 Valid, 21097 Invalid, 2285 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 04:36:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2024-10-14 04:36:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 4075. [2024-10-14 04:36:33,706 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-14 04:36:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 4075 states and 7029 transitions. [2024-10-14 04:36:33,716 INFO L78 Accepts]: Start accepts. Automaton has 4075 states and 7029 transitions. Word has length 111 [2024-10-14 04:36:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:33,717 INFO L471 AbstractCegarLoop]: Abstraction has 4075 states and 7029 transitions. [2024-10-14 04:36:33,717 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-14 04:36:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4075 states and 7029 transitions. [2024-10-14 04:36:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:33,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:33,720 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-14 04:36:33,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:36:33,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:33,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash 761450679, now seen corresponding path program 1 times [2024-10-14 04:36:33,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:33,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75422953] [2024-10-14 04:36:33,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:33,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:33,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:33,905 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-14 04:36:33,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:33,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75422953] [2024-10-14 04:36:33,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75422953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:33,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:33,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:33,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722223515] [2024-10-14 04:36:33,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:33,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:33,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:33,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:33,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:33,908 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-14 04:36:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:36,250 INFO L93 Difference]: Finished difference Result 9483 states and 15673 transitions. [2024-10-14 04:36:36,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:36:36,250 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-14 04:36:36,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:36,281 INFO L225 Difference]: With dead ends: 9483 [2024-10-14 04:36:36,282 INFO L226 Difference]: Without dead ends: 7542 [2024-10-14 04:36:36,292 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-14 04:36:36,293 INFO L432 NwaCegarLoop]: 4265 mSDtfsCounter, 4927 mSDsluCounter, 16828 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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-14 04:36:36,293 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-14 04:36:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7542 states. [2024-10-14 04:36:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7542 to 5746. [2024-10-14 04:36:36,618 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-14 04:36:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5746 states to 5746 states and 9663 transitions. [2024-10-14 04:36:36,637 INFO L78 Accepts]: Start accepts. Automaton has 5746 states and 9663 transitions. Word has length 111 [2024-10-14 04:36:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:36,637 INFO L471 AbstractCegarLoop]: Abstraction has 5746 states and 9663 transitions. [2024-10-14 04:36:36,638 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-14 04:36:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 5746 states and 9663 transitions. [2024-10-14 04:36:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:36,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:36,642 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-14 04:36:36,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:36:36,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:36,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1197124107, now seen corresponding path program 1 times [2024-10-14 04:36:36,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:36,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447264661] [2024-10-14 04:36:36,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:36,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:36,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:36,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:36,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:36,890 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-14 04:36:36,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:36,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447264661] [2024-10-14 04:36:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447264661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:36,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:36,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:36,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909986486] [2024-10-14 04:36:36,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:36,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:36,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:36,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:36,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:36,893 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-14 04:36:39,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:39,451 INFO L93 Difference]: Finished difference Result 15876 states and 25869 transitions. [2024-10-14 04:36:39,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:36:39,451 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-14 04:36:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:39,499 INFO L225 Difference]: With dead ends: 15876 [2024-10-14 04:36:39,499 INFO L226 Difference]: Without dead ends: 12264 [2024-10-14 04:36:39,517 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-14 04:36:39,518 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 5060 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2203 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:36:39,518 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.6s Time] [2024-10-14 04:36:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12264 states. [2024-10-14 04:36:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12264 to 9127. [2024-10-14 04:36:40,120 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-14 04:36:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9127 states to 9127 states and 15047 transitions. [2024-10-14 04:36:40,147 INFO L78 Accepts]: Start accepts. Automaton has 9127 states and 15047 transitions. Word has length 111 [2024-10-14 04:36:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:40,148 INFO L471 AbstractCegarLoop]: Abstraction has 9127 states and 15047 transitions. [2024-10-14 04:36:40,148 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-14 04:36:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 9127 states and 15047 transitions. [2024-10-14 04:36:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:40,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:40,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-14 04:36:40,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:36:40,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:40,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash 679358711, now seen corresponding path program 1 times [2024-10-14 04:36:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:40,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589778731] [2024-10-14 04:36:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:40,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:40,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:40,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:40,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:40,328 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-14 04:36:40,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:40,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589778731] [2024-10-14 04:36:40,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589778731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:40,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:40,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:40,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697151353] [2024-10-14 04:36:40,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:40,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:40,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:40,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:40,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:40,330 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-14 04:36:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:43,581 INFO L93 Difference]: Finished difference Result 28527 states and 46239 transitions. [2024-10-14 04:36:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:36:43,582 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-14 04:36:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:43,677 INFO L225 Difference]: With dead ends: 28527 [2024-10-14 04:36:43,677 INFO L226 Difference]: Without dead ends: 21534 [2024-10-14 04:36:43,709 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-14 04:36:43,710 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.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:36:43,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5046 Valid, 21097 Invalid, 2246 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 04:36:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21534 states. [2024-10-14 04:36:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21534 to 15888. [2024-10-14 04:36:44,742 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-14 04:36:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15888 states to 15888 states and 25975 transitions. [2024-10-14 04:36:44,803 INFO L78 Accepts]: Start accepts. Automaton has 15888 states and 25975 transitions. Word has length 111 [2024-10-14 04:36:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:44,803 INFO L471 AbstractCegarLoop]: Abstraction has 15888 states and 25975 transitions. [2024-10-14 04:36:44,803 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-14 04:36:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 15888 states and 25975 transitions. [2024-10-14 04:36:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:44,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:44,814 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-14 04:36:44,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:36:44,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:44,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:44,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1199772235, now seen corresponding path program 1 times [2024-10-14 04:36:44,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:44,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701092427] [2024-10-14 04:36:44,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:44,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:44,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:44,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:44,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:44,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:44,988 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-14 04:36:44,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:44,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701092427] [2024-10-14 04:36:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701092427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:44,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:44,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:44,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283752473] [2024-10-14 04:36:44,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:44,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:44,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:44,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:44,990 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-14 04:36:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:49,022 INFO L93 Difference]: Finished difference Result 53350 states and 86797 transitions. [2024-10-14 04:36:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:36:49,023 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-14 04:36:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:49,186 INFO L225 Difference]: With dead ends: 53350 [2024-10-14 04:36:49,186 INFO L226 Difference]: Without dead ends: 39596 [2024-10-14 04:36:49,250 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-14 04:36:49,252 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-14 04:36:49,252 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-14 04:36:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39596 states. [2024-10-14 04:36:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39596 to 29409. [2024-10-14 04:36:51,100 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-14 04:36:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29409 states to 29409 states and 48315 transitions. [2024-10-14 04:36:51,184 INFO L78 Accepts]: Start accepts. Automaton has 29409 states and 48315 transitions. Word has length 111 [2024-10-14 04:36:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:51,184 INFO L471 AbstractCegarLoop]: Abstraction has 29409 states and 48315 transitions. [2024-10-14 04:36:51,184 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-14 04:36:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 29409 states and 48315 transitions. [2024-10-14 04:36:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:36:51,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:51,205 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-14 04:36:51,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:36:51,206 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:51,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:51,206 INFO L85 PathProgramCache]: Analyzing trace with hash 125083959, now seen corresponding path program 1 times [2024-10-14 04:36:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:51,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757612834] [2024-10-14 04:36:51,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:51,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:51,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:36:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:51,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:36:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:36:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:51,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:36:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:36:51,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:51,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757612834] [2024-10-14 04:36:51,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757612834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:51,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:51,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:51,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274543158] [2024-10-14 04:36:51,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:51,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:51,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:51,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:51,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:51,379 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-14 04:36:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:36:57,559 INFO L93 Difference]: Finished difference Result 102037 states and 168195 transitions. [2024-10-14 04:36:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:36:57,560 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-14 04:36:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:36:57,871 INFO L225 Difference]: With dead ends: 102037 [2024-10-14 04:36:57,872 INFO L226 Difference]: Without dead ends: 74762 [2024-10-14 04:36:57,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:36:57,963 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 4958 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:36:57,963 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.4s Time] [2024-10-14 04:36:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2024-10-14 04:37:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 56450. [2024-10-14 04:37:02,189 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-14 04:37:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56450 states to 56450 states and 94451 transitions. [2024-10-14 04:37:02,532 INFO L78 Accepts]: Start accepts. Automaton has 56450 states and 94451 transitions. Word has length 111 [2024-10-14 04:37:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:37:02,533 INFO L471 AbstractCegarLoop]: Abstraction has 56450 states and 94451 transitions. [2024-10-14 04:37:02,533 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-14 04:37:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 56450 states and 94451 transitions. [2024-10-14 04:37:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:37:02,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:37:02,582 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-14 04:37:02,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 04:37:02,582 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:37:02,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:37:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1691841909, now seen corresponding path program 1 times [2024-10-14 04:37:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:37:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020355658] [2024-10-14 04:37:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:37:02,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:37:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:37:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:37:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:37:02,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:37:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:37:02,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:37:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:37:02,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:37:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:37:02,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:37:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:37:02,756 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-14 04:37:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:37:02,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020355658] [2024-10-14 04:37:02,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020355658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:37:02,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:37:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:37:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147327666] [2024-10-14 04:37:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:37:02,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:37:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:37:02,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:37:02,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:37:02,758 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)