./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_label45+token_ring.14.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.14.cil.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 5c885e36ce67f972719c7330e2fdf8e1794f0d30dd144b261109fa7b0892a972 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:01:50,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:01:50,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:01:50,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:01:50,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:01:50,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:01:50,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:01:50,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:01:50,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:01:50,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:01:50,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:01:50,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:01:50,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:01:50,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:01:50,509 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:01:50,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:01:50,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:01:50,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:01:50,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:01:50,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:01:50,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:01:50,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:01:50,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:01:50,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:01:50,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:01:50,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:01:50,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:01:50,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:01:50,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:01:50,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:01:50,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:01:50,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:01:50,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:01:50,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:01:50,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:01:50,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:01:50,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:01:50,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:01:50,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:01:50,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:01:50,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:01:50,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:01:50,530 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 -> 5c885e36ce67f972719c7330e2fdf8e1794f0d30dd144b261109fa7b0892a972 [2024-10-12 21:01:50,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:01:50,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:01:50,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:01:50,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:01:50,817 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:01:50,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.14.cil.c [2024-10-12 21:01:52,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:01:52,852 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:01:52,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.14.cil.c [2024-10-12 21:01:52,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fafc9e77/9aad95286a6349569bca66720319b01e/FLAGe10a97418 [2024-10-12 21:01:52,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fafc9e77/9aad95286a6349569bca66720319b01e [2024-10-12 21:01:52,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:01:52,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:01:52,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:01:52,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:01:52,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:01:52,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:01:52" (1/1) ... [2024-10-12 21:01:52,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb0cf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:52, skipping insertion in model container [2024-10-12 21:01:52,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:01:52" (1/1) ... [2024-10-12 21:01:53,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:01:54,812 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_label45+token_ring.14.cil.c[380323,380336] [2024-10-12 21:01:54,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_label45+token_ring.14.cil.c[383339,383352] [2024-10-12 21:01:55,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:01:55,081 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:01:55,858 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_label45+token_ring.14.cil.c[380323,380336] [2024-10-12 21:01:55,865 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_label45+token_ring.14.cil.c[383339,383352] [2024-10-12 21:01:55,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:01:55,964 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:01:55,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55 WrapperNode [2024-10-12 21:01:55,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:01:55,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:01:55,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:01:55,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:01:55,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:56,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:56,534 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13237 [2024-10-12 21:01:56,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:01:56,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:01:56,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:01:56,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:01:56,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:56,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:56,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:56,697 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:01:56,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:56,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:56,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:56,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:56,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:56,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:57,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:01:57,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:01:57,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:01:57,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:01:57,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:57,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:01:57,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:01:57,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:01:57,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:01:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:01:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 21:01:57,133 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 21:01:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:01:57,134 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:01:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 21:01:57,135 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 21:01:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 21:01:57,135 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 21:01:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 21:01:57,135 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 21:01:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 21:01:57,135 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 21:01:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 21:01:57,136 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 21:01:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:01:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:01:57,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:01:57,301 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:01:57,303 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:02:04,993 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2024-10-12 21:02:04,994 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:02:05,108 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:02:05,109 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-12 21:02:05,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:02:05 BoogieIcfgContainer [2024-10-12 21:02:05,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:02:05,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:02:05,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:02:05,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:02:05,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:01:52" (1/3) ... [2024-10-12 21:02:05,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b72f1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:02:05, skipping insertion in model container [2024-10-12 21:02:05,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55" (2/3) ... [2024-10-12 21:02:05,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b72f1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:02:05, skipping insertion in model container [2024-10-12 21:02:05,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:02:05" (3/3) ... [2024-10-12 21:02:05,120 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.14.cil.c [2024-10-12 21:02:05,135 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:02:05,136 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:02:05,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:02:05,258 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;@710a9034, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:02:05,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:02:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 2477 states, 2439 states have (on average 1.8757687576875768) internal successors, (4575), 2444 states have internal predecessors, (4575), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-12 21:02:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:05,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:05,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:05,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:05,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:05,306 INFO L85 PathProgramCache]: Analyzing trace with hash -567169950, now seen corresponding path program 1 times [2024-10-12 21:02:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:05,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585932612] [2024-10-12 21:02:05,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:05,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:05,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:06,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:06,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:06,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:06,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585932612] [2024-10-12 21:02:06,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585932612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:06,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:06,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:02:06,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019476899] [2024-10-12 21:02:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:06,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:02:06,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:06,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:02:06,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:02:06,127 INFO L87 Difference]: Start difference. First operand has 2477 states, 2439 states have (on average 1.8757687576875768) internal successors, (4575), 2444 states have internal predecessors, (4575), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-12 21:02:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:08,246 INFO L93 Difference]: Finished difference Result 5079 states and 9486 transitions. [2024-10-12 21:02:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:02:08,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:08,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:08,286 INFO L225 Difference]: With dead ends: 5079 [2024-10-12 21:02:08,287 INFO L226 Difference]: Without dead ends: 2602 [2024-10-12 21:02:08,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:02:08,303 INFO L432 NwaCegarLoop]: 4264 mSDtfsCounter, 989 mSDsluCounter, 12214 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 16478 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:08,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 16478 Invalid, 1131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:02:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2024-10-12 21:02:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2472. [2024-10-12 21:02:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2436 states have (on average 1.8370279146141215) internal successors, (4475), 2439 states have internal predecessors, (4475), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 21:02:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 4529 transitions. [2024-10-12 21:02:08,526 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 4529 transitions. Word has length 162 [2024-10-12 21:02:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:08,527 INFO L471 AbstractCegarLoop]: Abstraction has 2472 states and 4529 transitions. [2024-10-12 21:02:08,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-12 21:02:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 4529 transitions. [2024-10-12 21:02:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:08,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:08,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:08,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:02:08,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1202301664, now seen corresponding path program 1 times [2024-10-12 21:02:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:08,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740261237] [2024-10-12 21:02:08,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:08,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:08,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:08,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740261237] [2024-10-12 21:02:08,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740261237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:08,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:08,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:02:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368318139] [2024-10-12 21:02:08,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:08,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:02:08,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:08,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:02:08,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:02:08,819 INFO L87 Difference]: Start difference. First operand 2472 states and 4529 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-12 21:02:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:10,648 INFO L93 Difference]: Finished difference Result 2940 states and 5310 transitions. [2024-10-12 21:02:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:02:10,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:10,660 INFO L225 Difference]: With dead ends: 2940 [2024-10-12 21:02:10,661 INFO L226 Difference]: Without dead ends: 2602 [2024-10-12 21:02:10,663 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-12 21:02:10,664 INFO L432 NwaCegarLoop]: 4260 mSDtfsCounter, 977 mSDsluCounter, 12205 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 16465 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:10,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 16465 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:02:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2024-10-12 21:02:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2472. [2024-10-12 21:02:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2436 states have (on average 1.8366174055829227) internal successors, (4474), 2439 states have internal predecessors, (4474), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 21:02:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 4528 transitions. [2024-10-12 21:02:10,750 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 4528 transitions. Word has length 162 [2024-10-12 21:02:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:10,751 INFO L471 AbstractCegarLoop]: Abstraction has 2472 states and 4528 transitions. [2024-10-12 21:02:10,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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-12 21:02:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 4528 transitions. [2024-10-12 21:02:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:10,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:10,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:10,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:02:10,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:10,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash -728823970, now seen corresponding path program 1 times [2024-10-12 21:02:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145541579] [2024-10-12 21:02:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:10,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:11,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:11,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:11,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:11,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145541579] [2024-10-12 21:02:11,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145541579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:11,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:02:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463168014] [2024-10-12 21:02:11,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:11,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:02:11,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:11,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:02:11,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:02:11,243 INFO L87 Difference]: Start difference. First operand 2472 states and 4528 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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-12 21:02:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:14,244 INFO L93 Difference]: Finished difference Result 3417 states and 6110 transitions. [2024-10-12 21:02:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:02:14,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:14,257 INFO L225 Difference]: With dead ends: 3417 [2024-10-12 21:02:14,258 INFO L226 Difference]: Without dead ends: 3084 [2024-10-12 21:02:14,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:14,264 INFO L432 NwaCegarLoop]: 4228 mSDtfsCounter, 5445 mSDsluCounter, 12677 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5464 SdHoareTripleChecker+Valid, 16905 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:14,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5464 Valid, 16905 Invalid, 2418 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [116 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:02:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2024-10-12 21:02:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2823. [2024-10-12 21:02:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2759 states have (on average 1.8151504168176875) internal successors, (5008), 2763 states have internal predecessors, (5008), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-12 21:02:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 5107 transitions. [2024-10-12 21:02:14,355 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 5107 transitions. Word has length 162 [2024-10-12 21:02:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:14,356 INFO L471 AbstractCegarLoop]: Abstraction has 2823 states and 5107 transitions. [2024-10-12 21:02:14,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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-12 21:02:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 5107 transitions. [2024-10-12 21:02:14,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:14,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:14,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:14,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:02:14,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:14,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1360774942, now seen corresponding path program 1 times [2024-10-12 21:02:14,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:14,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501976727] [2024-10-12 21:02:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:14,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:14,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:14,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:14,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:14,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:14,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:14,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:14,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501976727] [2024-10-12 21:02:14,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501976727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:14,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:14,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:14,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338132602] [2024-10-12 21:02:14,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:14,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:14,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:14,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:14,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:14,715 INFO L87 Difference]: Start difference. First operand 2823 states and 5107 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:18,371 INFO L93 Difference]: Finished difference Result 4268 states and 7528 transitions. [2024-10-12 21:02:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:02:18,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:18,387 INFO L225 Difference]: With dead ends: 4268 [2024-10-12 21:02:18,387 INFO L226 Difference]: Without dead ends: 3584 [2024-10-12 21:02:18,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:02:18,391 INFO L432 NwaCegarLoop]: 4433 mSDtfsCounter, 5480 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5499 SdHoareTripleChecker+Valid, 21838 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:18,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5499 Valid, 21838 Invalid, 3805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 21:02:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2024-10-12 21:02:18,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3147. [2024-10-12 21:02:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3147 states, 3055 states have (on average 1.7963993453355156) internal successors, (5488), 3060 states have internal predecessors, (5488), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-12 21:02:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3147 states to 3147 states and 5631 transitions. [2024-10-12 21:02:18,506 INFO L78 Accepts]: Start accepts. Automaton has 3147 states and 5631 transitions. Word has length 162 [2024-10-12 21:02:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:18,506 INFO L471 AbstractCegarLoop]: Abstraction has 3147 states and 5631 transitions. [2024-10-12 21:02:18,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 5631 transitions. [2024-10-12 21:02:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:18,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:18,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:18,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:02:18,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:18,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1771385308, now seen corresponding path program 1 times [2024-10-12 21:02:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:18,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415639289] [2024-10-12 21:02:18,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:18,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:18,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:18,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:18,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:18,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:18,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:18,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415639289] [2024-10-12 21:02:18,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415639289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:18,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:18,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:18,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517500196] [2024-10-12 21:02:18,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:18,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:18,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:18,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:18,867 INFO L87 Difference]: Start difference. First operand 3147 states and 5631 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:22,550 INFO L93 Difference]: Finished difference Result 5515 states and 9592 transitions. [2024-10-12 21:02:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:02:22,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:22,572 INFO L225 Difference]: With dead ends: 5515 [2024-10-12 21:02:22,572 INFO L226 Difference]: Without dead ends: 4507 [2024-10-12 21:02:22,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:02:22,578 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 5592 mSDsluCounter, 16878 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5611 SdHoareTripleChecker+Valid, 21115 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:22,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5611 Valid, 21115 Invalid, 3206 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [107 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:02:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2024-10-12 21:02:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3796. [2024-10-12 21:02:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3648 states have (on average 1.7678179824561404) internal successors, (6449), 3655 states have internal predecessors, (6449), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-12 21:02:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 6684 transitions. [2024-10-12 21:02:22,754 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 6684 transitions. Word has length 162 [2024-10-12 21:02:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:22,755 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 6684 transitions. [2024-10-12 21:02:22,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 6684 transitions. [2024-10-12 21:02:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:22,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:22,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:22,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:02:22,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:22,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash -16484514, now seen corresponding path program 1 times [2024-10-12 21:02:22,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:22,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683894386] [2024-10-12 21:02:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:22,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:22,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:23,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:23,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:23,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683894386] [2024-10-12 21:02:23,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683894386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:23,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:23,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:23,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322792385] [2024-10-12 21:02:23,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:23,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:23,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:23,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:23,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:23,069 INFO L87 Difference]: Start difference. First operand 3796 states and 6684 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:24,869 INFO L93 Difference]: Finished difference Result 6152 states and 10636 transitions. [2024-10-12 21:02:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:02:24,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:24,887 INFO L225 Difference]: With dead ends: 6152 [2024-10-12 21:02:24,887 INFO L226 Difference]: Without dead ends: 4495 [2024-10-12 21:02:24,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:24,895 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5203 mSDsluCounter, 12497 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 16712 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:24,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 16712 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:02:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2024-10-12 21:02:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 3796. [2024-10-12 21:02:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3648 states have (on average 1.7664473684210527) internal successors, (6444), 3655 states have internal predecessors, (6444), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-12 21:02:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 6679 transitions. [2024-10-12 21:02:25,042 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 6679 transitions. Word has length 162 [2024-10-12 21:02:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:25,042 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 6679 transitions. [2024-10-12 21:02:25,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 6679 transitions. [2024-10-12 21:02:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:25,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:25,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:25,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:02:25,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:25,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2142599580, now seen corresponding path program 1 times [2024-10-12 21:02:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:25,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91448819] [2024-10-12 21:02:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:25,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:25,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:25,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:25,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:25,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:25,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91448819] [2024-10-12 21:02:25,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91448819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:25,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:25,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:25,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934830955] [2024-10-12 21:02:25,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:25,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:25,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:25,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:25,309 INFO L87 Difference]: Start difference. First operand 3796 states and 6679 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:27,267 INFO L93 Difference]: Finished difference Result 6141 states and 10600 transitions. [2024-10-12 21:02:27,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:02:27,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:27,285 INFO L225 Difference]: With dead ends: 6141 [2024-10-12 21:02:27,285 INFO L226 Difference]: Without dead ends: 4484 [2024-10-12 21:02:27,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:27,292 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5046 mSDsluCounter, 16621 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5066 SdHoareTripleChecker+Valid, 20836 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:27,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5066 Valid, 20836 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:02:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2024-10-12 21:02:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 3796. [2024-10-12 21:02:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3648 states have (on average 1.765076754385965) internal successors, (6439), 3655 states have internal predecessors, (6439), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-12 21:02:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 6674 transitions. [2024-10-12 21:02:27,449 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 6674 transitions. Word has length 162 [2024-10-12 21:02:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:27,450 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 6674 transitions. [2024-10-12 21:02:27,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 6674 transitions. [2024-10-12 21:02:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:27,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:27,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:27,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:02:27,454 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:27,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1734479014, now seen corresponding path program 1 times [2024-10-12 21:02:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:27,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267687785] [2024-10-12 21:02:27,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:27,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:27,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:27,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267687785] [2024-10-12 21:02:27,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267687785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:27,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:27,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255814210] [2024-10-12 21:02:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:27,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:27,755 INFO L87 Difference]: Start difference. First operand 3796 states and 6674 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:31,461 INFO L93 Difference]: Finished difference Result 7887 states and 13447 transitions. [2024-10-12 21:02:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:02:31,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:31,482 INFO L225 Difference]: With dead ends: 7887 [2024-10-12 21:02:31,482 INFO L226 Difference]: Without dead ends: 6230 [2024-10-12 21:02:31,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:02:31,490 INFO L432 NwaCegarLoop]: 4431 mSDtfsCounter, 5463 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5482 SdHoareTripleChecker+Valid, 21836 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:31,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5482 Valid, 21836 Invalid, 3728 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3661 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:02:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2024-10-12 21:02:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 5109. [2024-10-12 21:02:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 4849 states have (on average 1.7269540111363169) internal successors, (8374), 4860 states have internal predecessors, (8374), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-12 21:02:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 8799 transitions. [2024-10-12 21:02:31,720 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 8799 transitions. Word has length 162 [2024-10-12 21:02:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:31,722 INFO L471 AbstractCegarLoop]: Abstraction has 5109 states and 8799 transitions. [2024-10-12 21:02:31,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 8799 transitions. [2024-10-12 21:02:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:31,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:31,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:31,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:02:31,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:31,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash -335525412, now seen corresponding path program 1 times [2024-10-12 21:02:31,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:31,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964846258] [2024-10-12 21:02:31,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:31,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:31,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:31,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:32,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:32,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:32,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964846258] [2024-10-12 21:02:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964846258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:32,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:32,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:32,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50130574] [2024-10-12 21:02:32,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:32,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:32,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:32,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:32,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:32,016 INFO L87 Difference]: Start difference. First operand 5109 states and 8799 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:33,920 INFO L93 Difference]: Finished difference Result 9223 states and 15645 transitions. [2024-10-12 21:02:33,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:02:33,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:33,940 INFO L225 Difference]: With dead ends: 9223 [2024-10-12 21:02:33,941 INFO L226 Difference]: Without dead ends: 6253 [2024-10-12 21:02:33,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:33,952 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5045 mSDsluCounter, 16621 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5065 SdHoareTripleChecker+Valid, 20836 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:33,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5065 Valid, 20836 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:02:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6253 states. [2024-10-12 21:02:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6253 to 5109. [2024-10-12 21:02:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 4849 states have (on average 1.7250979583419261) internal successors, (8365), 4860 states have internal predecessors, (8365), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-12 21:02:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 8790 transitions. [2024-10-12 21:02:34,171 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 8790 transitions. Word has length 162 [2024-10-12 21:02:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:34,171 INFO L471 AbstractCegarLoop]: Abstraction has 5109 states and 8790 transitions. [2024-10-12 21:02:34,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 8790 transitions. [2024-10-12 21:02:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:34,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:34,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:34,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:02:34,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:34,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:34,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1952965862, now seen corresponding path program 1 times [2024-10-12 21:02:34,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:34,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834767644] [2024-10-12 21:02:34,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:34,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:34,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:34,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834767644] [2024-10-12 21:02:34,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834767644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:34,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:34,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:34,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847588253] [2024-10-12 21:02:34,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:34,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:34,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:34,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:34,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:34,443 INFO L87 Difference]: Start difference. First operand 5109 states and 8790 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:38,034 INFO L93 Difference]: Finished difference Result 12658 states and 21228 transitions. [2024-10-12 21:02:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:02:38,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:38,068 INFO L225 Difference]: With dead ends: 12658 [2024-10-12 21:02:38,068 INFO L226 Difference]: Without dead ends: 9688 [2024-10-12 21:02:38,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:02:38,082 INFO L432 NwaCegarLoop]: 4431 mSDtfsCounter, 5455 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5474 SdHoareTripleChecker+Valid, 21836 SdHoareTripleChecker+Invalid, 3690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:38,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5474 Valid, 21836 Invalid, 3690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3623 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:02:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2024-10-12 21:02:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 7745. [2024-10-12 21:02:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7745 states, 7261 states have (on average 1.6850296102465225) internal successors, (12235), 7280 states have internal predecessors, (12235), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-12 21:02:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7745 states to 7745 states and 13058 transitions. [2024-10-12 21:02:38,477 INFO L78 Accepts]: Start accepts. Automaton has 7745 states and 13058 transitions. Word has length 162 [2024-10-12 21:02:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:38,477 INFO L471 AbstractCegarLoop]: Abstraction has 7745 states and 13058 transitions. [2024-10-12 21:02:38,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 7745 states and 13058 transitions. [2024-10-12 21:02:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:38,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:38,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:38,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:02:38,483 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:38,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1589499364, now seen corresponding path program 1 times [2024-10-12 21:02:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:38,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813672317] [2024-10-12 21:02:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:38,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:38,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:38,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813672317] [2024-10-12 21:02:38,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813672317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:38,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:38,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:38,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585457406] [2024-10-12 21:02:38,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:38,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:38,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:38,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:38,744 INFO L87 Difference]: Start difference. First operand 7745 states and 13058 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:42,769 INFO L93 Difference]: Finished difference Result 22216 states and 36922 transitions. [2024-10-12 21:02:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:02:42,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:42,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:42,822 INFO L225 Difference]: With dead ends: 22216 [2024-10-12 21:02:42,822 INFO L226 Difference]: Without dead ends: 16610 [2024-10-12 21:02:42,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:02:42,848 INFO L432 NwaCegarLoop]: 4431 mSDtfsCounter, 5454 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3610 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5473 SdHoareTripleChecker+Valid, 21836 SdHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:42,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5473 Valid, 21836 Invalid, 3677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3610 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:02:42,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16610 states. [2024-10-12 21:02:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16610 to 13030. [2024-10-12 21:02:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13030 states, 12098 states have (on average 1.652587204496611) internal successors, (19993), 12133 states have internal predecessors, (19993), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-12 21:02:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13030 states to 13030 states and 21666 transitions. [2024-10-12 21:02:43,569 INFO L78 Accepts]: Start accepts. Automaton has 13030 states and 21666 transitions. Word has length 162 [2024-10-12 21:02:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:43,569 INFO L471 AbstractCegarLoop]: Abstraction has 13030 states and 21666 transitions. [2024-10-12 21:02:43,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 13030 states and 21666 transitions. [2024-10-12 21:02:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:43,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:43,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:43,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:02:43,579 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:43,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1300679974, now seen corresponding path program 1 times [2024-10-12 21:02:43,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:43,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883758428] [2024-10-12 21:02:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:43,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:43,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:43,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883758428] [2024-10-12 21:02:43,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883758428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:43,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:43,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:43,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304676182] [2024-10-12 21:02:43,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:43,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:43,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:43,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:43,834 INFO L87 Difference]: Start difference. First operand 13030 states and 21666 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:48,068 INFO L93 Difference]: Finished difference Result 41331 states and 68500 transitions. [2024-10-12 21:02:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:02:48,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:48,190 INFO L225 Difference]: With dead ends: 41331 [2024-10-12 21:02:48,191 INFO L226 Difference]: Without dead ends: 30440 [2024-10-12 21:02:48,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:02:48,236 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 5553 mSDsluCounter, 16878 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5572 SdHoareTripleChecker+Valid, 21115 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:48,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5572 Valid, 21115 Invalid, 3112 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [107 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 21:02:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30440 states. [2024-10-12 21:02:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30440 to 23631. [2024-10-12 21:02:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23631 states, 21803 states have (on average 1.6307388891436958) internal successors, (35555), 21870 states have internal predecessors, (35555), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-12 21:02:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23631 states to 23631 states and 39090 transitions. [2024-10-12 21:02:49,753 INFO L78 Accepts]: Start accepts. Automaton has 23631 states and 39090 transitions. Word has length 162 [2024-10-12 21:02:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:49,754 INFO L471 AbstractCegarLoop]: Abstraction has 23631 states and 39090 transitions. [2024-10-12 21:02:49,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 23631 states and 39090 transitions. [2024-10-12 21:02:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:49,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:49,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:49,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:02:49,772 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:49,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1845552548, now seen corresponding path program 1 times [2024-10-12 21:02:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:49,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536256804] [2024-10-12 21:02:49,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:49,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:49,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:50,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:50,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:50,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:50,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536256804] [2024-10-12 21:02:50,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536256804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:50,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:50,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514048357] [2024-10-12 21:02:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:50,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:50,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:50,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:50,036 INFO L87 Difference]: Start difference. First operand 23631 states and 39090 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:52,988 INFO L93 Difference]: Finished difference Result 52363 states and 87432 transitions. [2024-10-12 21:02:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:02:52,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:02:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:53,112 INFO L225 Difference]: With dead ends: 52363 [2024-10-12 21:02:53,112 INFO L226 Difference]: Without dead ends: 30871 [2024-10-12 21:02:53,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:53,183 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5205 mSDsluCounter, 12497 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5225 SdHoareTripleChecker+Valid, 16712 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:53,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5225 Valid, 16712 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:02:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30871 states. [2024-10-12 21:02:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30871 to 23631. [2024-10-12 21:02:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23631 states, 21803 states have (on average 1.6277576480300877) internal successors, (35490), 21870 states have internal predecessors, (35490), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-12 21:02:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23631 states to 23631 states and 39025 transitions. [2024-10-12 21:02:54,681 INFO L78 Accepts]: Start accepts. Automaton has 23631 states and 39025 transitions. Word has length 162 [2024-10-12 21:02:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:54,682 INFO L471 AbstractCegarLoop]: Abstraction has 23631 states and 39025 transitions. [2024-10-12 21:02:54,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:02:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 23631 states and 39025 transitions. [2024-10-12 21:02:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:02:54,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:54,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:54,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:02:54,697 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1170392422, now seen corresponding path program 1 times [2024-10-12 21:02:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:54,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079800159] [2024-10-12 21:02:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:54,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:02:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:02:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:54,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:02:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:54,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:02:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:54,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:54,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079800159] [2024-10-12 21:02:54,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079800159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:54,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:54,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:54,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293846990] [2024-10-12 21:02:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:54,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:54,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:54,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:54,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:54,958 INFO L87 Difference]: Start difference. First operand 23631 states and 39025 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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-12 21:03:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:01,143 INFO L93 Difference]: Finished difference Result 89158 states and 147480 transitions. [2024-10-12 21:03:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:03:01,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:03:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:01,394 INFO L225 Difference]: With dead ends: 89158 [2024-10-12 21:03:01,394 INFO L226 Difference]: Without dead ends: 67666 [2024-10-12 21:03:01,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:03:01,480 INFO L432 NwaCegarLoop]: 4429 mSDtfsCounter, 5881 mSDsluCounter, 17400 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5913 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 3600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:01,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5913 Valid, 21829 Invalid, 3600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3530 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:03:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67666 states.