./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 24feb2eb47843fcae857e84ddd5aa58dae94843db909f56f0ca240268764bef9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:22:51,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:22:51,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:22:51,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:22:51,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:22:51,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:22:51,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:22:51,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:22:51,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:22:51,121 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:22:51,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:22:51,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:22:51,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:22:51,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:22:51,122 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:22:51,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:22:51,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:22:51,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:22:51,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:22:51,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:22:51,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:22:51,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:22:51,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:22:51,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:22:51,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:22:51,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:22:51,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:22:51,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:22:51,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:22:51,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:22:51,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:22:51,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:22:51,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:22:51,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:22:51,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:22:51,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:22:51,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:22:51,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:22:51,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:22:51,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:22:51,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:22:51,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:22:51,130 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 24feb2eb47843fcae857e84ddd5aa58dae94843db909f56f0ca240268764bef9 [2024-10-11 04:22:51,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:22:51,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:22:51,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:22:51,341 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:22:51,341 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:22:51,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c [2024-10-11 04:22:52,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:22:53,067 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:22:53,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c [2024-10-11 04:22:53,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/10190b47d/a7a31f806ba941ae9e01cf5d81cc9355/FLAGe864bb7d9 [2024-10-11 04:22:53,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/10190b47d/a7a31f806ba941ae9e01cf5d81cc9355 [2024-10-11 04:22:53,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:22:53,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:22:53,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:22:53,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:22:53,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:22:53,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:22:53" (1/1) ... [2024-10-11 04:22:53,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566ca086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:53, skipping insertion in model container [2024-10-11 04:22:53,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:22:53" (1/1) ... [2024-10-11 04:22:53,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:22:54,500 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c[382357,382370] [2024-10-11 04:22:54,518 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c[383339,383352] [2024-10-11 04:22:54,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:22:54,686 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:22:55,256 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c[382357,382370] [2024-10-11 04:22:55,260 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-2.c[383339,383352] [2024-10-11 04:22:55,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:22:55,318 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:22:55,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55 WrapperNode [2024-10-11 04:22:55,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:22:55,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:22:55,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:22:55,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:22:55,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:55,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:55,676 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13113 [2024-10-11 04:22:55,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:22:55,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:22:55,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:22:55,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:22:55,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:55,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:55,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:55,869 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:22:55,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:55,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:56,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:56,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:56,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:56,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:56,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:22:56,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:22:56,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:22:56,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:22:56,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (1/1) ... [2024-10-11 04:22:56,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:22:56,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:22:56,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:22:56,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:22:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:22:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:22:56,247 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:22:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:22:56,248 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:22:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:22:56,248 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:22:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:22:56,249 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:22:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:22:56,249 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:22:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:22:56,249 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:22:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:22:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:22:56,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:22:56,356 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:22:56,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:23:02,258 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2024-10-11 04:23:02,258 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:23:02,334 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:23:02,335 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-11 04:23:02,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:23:02 BoogieIcfgContainer [2024-10-11 04:23:02,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:23:02,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:23:02,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:23:02,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:23:02,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:22:53" (1/3) ... [2024-10-11 04:23:02,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fe34b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:23:02, skipping insertion in model container [2024-10-11 04:23:02,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:55" (2/3) ... [2024-10-11 04:23:02,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fe34b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:23:02, skipping insertion in model container [2024-10-11 04:23:02,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:23:02" (3/3) ... [2024-10-11 04:23:02,343 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.10.cil-2.c [2024-10-11 04:23:02,355 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:23:02,356 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:23:02,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:23:02,444 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;@79af2db3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:23:02,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:23:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 2425 states, 2392 states have (on average 1.8775083612040133) internal successors, (4491), 2395 states have internal predecessors, (4491), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 04:23:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:02,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:02,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:02,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:02,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash -951249728, now seen corresponding path program 1 times [2024-10-11 04:23:02,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:02,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354884563] [2024-10-11 04:23:02,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:02,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:02,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:02,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354884563] [2024-10-11 04:23:02,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354884563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:02,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:02,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:23:02,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11687822] [2024-10-11 04:23:02,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:02,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:23:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:02,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:23:02,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:23:02,978 INFO L87 Difference]: Start difference. First operand has 2425 states, 2392 states have (on average 1.8775083612040133) internal successors, (4491), 2395 states have internal predecessors, (4491), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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-11 04:23:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:04,395 INFO L93 Difference]: Finished difference Result 4952 states and 9258 transitions. [2024-10-11 04:23:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:23:04,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:04,425 INFO L225 Difference]: With dead ends: 4952 [2024-10-11 04:23:04,426 INFO L226 Difference]: Without dead ends: 2531 [2024-10-11 04:23:04,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:23:04,439 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 837 mSDsluCounter, 12160 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 16379 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:04,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 16379 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:23:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-10-11 04:23:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2421. [2024-10-11 04:23:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2389 states have (on average 1.8396818752616158) internal successors, (4395), 2391 states have internal predecessors, (4395), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 04:23:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4443 transitions. [2024-10-11 04:23:04,565 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4443 transitions. Word has length 141 [2024-10-11 04:23:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:04,566 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 4443 transitions. [2024-10-11 04:23:04,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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-11 04:23:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4443 transitions. [2024-10-11 04:23:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:04,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:04,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:04,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:23:04,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:04,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1626409854, now seen corresponding path program 1 times [2024-10-11 04:23:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:04,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493678774] [2024-10-11 04:23:04,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:04,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:04,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:04,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:04,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493678774] [2024-10-11 04:23:04,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493678774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:04,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:04,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:04,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234114763] [2024-10-11 04:23:04,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:04,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:04,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:04,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:04,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:04,904 INFO L87 Difference]: Start difference. First operand 2421 states and 4443 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:07,734 INFO L93 Difference]: Finished difference Result 3245 states and 5826 transitions. [2024-10-11 04:23:07,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:07,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:07,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:07,745 INFO L225 Difference]: With dead ends: 3245 [2024-10-11 04:23:07,745 INFO L226 Difference]: Without dead ends: 2961 [2024-10-11 04:23:07,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:23:07,747 INFO L432 NwaCegarLoop]: 4363 mSDtfsCounter, 5163 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5180 SdHoareTripleChecker+Valid, 21516 SdHoareTripleChecker+Invalid, 3364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:07,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5180 Valid, 21516 Invalid, 3364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 04:23:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2024-10-11 04:23:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2724. [2024-10-11 04:23:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2663 states have (on average 1.819752159218926) internal successors, (4846), 2667 states have internal predecessors, (4846), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-11 04:23:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 4943 transitions. [2024-10-11 04:23:07,809 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 4943 transitions. Word has length 141 [2024-10-11 04:23:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:07,810 INFO L471 AbstractCegarLoop]: Abstraction has 2724 states and 4943 transitions. [2024-10-11 04:23:07,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 4943 transitions. [2024-10-11 04:23:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:07,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:07,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:23:07,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:07,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:07,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1138362748, now seen corresponding path program 1 times [2024-10-11 04:23:07,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:07,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813406427] [2024-10-11 04:23:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:07,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:07,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:08,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:08,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:08,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813406427] [2024-10-11 04:23:08,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813406427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:08,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:08,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:08,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49747778] [2024-10-11 04:23:08,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:08,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:08,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:08,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:08,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:08,051 INFO L87 Difference]: Start difference. First operand 2724 states and 4943 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:10,608 INFO L93 Difference]: Finished difference Result 4288 states and 7546 transitions. [2024-10-11 04:23:10,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:10,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:10,621 INFO L225 Difference]: With dead ends: 4288 [2024-10-11 04:23:10,622 INFO L226 Difference]: Without dead ends: 3703 [2024-10-11 04:23:10,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:23:10,625 INFO L432 NwaCegarLoop]: 4311 mSDtfsCounter, 5204 mSDsluCounter, 17089 mSDsCounter, 0 mSdLazyCounter, 2989 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5221 SdHoareTripleChecker+Valid, 21400 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:10,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5221 Valid, 21400 Invalid, 3059 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [70 Valid, 2989 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:23:10,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2024-10-11 04:23:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 3278. [2024-10-11 04:23:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7873617693522907) internal successors, (5657), 3171 states have internal predecessors, (5657), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:23:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5840 transitions. [2024-10-11 04:23:10,743 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5840 transitions. Word has length 141 [2024-10-11 04:23:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:10,743 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5840 transitions. [2024-10-11 04:23:10,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5840 transitions. [2024-10-11 04:23:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:10,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:10,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:10,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:23:10,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:10,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2063969346, now seen corresponding path program 1 times [2024-10-11 04:23:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:10,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254807130] [2024-10-11 04:23:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:10,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:10,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:10,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:11,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:11,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254807130] [2024-10-11 04:23:11,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254807130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:11,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:11,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:11,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828018639] [2024-10-11 04:23:11,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:11,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:11,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:11,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:11,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:11,014 INFO L87 Difference]: Start difference. First operand 3278 states and 5840 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:12,242 INFO L93 Difference]: Finished difference Result 4857 states and 8484 transitions. [2024-10-11 04:23:12,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:23:12,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:12,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:12,254 INFO L225 Difference]: With dead ends: 4857 [2024-10-11 04:23:12,254 INFO L226 Difference]: Without dead ends: 3716 [2024-10-11 04:23:12,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:23:12,258 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 5000 mSDsluCounter, 12398 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5018 SdHoareTripleChecker+Valid, 16573 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:12,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5018 Valid, 16573 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:23:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2024-10-11 04:23:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3278. [2024-10-11 04:23:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.785781990521327) internal successors, (5652), 3171 states have internal predecessors, (5652), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:23:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5835 transitions. [2024-10-11 04:23:12,406 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5835 transitions. Word has length 141 [2024-10-11 04:23:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:12,407 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5835 transitions. [2024-10-11 04:23:12,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5835 transitions. [2024-10-11 04:23:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:12,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:12,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:12,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:23:12,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:12,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:12,414 INFO L85 PathProgramCache]: Analyzing trace with hash 781797060, now seen corresponding path program 1 times [2024-10-11 04:23:12,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:12,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355907350] [2024-10-11 04:23:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:12,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355907350] [2024-10-11 04:23:12,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355907350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:12,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:12,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:12,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420533848] [2024-10-11 04:23:12,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:12,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:12,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:12,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:12,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:12,579 INFO L87 Difference]: Start difference. First operand 3278 states and 5835 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:13,660 INFO L93 Difference]: Finished difference Result 4853 states and 8463 transitions. [2024-10-11 04:23:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:23:13,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:13,672 INFO L225 Difference]: With dead ends: 4853 [2024-10-11 04:23:13,672 INFO L226 Difference]: Without dead ends: 3712 [2024-10-11 04:23:13,675 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-11 04:23:13,676 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4998 mSDsluCounter, 12398 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5016 SdHoareTripleChecker+Valid, 16573 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:13,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5016 Valid, 16573 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:23:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2024-10-11 04:23:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3278. [2024-10-11 04:23:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7842022116903633) internal successors, (5647), 3171 states have internal predecessors, (5647), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:23:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5830 transitions. [2024-10-11 04:23:13,775 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5830 transitions. Word has length 141 [2024-10-11 04:23:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:13,775 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5830 transitions. [2024-10-11 04:23:13,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5830 transitions. [2024-10-11 04:23:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:13,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:13,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:13,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:23:13,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:13,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:13,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1060678654, now seen corresponding path program 1 times [2024-10-11 04:23:13,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:13,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564864750] [2024-10-11 04:23:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:13,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:13,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:13,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:13,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:13,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564864750] [2024-10-11 04:23:13,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564864750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:13,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:13,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188929125] [2024-10-11 04:23:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:13,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:13,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:13,971 INFO L87 Difference]: Start difference. First operand 3278 states and 5830 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:15,116 INFO L93 Difference]: Finished difference Result 4848 states and 8440 transitions. [2024-10-11 04:23:15,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:23:15,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:15,128 INFO L225 Difference]: With dead ends: 4848 [2024-10-11 04:23:15,128 INFO L226 Difference]: Without dead ends: 3707 [2024-10-11 04:23:15,132 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-11 04:23:15,132 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4867 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4885 SdHoareTripleChecker+Valid, 20671 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:15,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4885 Valid, 20671 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:23:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2024-10-11 04:23:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3278. [2024-10-11 04:23:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7826224328593996) internal successors, (5642), 3171 states have internal predecessors, (5642), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:23:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5825 transitions. [2024-10-11 04:23:15,218 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5825 transitions. Word has length 141 [2024-10-11 04:23:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:15,218 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5825 transitions. [2024-10-11 04:23:15,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5825 transitions. [2024-10-11 04:23:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:15,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:15,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:15,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:23:15,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:15,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:15,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1512285956, now seen corresponding path program 1 times [2024-10-11 04:23:15,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:15,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820675580] [2024-10-11 04:23:15,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:15,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:15,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:15,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:15,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:15,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:15,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:15,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820675580] [2024-10-11 04:23:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820675580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:15,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:15,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270868550] [2024-10-11 04:23:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:15,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:15,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:15,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:15,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:15,469 INFO L87 Difference]: Start difference. First operand 3278 states and 5825 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:17,936 INFO L93 Difference]: Finished difference Result 6307 states and 10801 transitions. [2024-10-11 04:23:17,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:17,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:17,954 INFO L225 Difference]: With dead ends: 6307 [2024-10-11 04:23:17,954 INFO L226 Difference]: Without dead ends: 5168 [2024-10-11 04:23:17,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:23:17,959 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5154 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3198 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5171 SdHoareTripleChecker+Valid, 21511 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:17,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5171 Valid, 21511 Invalid, 3262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3198 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:23:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2024-10-11 04:23:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 4397. [2024-10-11 04:23:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 4180 states have (on average 1.7375598086124402) internal successors, (7263), 4190 states have internal predecessors, (7263), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-11 04:23:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7624 transitions. [2024-10-11 04:23:18,092 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7624 transitions. Word has length 141 [2024-10-11 04:23:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:18,093 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7624 transitions. [2024-10-11 04:23:18,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7624 transitions. [2024-10-11 04:23:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:18,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:18,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:18,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:23:18,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:18,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1179642818, now seen corresponding path program 1 times [2024-10-11 04:23:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:18,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837154666] [2024-10-11 04:23:18,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:18,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:18,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:18,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:18,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:18,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:18,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:18,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837154666] [2024-10-11 04:23:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837154666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:18,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353826391] [2024-10-11 04:23:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:18,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:18,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:18,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:18,279 INFO L87 Difference]: Start difference. First operand 4397 states and 7624 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:19,622 INFO L93 Difference]: Finished difference Result 7464 states and 12699 transitions. [2024-10-11 04:23:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:23:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:19,637 INFO L225 Difference]: With dead ends: 7464 [2024-10-11 04:23:19,637 INFO L226 Difference]: Without dead ends: 5204 [2024-10-11 04:23:19,643 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-11 04:23:19,643 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4871 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4889 SdHoareTripleChecker+Valid, 20671 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:19,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4889 Valid, 20671 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:23:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2024-10-11 04:23:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4397. [2024-10-11 04:23:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 4180 states have (on average 1.7354066985645933) internal successors, (7254), 4190 states have internal predecessors, (7254), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-11 04:23:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7615 transitions. [2024-10-11 04:23:19,780 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7615 transitions. Word has length 141 [2024-10-11 04:23:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:19,781 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7615 transitions. [2024-10-11 04:23:19,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7615 transitions. [2024-10-11 04:23:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:19,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:19,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:19,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:23:19,785 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:19,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1186392252, now seen corresponding path program 1 times [2024-10-11 04:23:19,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:19,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524326042] [2024-10-11 04:23:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:19,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:19,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:19,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:19,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:19,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:19,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:19,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:19,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524326042] [2024-10-11 04:23:19,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524326042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:19,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:19,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:19,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611700885] [2024-10-11 04:23:19,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:19,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:19,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:19,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:19,969 INFO L87 Difference]: Start difference. First operand 4397 states and 7615 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:22,698 INFO L93 Difference]: Finished difference Result 10354 states and 17366 transitions. [2024-10-11 04:23:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:22,721 INFO L225 Difference]: With dead ends: 10354 [2024-10-11 04:23:22,721 INFO L226 Difference]: Without dead ends: 8096 [2024-10-11 04:23:22,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:23:22,729 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5186 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3078 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5203 SdHoareTripleChecker+Valid, 21511 SdHoareTripleChecker+Invalid, 3142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:22,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5203 Valid, 21511 Invalid, 3142 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 3078 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:23:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2024-10-11 04:23:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6657. [2024-10-11 04:23:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6232 states have (on average 1.6882220795892169) internal successors, (10521), 6250 states have internal predecessors, (10521), 311 states have call successors, (311), 96 states have call predecessors, (311), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-10-11 04:23:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 11256 transitions. [2024-10-11 04:23:23,034 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 11256 transitions. Word has length 141 [2024-10-11 04:23:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:23,034 INFO L471 AbstractCegarLoop]: Abstraction has 6657 states and 11256 transitions. [2024-10-11 04:23:23,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 11256 transitions. [2024-10-11 04:23:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:23,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:23,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:23,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:23:23,038 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:23,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:23,039 INFO L85 PathProgramCache]: Analyzing trace with hash 540752710, now seen corresponding path program 1 times [2024-10-11 04:23:23,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:23,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532724761] [2024-10-11 04:23:23,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:23,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:23,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:23,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:23,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:23,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:23,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:23,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532724761] [2024-10-11 04:23:23,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532724761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:23,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:23,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:23,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337077177] [2024-10-11 04:23:23,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:23,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:23,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:23,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:23,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:23,206 INFO L87 Difference]: Start difference. First operand 6657 states and 11256 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:25,764 INFO L93 Difference]: Finished difference Result 18478 states and 30647 transitions. [2024-10-11 04:23:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:25,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:25,806 INFO L225 Difference]: With dead ends: 18478 [2024-10-11 04:23:25,806 INFO L226 Difference]: Without dead ends: 13960 [2024-10-11 04:23:25,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:23:25,824 INFO L432 NwaCegarLoop]: 4312 mSDtfsCounter, 5212 mSDsluCounter, 17089 mSDsCounter, 0 mSdLazyCounter, 2832 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5229 SdHoareTripleChecker+Valid, 21401 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:25,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5229 Valid, 21401 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2832 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:23:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13960 states. [2024-10-11 04:23:26,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13960 to 11193. [2024-10-11 04:23:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11193 states, 10352 states have (on average 1.6498261205564142) internal successors, (17079), 10386 states have internal predecessors, (17079), 615 states have call successors, (615), 192 states have call predecessors, (615), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-10-11 04:23:26,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11193 states to 11193 states and 18616 transitions. [2024-10-11 04:23:26,319 INFO L78 Accepts]: Start accepts. Automaton has 11193 states and 18616 transitions. Word has length 141 [2024-10-11 04:23:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:26,319 INFO L471 AbstractCegarLoop]: Abstraction has 11193 states and 18616 transitions. [2024-10-11 04:23:26,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 11193 states and 18616 transitions. [2024-10-11 04:23:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:26,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:26,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:26,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:23:26,327 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:26,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1012109060, now seen corresponding path program 1 times [2024-10-11 04:23:26,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:26,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459605301] [2024-10-11 04:23:26,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:26,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:26,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:26,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:26,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459605301] [2024-10-11 04:23:26,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459605301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:26,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:26,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:26,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106791788] [2024-10-11 04:23:26,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:26,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:26,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:26,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:26,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:26,627 INFO L87 Difference]: Start difference. First operand 11193 states and 18616 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:30,239 INFO L93 Difference]: Finished difference Result 38822 states and 64027 transitions. [2024-10-11 04:23:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:30,325 INFO L225 Difference]: With dead ends: 38822 [2024-10-11 04:23:30,326 INFO L226 Difference]: Without dead ends: 29768 [2024-10-11 04:23:30,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:30,359 INFO L432 NwaCegarLoop]: 4357 mSDtfsCounter, 5552 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5580 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:30,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5580 Valid, 21505 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:23:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29768 states. [2024-10-11 04:23:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29768 to 20233. [2024-10-11 04:23:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20233 states, 18592 states have (on average 1.6249462134251291) internal successors, (30211), 18658 states have internal predecessors, (30211), 1191 states have call successors, (1191), 384 states have call predecessors, (1191), 448 states have return successors, (2048), 1254 states have call predecessors, (2048), 1191 states have call successors, (2048) [2024-10-11 04:23:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20233 states to 20233 states and 33450 transitions. [2024-10-11 04:23:31,660 INFO L78 Accepts]: Start accepts. Automaton has 20233 states and 33450 transitions. Word has length 141 [2024-10-11 04:23:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:31,660 INFO L471 AbstractCegarLoop]: Abstraction has 20233 states and 33450 transitions. [2024-10-11 04:23:31,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 20233 states and 33450 transitions. [2024-10-11 04:23:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:31,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:31,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:31,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:23:31,671 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:31,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:31,671 INFO L85 PathProgramCache]: Analyzing trace with hash -635253882, now seen corresponding path program 1 times [2024-10-11 04:23:31,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:31,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365036221] [2024-10-11 04:23:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:31,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:31,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:31,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:31,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:31,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:31,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365036221] [2024-10-11 04:23:31,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365036221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:31,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:31,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:31,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223139230] [2024-10-11 04:23:31,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:31,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:31,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:31,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:31,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:31,832 INFO L87 Difference]: Start difference. First operand 20233 states and 33450 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:36,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:36,701 INFO L93 Difference]: Finished difference Result 74518 states and 123319 transitions. [2024-10-11 04:23:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:36,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:36,863 INFO L225 Difference]: With dead ends: 74518 [2024-10-11 04:23:36,863 INFO L226 Difference]: Without dead ends: 56424 [2024-10-11 04:23:36,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:36,916 INFO L432 NwaCegarLoop]: 4354 mSDtfsCounter, 5271 mSDsluCounter, 17145 mSDsCounter, 0 mSdLazyCounter, 3588 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 21499 SdHoareTripleChecker+Invalid, 3654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:36,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 21499 Invalid, 3654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3588 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 04:23:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56424 states. [2024-10-11 04:23:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56424 to 37993. [2024-10-11 04:23:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37993 states, 34784 states have (on average 1.610711821527139) internal successors, (56027), 34914 states have internal predecessors, (56027), 2311 states have call successors, (2311), 768 states have call predecessors, (2311), 896 states have return successors, (4754), 2438 states have call predecessors, (4754), 2311 states have call successors, (4754) [2024-10-11 04:23:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37993 states to 37993 states and 63092 transitions. [2024-10-11 04:23:39,368 INFO L78 Accepts]: Start accepts. Automaton has 37993 states and 63092 transitions. Word has length 141 [2024-10-11 04:23:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:39,369 INFO L471 AbstractCegarLoop]: Abstraction has 37993 states and 63092 transitions. [2024-10-11 04:23:39,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 37993 states and 63092 transitions. [2024-10-11 04:23:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:39,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:39,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:39,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:23:39,389 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:39,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1528362692, now seen corresponding path program 1 times [2024-10-11 04:23:39,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:39,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368875856] [2024-10-11 04:23:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:39,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:39,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:39,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:39,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:39,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:39,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368875856] [2024-10-11 04:23:39,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368875856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:39,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:39,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:39,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461565598] [2024-10-11 04:23:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:39,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:39,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:39,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:39,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:39,553 INFO L87 Difference]: Start difference. First operand 37993 states and 63092 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:47,298 INFO L93 Difference]: Finished difference Result 144054 states and 240647 transitions. [2024-10-11 04:23:47,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:47,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:23:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:47,651 INFO L225 Difference]: With dead ends: 144054 [2024-10-11 04:23:47,651 INFO L226 Difference]: Without dead ends: 108200 [2024-10-11 04:23:47,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:47,759 INFO L432 NwaCegarLoop]: 4357 mSDtfsCounter, 5484 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 3021 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5512 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:47,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5512 Valid, 21505 Invalid, 3088 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3021 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:23:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108200 states. [2024-10-11 04:23:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108200 to 73833. [2024-10-11 04:23:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73833 states, 67552 states have (on average 1.6031945760303175) internal successors, (108299), 67810 states have internal predecessors, (108299), 4487 states have call successors, (4487), 1536 states have call predecessors, (4487), 1792 states have return successors, (11560), 4742 states have call predecessors, (11560), 4487 states have call successors, (11560) [2024-10-11 04:23:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73833 states to 73833 states and 124346 transitions. [2024-10-11 04:23:52,948 INFO L78 Accepts]: Start accepts. Automaton has 73833 states and 124346 transitions. Word has length 141 [2024-10-11 04:23:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:52,948 INFO L471 AbstractCegarLoop]: Abstraction has 73833 states and 124346 transitions. [2024-10-11 04:23:52,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 73833 states and 124346 transitions. [2024-10-11 04:23:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:23:52,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:52,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:52,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:23:52,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:52,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:52,984 INFO L85 PathProgramCache]: Analyzing trace with hash 489778118, now seen corresponding path program 1 times [2024-10-11 04:23:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205787802] [2024-10-11 04:23:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:52,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:53,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:53,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:53,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:53,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:53,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:53,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:53,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205787802] [2024-10-11 04:23:53,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205787802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:53,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:53,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:53,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526481613] [2024-10-11 04:23:53,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:53,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:53,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:53,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:53,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:53,150 INFO L87 Difference]: Start difference. First operand 73833 states and 124346 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:06,990 INFO L93 Difference]: Finished difference Result 282038 states and 479215 transitions. [2024-10-11 04:24:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:24:06,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-11 04:24:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:08,028 INFO L225 Difference]: With dead ends: 282038 [2024-10-11 04:24:08,029 INFO L226 Difference]: Without dead ends: 210344 [2024-10-11 04:24:08,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:24:08,405 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5450 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 3013 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5478 SdHoareTripleChecker+Valid, 21506 SdHoareTripleChecker+Invalid, 3080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:08,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5478 Valid, 21506 Invalid, 3080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3013 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:24:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210344 states.