./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_label43+token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 343a266e04a35949615e598ecd53205cd1ef95f44fcd29af6bf4976fff243198 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 02:15:44,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 02:15:44,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 02:15:44,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 02:15:44,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 02:15:44,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 02:15:44,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 02:15:44,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 02:15:44,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 02:15:44,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 02:15:44,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 02:15:44,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 02:15:44,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 02:15:44,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 02:15:44,408 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 02:15:44,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 02:15:44,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 02:15:44,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 02:15:44,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 02:15:44,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 02:15:44,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 02:15:44,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 02:15:44,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 02:15:44,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 02:15:44,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 02:15:44,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 02:15:44,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 02:15:44,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 02:15:44,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 02:15:44,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 02:15:44,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 02:15:44,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 02:15:44,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:15:44,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 02:15:44,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 02:15:44,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 02:15:44,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 02:15:44,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 02:15:44,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 02:15:44,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 02:15:44,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 02:15:44,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 02:15:44,420 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 343a266e04a35949615e598ecd53205cd1ef95f44fcd29af6bf4976fff243198 [2024-10-24 02:15:44,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 02:15:44,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 02:15:44,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 02:15:44,730 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 02:15:44,731 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 02:15:44,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-2.c [2024-10-24 02:15:46,291 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 02:15:46,908 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 02:15:46,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-2.c [2024-10-24 02:15:46,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74065675/326bc13c303b4d53992de7b035a05fac/FLAGdec6dfc5f [2024-10-24 02:15:46,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74065675/326bc13c303b4d53992de7b035a05fac [2024-10-24 02:15:46,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 02:15:46,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 02:15:46,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 02:15:46,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 02:15:46,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 02:15:46,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:15:46" (1/1) ... [2024-10-24 02:15:46,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a20d295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:46, skipping insertion in model container [2024-10-24 02:15:46,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:15:46" (1/1) ... [2024-10-24 02:15:47,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 02:15:48,854 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_label43+token_ring.08.cil-2.c[381679,381692] [2024-10-24 02:15:48,881 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_label43+token_ring.08.cil-2.c[383339,383352] [2024-10-24 02:15:49,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:15:49,096 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 02:15:49,839 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_label43+token_ring.08.cil-2.c[381679,381692] [2024-10-24 02:15:49,843 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_label43+token_ring.08.cil-2.c[383339,383352] [2024-10-24 02:15:49,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:15:49,940 INFO L204 MainTranslator]: Completed translation [2024-10-24 02:15:49,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49 WrapperNode [2024-10-24 02:15:49,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 02:15:49,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 02:15:49,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 02:15:49,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 02:15:49,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:50,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:50,485 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12999 [2024-10-24 02:15:50,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 02:15:50,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 02:15:50,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 02:15:50,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 02:15:50,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:50,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:50,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:50,714 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-24 02:15:50,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:50,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:50,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:50,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:50,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:50,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:51,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 02:15:51,074 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 02:15:51,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 02:15:51,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 02:15:51,076 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (1/1) ... [2024-10-24 02:15:51,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:15:51,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:15:51,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 02:15:51,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 02:15:51,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 02:15:51,172 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-24 02:15:51,172 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-24 02:15:51,173 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 02:15:51,174 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 02:15:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-24 02:15:51,175 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-24 02:15:51,175 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-24 02:15:51,175 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-24 02:15:51,175 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-24 02:15:51,176 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-24 02:15:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-24 02:15:51,176 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-24 02:15:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-24 02:15:51,177 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-24 02:15:51,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 02:15:51,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 02:15:51,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 02:15:51,320 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 02:15:51,323 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 02:15:59,241 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-10-24 02:15:59,242 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 02:15:59,365 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 02:15:59,365 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-24 02:15:59,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:15:59 BoogieIcfgContainer [2024-10-24 02:15:59,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 02:15:59,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 02:15:59,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 02:15:59,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 02:15:59,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:15:46" (1/3) ... [2024-10-24 02:15:59,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c143651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:15:59, skipping insertion in model container [2024-10-24 02:15:59,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:15:49" (2/3) ... [2024-10-24 02:15:59,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c143651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:15:59, skipping insertion in model container [2024-10-24 02:15:59,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:15:59" (3/3) ... [2024-10-24 02:15:59,375 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.08.cil-2.c [2024-10-24 02:15:59,393 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 02:15:59,393 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 02:15:59,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 02:15:59,530 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;@35e0b0dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 02:15:59,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 02:15:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 2387 states, 2353 states have (on average 1.87972800679983) internal successors, (4423), 2358 states have internal predecessors, (4423), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 02:15:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:15:59,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:15:59,567 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] [2024-10-24 02:15:59,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:15:59,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:15:59,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2069738272, now seen corresponding path program 1 times [2024-10-24 02:15:59,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:15:59,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033715751] [2024-10-24 02:15:59,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:15:59,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:15:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:15:59,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:15:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:00,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:00,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:00,206 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-24 02:16:00,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:00,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033715751] [2024-10-24 02:16:00,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033715751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:00,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:00,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:16:00,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518191693] [2024-10-24 02:16:00,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:00,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:16:00,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:00,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:16:00,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:16:00,255 INFO L87 Difference]: Start difference. First operand has 2387 states, 2353 states have (on average 1.87972800679983) internal successors, (4423), 2358 states have internal predecessors, (4423), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:02,005 INFO L93 Difference]: Finished difference Result 4859 states and 9094 transitions. [2024-10-24 02:16:02,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 02:16:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:02,037 INFO L225 Difference]: With dead ends: 4859 [2024-10-24 02:16:02,037 INFO L226 Difference]: Without dead ends: 2472 [2024-10-24 02:16:02,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:16:02,055 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 709 mSDsluCounter, 12134 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 16326 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:02,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 16326 Invalid, 811 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 02:16:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2024-10-24 02:16:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2382. [2024-10-24 02:16:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2350 states have (on average 1.8429787234042554) internal successors, (4331), 2353 states have internal predecessors, (4331), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 02:16:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 4377 transitions. [2024-10-24 02:16:02,222 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 4377 transitions. Word has length 122 [2024-10-24 02:16:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:02,223 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 4377 transitions. [2024-10-24 02:16:02,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 4377 transitions. [2024-10-24 02:16:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:02,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:02,229 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] [2024-10-24 02:16:02,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 02:16:02,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:02,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:02,230 INFO L85 PathProgramCache]: Analyzing trace with hash 140806046, now seen corresponding path program 1 times [2024-10-24 02:16:02,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:02,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430525890] [2024-10-24 02:16:02,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:02,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:02,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:02,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:02,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:02,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:02,594 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-24 02:16:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430525890] [2024-10-24 02:16:02,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430525890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:02,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:02,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 02:16:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708482377] [2024-10-24 02:16:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:02,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 02:16:02,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:02,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 02:16:02,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:16:02,598 INFO L87 Difference]: Start difference. First operand 2382 states and 4377 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:04,777 INFO L93 Difference]: Finished difference Result 3067 states and 5511 transitions. [2024-10-24 02:16:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 02:16:04,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:04,796 INFO L225 Difference]: With dead ends: 3067 [2024-10-24 02:16:04,796 INFO L226 Difference]: Without dead ends: 2820 [2024-10-24 02:16:04,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:16:04,801 INFO L432 NwaCegarLoop]: 4165 mSDtfsCounter, 5014 mSDsluCounter, 12483 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5029 SdHoareTripleChecker+Valid, 16648 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:04,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5029 Valid, 16648 Invalid, 1727 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 02:16:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2024-10-24 02:16:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2639. [2024-10-24 02:16:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2583 states have (on average 1.8246225319396052) internal successors, (4713), 2587 states have internal predecessors, (4713), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-24 02:16:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4796 transitions. [2024-10-24 02:16:05,019 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4796 transitions. Word has length 122 [2024-10-24 02:16:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:05,020 INFO L471 AbstractCegarLoop]: Abstraction has 2639 states and 4796 transitions. [2024-10-24 02:16:05,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4796 transitions. [2024-10-24 02:16:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:05,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:05,023 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] [2024-10-24 02:16:05,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 02:16:05,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:05,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash -135119266, now seen corresponding path program 1 times [2024-10-24 02:16:05,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:05,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985926754] [2024-10-24 02:16:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:05,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:05,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:05,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:05,347 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-24 02:16:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:05,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985926754] [2024-10-24 02:16:05,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985926754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:05,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:05,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61793152] [2024-10-24 02:16:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:05,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:05,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:05,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:05,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:05,350 INFO L87 Difference]: Start difference. First operand 2639 states and 4796 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:08,168 INFO L93 Difference]: Finished difference Result 3682 states and 6521 transitions. [2024-10-24 02:16:08,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:16:08,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:08,184 INFO L225 Difference]: With dead ends: 3682 [2024-10-24 02:16:08,185 INFO L226 Difference]: Without dead ends: 3178 [2024-10-24 02:16:08,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:16:08,193 INFO L432 NwaCegarLoop]: 4322 mSDtfsCounter, 5033 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5048 SdHoareTripleChecker+Valid, 21346 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:08,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5048 Valid, 21346 Invalid, 2710 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2653 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 02:16:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2024-10-24 02:16:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2877. [2024-10-24 02:16:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2797 states have (on average 1.8080085806220951) internal successors, (5057), 2802 states have internal predecessors, (5057), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-24 02:16:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 5176 transitions. [2024-10-24 02:16:08,403 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 5176 transitions. Word has length 122 [2024-10-24 02:16:08,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:08,404 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 5176 transitions. [2024-10-24 02:16:08,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 5176 transitions. [2024-10-24 02:16:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:08,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:08,408 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] [2024-10-24 02:16:08,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 02:16:08,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:08,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:08,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1254174748, now seen corresponding path program 1 times [2024-10-24 02:16:08,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:08,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126498895] [2024-10-24 02:16:08,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:08,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:08,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:08,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:08,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:08,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:08,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:08,652 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-24 02:16:08,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:08,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126498895] [2024-10-24 02:16:08,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126498895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:08,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:08,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293920890] [2024-10-24 02:16:08,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:08,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:08,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:08,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:08,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:08,656 INFO L87 Difference]: Start difference. First operand 2877 states and 5176 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:11,057 INFO L93 Difference]: Finished difference Result 4583 states and 7993 transitions. [2024-10-24 02:16:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:16:11,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:11,082 INFO L225 Difference]: With dead ends: 4583 [2024-10-24 02:16:11,082 INFO L226 Difference]: Without dead ends: 3841 [2024-10-24 02:16:11,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:16:11,092 INFO L432 NwaCegarLoop]: 4174 mSDtfsCounter, 5113 mSDsluCounter, 16625 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5128 SdHoareTripleChecker+Valid, 20799 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:11,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5128 Valid, 20799 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 02:16:11,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2024-10-24 02:16:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3354. [2024-10-24 02:16:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.7811531308121513) internal successors, (5746), 3233 states have internal predecessors, (5746), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-24 02:16:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5941 transitions. [2024-10-24 02:16:11,255 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5941 transitions. Word has length 122 [2024-10-24 02:16:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:11,255 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5941 transitions. [2024-10-24 02:16:11,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5941 transitions. [2024-10-24 02:16:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:11,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:11,259 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] [2024-10-24 02:16:11,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 02:16:11,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:11,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash -779219298, now seen corresponding path program 1 times [2024-10-24 02:16:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:11,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461050159] [2024-10-24 02:16:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:11,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:11,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:11,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:11,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:11,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:11,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:11,553 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-24 02:16:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461050159] [2024-10-24 02:16:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461050159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:11,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:11,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:11,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110113931] [2024-10-24 02:16:11,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:11,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:11,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:11,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:11,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:11,558 INFO L87 Difference]: Start difference. First operand 3354 states and 5941 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:13,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:13,064 INFO L93 Difference]: Finished difference Result 5048 states and 8749 transitions. [2024-10-24 02:16:13,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:16:13,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:13,084 INFO L225 Difference]: With dead ends: 5048 [2024-10-24 02:16:13,085 INFO L226 Difference]: Without dead ends: 3829 [2024-10-24 02:16:13,090 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-24 02:16:13,091 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4742 mSDsluCounter, 16424 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4758 SdHoareTripleChecker+Valid, 20576 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:13,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4758 Valid, 20576 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 02:16:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2024-10-24 02:16:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 3354. [2024-10-24 02:16:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.7796032238065715) internal successors, (5741), 3233 states have internal predecessors, (5741), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-24 02:16:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5936 transitions. [2024-10-24 02:16:13,263 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5936 transitions. Word has length 122 [2024-10-24 02:16:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:13,264 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5936 transitions. [2024-10-24 02:16:13,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5936 transitions. [2024-10-24 02:16:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:13,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:13,267 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] [2024-10-24 02:16:13,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 02:16:13,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:13,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:13,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1649039324, now seen corresponding path program 1 times [2024-10-24 02:16:13,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:13,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3829782] [2024-10-24 02:16:13,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:13,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:13,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:13,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:13,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:13,500 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-24 02:16:13,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:13,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3829782] [2024-10-24 02:16:13,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3829782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:13,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:13,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203473064] [2024-10-24 02:16:13,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:13,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:13,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:13,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:13,504 INFO L87 Difference]: Start difference. First operand 3354 states and 5936 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:14,758 INFO L93 Difference]: Finished difference Result 5037 states and 8713 transitions. [2024-10-24 02:16:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:16:14,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:14,775 INFO L225 Difference]: With dead ends: 5037 [2024-10-24 02:16:14,776 INFO L226 Difference]: Without dead ends: 3818 [2024-10-24 02:16:14,782 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-24 02:16:14,784 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4848 mSDsluCounter, 12339 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4864 SdHoareTripleChecker+Valid, 16491 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:14,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4864 Valid, 16491 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 02:16:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2024-10-24 02:16:14,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3354. [2024-10-24 02:16:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.778053316800992) internal successors, (5736), 3233 states have internal predecessors, (5736), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-24 02:16:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5931 transitions. [2024-10-24 02:16:14,977 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5931 transitions. Word has length 122 [2024-10-24 02:16:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:14,978 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5931 transitions. [2024-10-24 02:16:14,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5931 transitions. [2024-10-24 02:16:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:14,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:14,981 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] [2024-10-24 02:16:14,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 02:16:14,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:14,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash -748431206, now seen corresponding path program 1 times [2024-10-24 02:16:14,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:14,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748189959] [2024-10-24 02:16:14,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:14,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:15,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:15,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:15,251 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-24 02:16:15,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:15,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748189959] [2024-10-24 02:16:15,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748189959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:15,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:15,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:15,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027170839] [2024-10-24 02:16:15,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:15,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:15,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:15,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:15,254 INFO L87 Difference]: Start difference. First operand 3354 states and 5931 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:17,906 INFO L93 Difference]: Finished difference Result 6295 states and 10728 transitions. [2024-10-24 02:16:17,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:16:17,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:17,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:17,945 INFO L225 Difference]: With dead ends: 6295 [2024-10-24 02:16:17,946 INFO L226 Difference]: Without dead ends: 5076 [2024-10-24 02:16:17,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:16:17,956 INFO L432 NwaCegarLoop]: 4320 mSDtfsCounter, 5016 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5031 SdHoareTripleChecker+Valid, 21344 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:17,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5031 Valid, 21344 Invalid, 2633 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 02:16:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2024-10-24 02:16:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 4323. [2024-10-24 02:16:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4323 states, 4099 states have (on average 1.738716760185411) internal successors, (7127), 4110 states have internal predecessors, (7127), 160 states have call successors, (160), 55 states have call predecessors, (160), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-24 02:16:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 7480 transitions. [2024-10-24 02:16:18,143 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 7480 transitions. Word has length 122 [2024-10-24 02:16:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:18,144 INFO L471 AbstractCegarLoop]: Abstraction has 4323 states and 7480 transitions. [2024-10-24 02:16:18,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 7480 transitions. [2024-10-24 02:16:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:18,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:18,148 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] [2024-10-24 02:16:18,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 02:16:18,148 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:18,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash 282609692, now seen corresponding path program 1 times [2024-10-24 02:16:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:18,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351337809] [2024-10-24 02:16:18,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:18,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:18,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:18,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:18,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:18,338 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-24 02:16:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:18,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351337809] [2024-10-24 02:16:18,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351337809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:18,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:18,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65741324] [2024-10-24 02:16:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:18,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:18,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:18,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:18,344 INFO L87 Difference]: Start difference. First operand 4323 states and 7480 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:19,816 INFO L93 Difference]: Finished difference Result 7271 states and 12318 transitions. [2024-10-24 02:16:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:16:19,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:19,838 INFO L225 Difference]: With dead ends: 7271 [2024-10-24 02:16:19,838 INFO L226 Difference]: Without dead ends: 5083 [2024-10-24 02:16:19,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:16:19,848 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4738 mSDsluCounter, 16424 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 20576 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:19,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 20576 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 02:16:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2024-10-24 02:16:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 4323. [2024-10-24 02:16:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4323 states, 4099 states have (on average 1.7365211027079777) internal successors, (7118), 4110 states have internal predecessors, (7118), 160 states have call successors, (160), 55 states have call predecessors, (160), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-24 02:16:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 7471 transitions. [2024-10-24 02:16:20,045 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 7471 transitions. Word has length 122 [2024-10-24 02:16:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:20,045 INFO L471 AbstractCegarLoop]: Abstraction has 4323 states and 7471 transitions. [2024-10-24 02:16:20,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 7471 transitions. [2024-10-24 02:16:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:20,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:20,049 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] [2024-10-24 02:16:20,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 02:16:20,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:20,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:20,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1623793574, now seen corresponding path program 1 times [2024-10-24 02:16:20,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:20,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251743812] [2024-10-24 02:16:20,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:20,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:20,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:20,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:20,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:20,266 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-24 02:16:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:20,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251743812] [2024-10-24 02:16:20,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251743812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:20,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:20,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736530900] [2024-10-24 02:16:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:20,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:20,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:20,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:20,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:20,270 INFO L87 Difference]: Start difference. First operand 4323 states and 7471 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:22,691 INFO L93 Difference]: Finished difference Result 9746 states and 16269 transitions. [2024-10-24 02:16:22,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:16:22,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:22,720 INFO L225 Difference]: With dead ends: 9746 [2024-10-24 02:16:22,720 INFO L226 Difference]: Without dead ends: 7558 [2024-10-24 02:16:22,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:16:22,732 INFO L432 NwaCegarLoop]: 4320 mSDtfsCounter, 5008 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5023 SdHoareTripleChecker+Valid, 21344 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:22,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5023 Valid, 21344 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 02:16:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2024-10-24 02:16:22,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 6271. [2024-10-24 02:16:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6271 states, 5855 states have (on average 1.690862510674637) internal successors, (9900), 5874 states have internal predecessors, (9900), 296 states have call successors, (296), 103 states have call predecessors, (296), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-24 02:16:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6271 states to 6271 states and 10587 transitions. [2024-10-24 02:16:23,019 INFO L78 Accepts]: Start accepts. Automaton has 6271 states and 10587 transitions. Word has length 122 [2024-10-24 02:16:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:23,019 INFO L471 AbstractCegarLoop]: Abstraction has 6271 states and 10587 transitions. [2024-10-24 02:16:23,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6271 states and 10587 transitions. [2024-10-24 02:16:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:23,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:23,024 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] [2024-10-24 02:16:23,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 02:16:23,025 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:23,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:23,025 INFO L85 PathProgramCache]: Analyzing trace with hash -22722468, now seen corresponding path program 1 times [2024-10-24 02:16:23,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:23,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256086832] [2024-10-24 02:16:23,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:23,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:23,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:23,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:23,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:23,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:23,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:16:23,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:23,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256086832] [2024-10-24 02:16:23,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256086832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:23,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:23,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:23,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744268615] [2024-10-24 02:16:23,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:23,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:23,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:23,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:23,330 INFO L87 Difference]: Start difference. First operand 6271 states and 10587 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:26,345 INFO L93 Difference]: Finished difference Result 18328 states and 30157 transitions. [2024-10-24 02:16:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:16:26,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:26,399 INFO L225 Difference]: With dead ends: 18328 [2024-10-24 02:16:26,400 INFO L226 Difference]: Without dead ends: 14192 [2024-10-24 02:16:26,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:16:26,421 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5301 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5325 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:26,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5325 Valid, 21337 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 02:16:26,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14192 states. [2024-10-24 02:16:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14192 to 10148. [2024-10-24 02:16:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10148 states, 9364 states have (on average 1.6516445963263562) internal successors, (15466), 9399 states have internal predecessors, (15466), 552 states have call successors, (552), 199 states have call predecessors, (552), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-10-24 02:16:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10148 states to 10148 states and 16843 transitions. [2024-10-24 02:16:27,062 INFO L78 Accepts]: Start accepts. Automaton has 10148 states and 16843 transitions. Word has length 122 [2024-10-24 02:16:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:27,062 INFO L471 AbstractCegarLoop]: Abstraction has 10148 states and 16843 transitions. [2024-10-24 02:16:27,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 10148 states and 16843 transitions. [2024-10-24 02:16:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:27,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:27,070 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] [2024-10-24 02:16:27,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 02:16:27,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:27,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:27,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1079453670, now seen corresponding path program 1 times [2024-10-24 02:16:27,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:27,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445757200] [2024-10-24 02:16:27,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:27,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:27,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:27,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:27,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:27,262 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-24 02:16:27,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:27,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445757200] [2024-10-24 02:16:27,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445757200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:27,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:27,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425059902] [2024-10-24 02:16:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:27,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:27,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:27,265 INFO L87 Difference]: Start difference. First operand 10148 states and 16843 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:31,154 INFO L93 Difference]: Finished difference Result 33379 states and 54727 transitions. [2024-10-24 02:16:31,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:16:31,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:31,265 INFO L225 Difference]: With dead ends: 33379 [2024-10-24 02:16:31,266 INFO L226 Difference]: Without dead ends: 25366 [2024-10-24 02:16:31,304 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-24 02:16:31,305 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 5136 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5150 SdHoareTripleChecker+Valid, 20847 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:31,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5150 Valid, 20847 Invalid, 2731 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [87 Valid, 2644 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 02:16:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25366 states. [2024-10-24 02:16:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25366 to 17581. [2024-10-24 02:16:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17581 states, 16077 states have (on average 1.620451576786714) internal successors, (26052), 16144 states have internal predecessors, (26052), 1048 states have call successors, (1048), 391 states have call predecessors, (1048), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-24 02:16:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17581 states to 17581 states and 28939 transitions. [2024-10-24 02:16:32,330 INFO L78 Accepts]: Start accepts. Automaton has 17581 states and 28939 transitions. Word has length 122 [2024-10-24 02:16:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:32,331 INFO L471 AbstractCegarLoop]: Abstraction has 17581 states and 28939 transitions. [2024-10-24 02:16:32,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 17581 states and 28939 transitions. [2024-10-24 02:16:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:32,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:32,343 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] [2024-10-24 02:16:32,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 02:16:32,343 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:32,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash 271931548, now seen corresponding path program 1 times [2024-10-24 02:16:32,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:32,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924718361] [2024-10-24 02:16:32,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:32,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:32,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:32,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:32,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:32,728 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-24 02:16:32,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:32,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924718361] [2024-10-24 02:16:32,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924718361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:32,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:32,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:32,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583235517] [2024-10-24 02:16:32,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:32,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:32,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:32,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:32,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:32,730 INFO L87 Difference]: Start difference. First operand 17581 states and 28939 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:37,500 INFO L93 Difference]: Finished difference Result 62074 states and 101957 transitions. [2024-10-24 02:16:37,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:16:37,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:37,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:37,740 INFO L225 Difference]: With dead ends: 62074 [2024-10-24 02:16:37,741 INFO L226 Difference]: Without dead ends: 46628 [2024-10-24 02:16:37,813 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-24 02:16:37,814 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5235 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5259 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:37,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5259 Valid, 21337 Invalid, 2544 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 02:16:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46628 states. [2024-10-24 02:16:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46628 to 32766. [2024-10-24 02:16:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32766 states, 29854 states have (on average 1.603202250954646) internal successors, (47862), 29985 states have internal predecessors, (47862), 2008 states have call successors, (2008), 775 states have call predecessors, (2008), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-10-24 02:16:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32766 states to 32766 states and 54191 transitions. [2024-10-24 02:16:40,138 INFO L78 Accepts]: Start accepts. Automaton has 32766 states and 54191 transitions. Word has length 122 [2024-10-24 02:16:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:40,138 INFO L471 AbstractCegarLoop]: Abstraction has 32766 states and 54191 transitions. [2024-10-24 02:16:40,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 32766 states and 54191 transitions. [2024-10-24 02:16:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:40,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:40,162 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] [2024-10-24 02:16:40,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 02:16:40,163 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:40,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1347043366, now seen corresponding path program 1 times [2024-10-24 02:16:40,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:40,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023304885] [2024-10-24 02:16:40,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:40,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:40,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:40,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:40,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:40,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:40,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:16:40,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:40,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023304885] [2024-10-24 02:16:40,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023304885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:40,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:40,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:40,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143573680] [2024-10-24 02:16:40,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:40,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:40,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:40,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:40,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:40,357 INFO L87 Difference]: Start difference. First operand 32766 states and 54191 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:16:47,688 INFO L93 Difference]: Finished difference Result 117735 states and 195799 transitions. [2024-10-24 02:16:47,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:16:47,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-24 02:16:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:16:48,311 INFO L225 Difference]: With dead ends: 117735 [2024-10-24 02:16:48,311 INFO L226 Difference]: Without dead ends: 87104 [2024-10-24 02:16:48,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:16:48,413 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5044 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2770 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5058 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:16:48,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5058 Valid, 21337 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2770 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 02:16:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87104 states. [2024-10-24 02:16:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87104 to 63264. [2024-10-24 02:16:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63264 states, 57600 states have (on average 1.5948958333333334) internal successors, (91866), 57859 states have internal predecessors, (91866), 3864 states have call successors, (3864), 1543 states have call predecessors, (3864), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-10-24 02:16:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63264 states to 63264 states and 106409 transitions. [2024-10-24 02:16:53,510 INFO L78 Accepts]: Start accepts. Automaton has 63264 states and 106409 transitions. Word has length 122 [2024-10-24 02:16:53,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:16:53,510 INFO L471 AbstractCegarLoop]: Abstraction has 63264 states and 106409 transitions. [2024-10-24 02:16:53,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:16:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 63264 states and 106409 transitions. [2024-10-24 02:16:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 02:16:53,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:16:53,608 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] [2024-10-24 02:16:53,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 02:16:53,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:16:53,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:16:53,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1375543656, now seen corresponding path program 1 times [2024-10-24 02:16:53,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:16:53,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215847975] [2024-10-24 02:16:53,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:16:53,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:16:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:53,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:16:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:53,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:16:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:16:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:53,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:16:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:53,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:16:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:16:53,811 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-24 02:16:53,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:16:53,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215847975] [2024-10-24 02:16:53,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215847975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:16:53,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:16:53,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:16:53,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392711065] [2024-10-24 02:16:53,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:16:53,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:16:53,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:16:53,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:16:53,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:16:53,815 INFO L87 Difference]: Start difference. First operand 63264 states and 106409 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)