./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c633b25b4ec43f32a8252bdc35a2fbecdeeeba9961d16af4e4c5eb75bb72dd2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:22:29,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:22:29,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:22:29,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:22:29,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:22:29,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:22:29,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:22:29,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:22:29,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:22:29,269 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:22:29,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:22:29,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:22:29,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:22:29,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:22:29,273 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:22:29,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:22:29,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:22:29,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:22:29,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:22:29,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:22:29,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:22:29,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:22:29,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:22:29,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:22:29,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:22:29,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:22:29,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:22:29,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:22:29,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:22:29,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:22:29,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:22:29,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:22:29,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:22:29,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:22:29,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:22:29,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:22:29,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:22:29,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:22:29,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:22:29,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:22:29,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:22:29,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:22:29,286 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c633b25b4ec43f32a8252bdc35a2fbecdeeeba9961d16af4e4c5eb75bb72dd2 [2024-10-11 04:22:29,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:22:29,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:22:29,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:22:29,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:22:29,572 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:22:29,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c [2024-10-11 04:22:31,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:22:31,712 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:22:31,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c [2024-10-11 04:22:31,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b41c0ba43/d092041fa2784a33892054dc0290551c/FLAG86014c83a [2024-10-11 04:22:31,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b41c0ba43/d092041fa2784a33892054dc0290551c [2024-10-11 04:22:31,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:22:31,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:22:31,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:22:31,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:22:31,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:22:31,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:22:31" (1/1) ... [2024-10-11 04:22:31,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ac13c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:31, skipping insertion in model container [2024-10-11 04:22:31,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:22:31" (1/1) ... [2024-10-11 04:22:31,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:22:33,608 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[382357,382370] [2024-10-11 04:22:33,629 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[383339,383352] [2024-10-11 04:22:33,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:22:33,823 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:22:34,600 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[382357,382370] [2024-10-11 04:22:34,604 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.07.cil-2.c[383339,383352] [2024-10-11 04:22:34,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:22:34,718 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:22:34,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34 WrapperNode [2024-10-11 04:22:34,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:22:34,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:22:34,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:22:34,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:22:34,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:34,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:35,210 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 12939 [2024-10-11 04:22:35,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:22:35,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:22:35,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:22:35,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:22:35,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:35,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:35,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:35,370 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:22:35,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:35,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:35,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:35,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:35,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:35,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:35,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:22:35,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:22:35,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:22:35,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:22:35,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (1/1) ... [2024-10-11 04:22:35,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:22:35,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:22:35,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:22:35,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:22:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:22:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:22:35,945 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:22:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:22:35,946 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:22:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:22:35,947 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:22:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:22:35,947 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:22:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:22:35,947 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:22:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:22:35,947 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:22:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:22:35,947 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:22:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:22:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:22:35,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:22:36,083 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:22:36,085 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:22:43,805 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2024-10-11 04:22:43,805 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:22:43,934 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:22:43,934 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 04:22:43,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:22:43 BoogieIcfgContainer [2024-10-11 04:22:43,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:22:43,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:22:43,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:22:43,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:22:43,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:22:31" (1/3) ... [2024-10-11 04:22:43,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1442e146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:22:43, skipping insertion in model container [2024-10-11 04:22:43,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:34" (2/3) ... [2024-10-11 04:22:43,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1442e146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:22:43, skipping insertion in model container [2024-10-11 04:22:43,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:22:43" (3/3) ... [2024-10-11 04:22:43,943 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.07.cil-2.c [2024-10-11 04:22:43,959 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:22:43,959 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:22:44,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:22:44,083 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;@22fb9f00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:22:44,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:22:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 2364 states, 2331 states have (on average 1.8807378807378807) internal successors, (4384), 2336 states have internal predecessors, (4384), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 04:22:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:22:44,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:44,117 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] [2024-10-11 04:22:44,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:44,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash -626584138, now seen corresponding path program 1 times [2024-10-11 04:22:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:44,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273945730] [2024-10-11 04:22:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:44,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:22:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:22:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:22:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:22:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:22:44,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273945730] [2024-10-11 04:22:44,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273945730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:44,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:44,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:22:44,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20417900] [2024-10-11 04:22:44,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:44,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:22:44,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:44,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:22:44,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:22:44,808 INFO L87 Difference]: Start difference. First operand has 2364 states, 2331 states have (on average 1.8807378807378807) internal successors, (4384), 2336 states have internal predecessors, (4384), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:46,074 INFO L93 Difference]: Finished difference Result 4797 states and 8982 transitions. [2024-10-11 04:22:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:22:46,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:22:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:46,111 INFO L225 Difference]: With dead ends: 4797 [2024-10-11 04:22:46,112 INFO L226 Difference]: Without dead ends: 2439 [2024-10-11 04:22:46,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:22:46,129 INFO L432 NwaCegarLoop]: 4173 mSDtfsCounter, 632 mSDsluCounter, 12112 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 16285 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:46,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 16285 Invalid, 731 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:22:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2024-10-11 04:22:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2359. [2024-10-11 04:22:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2328 states have (on average 1.8445017182130585) internal successors, (4294), 2331 states have internal predecessors, (4294), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 04:22:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4338 transitions. [2024-10-11 04:22:46,271 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4338 transitions. Word has length 112 [2024-10-11 04:22:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:46,272 INFO L471 AbstractCegarLoop]: Abstraction has 2359 states and 4338 transitions. [2024-10-11 04:22:46,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:46,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4338 transitions. [2024-10-11 04:22:46,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:22:46,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:46,276 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] [2024-10-11 04:22:46,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:22:46,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:46,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:46,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1657625036, now seen corresponding path program 1 times [2024-10-11 04:22:46,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:46,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170848479] [2024-10-11 04:22:46,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:46,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:46,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:46,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:22:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:46,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:22:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:22:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:46,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:22:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:22:46,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:46,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170848479] [2024-10-11 04:22:46,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170848479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:46,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:46,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:22:46,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095780315] [2024-10-11 04:22:46,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:46,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:22:46,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:46,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:22:46,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:22:46,575 INFO L87 Difference]: Start difference. First operand 2359 states and 4338 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:48,538 INFO L93 Difference]: Finished difference Result 2978 states and 5358 transitions. [2024-10-11 04:22:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:22:48,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:22:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:48,554 INFO L225 Difference]: With dead ends: 2978 [2024-10-11 04:22:48,554 INFO L226 Difference]: Without dead ends: 2753 [2024-10-11 04:22:48,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:22:48,559 INFO L432 NwaCegarLoop]: 4148 mSDtfsCounter, 4905 mSDsluCounter, 12430 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 16578 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:48,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 16578 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:22:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2024-10-11 04:22:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2592. [2024-10-11 04:22:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2538 states have (on average 1.8270291568163908) internal successors, (4637), 2542 states have internal predecessors, (4637), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-11 04:22:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 4716 transitions. [2024-10-11 04:22:48,657 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 4716 transitions. Word has length 112 [2024-10-11 04:22:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:48,657 INFO L471 AbstractCegarLoop]: Abstraction has 2592 states and 4716 transitions. [2024-10-11 04:22:48,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 4716 transitions. [2024-10-11 04:22:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:22:48,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:48,660 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] [2024-10-11 04:22:48,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:22:48,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:48,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:48,661 INFO L85 PathProgramCache]: Analyzing trace with hash -663372240, now seen corresponding path program 1 times [2024-10-11 04:22:48,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:48,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300741612] [2024-10-11 04:22:48,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:48,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:48,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:48,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:22:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:22:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:48,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:22:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:22:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:22:49,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:49,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300741612] [2024-10-11 04:22:49,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300741612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:49,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:49,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:49,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96219293] [2024-10-11 04:22:49,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:49,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:49,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:49,060 INFO L87 Difference]: Start difference. First operand 2592 states and 4716 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:51,633 INFO L93 Difference]: Finished difference Result 3533 states and 6264 transitions. [2024-10-11 04:22:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:22:51,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:22:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:51,651 INFO L225 Difference]: With dead ends: 3533 [2024-10-11 04:22:51,651 INFO L226 Difference]: Without dead ends: 3075 [2024-10-11 04:22:51,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:22:51,657 INFO L432 NwaCegarLoop]: 4292 mSDtfsCounter, 4918 mSDsluCounter, 16919 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4932 SdHoareTripleChecker+Valid, 21211 SdHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:51,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4932 Valid, 21211 Invalid, 2443 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:22:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2024-10-11 04:22:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2808. [2024-10-11 04:22:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2808 states, 2731 states have (on average 1.8110582204320762) internal successors, (4946), 2736 states have internal predecessors, (4946), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-11 04:22:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 5059 transitions. [2024-10-11 04:22:51,755 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 5059 transitions. Word has length 112 [2024-10-11 04:22:51,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:51,755 INFO L471 AbstractCegarLoop]: Abstraction has 2808 states and 5059 transitions. [2024-10-11 04:22:51,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 5059 transitions. [2024-10-11 04:22:51,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:22:51,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:51,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] [2024-10-11 04:22:51,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:22:51,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:51,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:51,759 INFO L85 PathProgramCache]: Analyzing trace with hash 688012978, now seen corresponding path program 1 times [2024-10-11 04:22:51,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:51,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410820616] [2024-10-11 04:22:51,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:51,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:51,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:22:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:51,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:22:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:22:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:51,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:22:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:22:51,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:51,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410820616] [2024-10-11 04:22:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410820616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:52,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593718694] [2024-10-11 04:22:52,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:52,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:52,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:52,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:52,002 INFO L87 Difference]: Start difference. First operand 2808 states and 5059 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:54,186 INFO L93 Difference]: Finished difference Result 4346 states and 7585 transitions. [2024-10-11 04:22:54,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:22:54,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:22:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:54,203 INFO L225 Difference]: With dead ends: 4346 [2024-10-11 04:22:54,203 INFO L226 Difference]: Without dead ends: 3672 [2024-10-11 04:22:54,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:22:54,208 INFO L432 NwaCegarLoop]: 4290 mSDtfsCounter, 4916 mSDsluCounter, 16919 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4930 SdHoareTripleChecker+Valid, 21209 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:54,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4930 Valid, 21209 Invalid, 2441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:22:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2024-10-11 04:22:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3241. [2024-10-11 04:22:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.784797947402181) internal successors, (5565), 3125 states have internal predecessors, (5565), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:22:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5750 transitions. [2024-10-11 04:22:54,339 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5750 transitions. Word has length 112 [2024-10-11 04:22:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:54,339 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5750 transitions. [2024-10-11 04:22:54,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5750 transitions. [2024-10-11 04:22:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:22:54,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:54,342 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] [2024-10-11 04:22:54,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:22:54,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:54,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash -930961936, now seen corresponding path program 1 times [2024-10-11 04:22:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:54,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601024401] [2024-10-11 04:22:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:54,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:54,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:54,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:22:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:54,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:22:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:54,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:22:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:54,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:22:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:22:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:54,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601024401] [2024-10-11 04:22:54,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601024401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:54,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:54,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:54,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388861797] [2024-10-11 04:22:54,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:54,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:54,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:54,592 INFO L87 Difference]: Start difference. First operand 3241 states and 5750 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:55,596 INFO L93 Difference]: Finished difference Result 4767 states and 8267 transitions. [2024-10-11 04:22:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:22:55,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:22:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:55,610 INFO L225 Difference]: With dead ends: 4767 [2024-10-11 04:22:55,611 INFO L226 Difference]: Without dead ends: 3660 [2024-10-11 04:22:55,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:22:55,616 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4757 mSDsluCounter, 12296 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 16431 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:55,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 16431 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:22:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2024-10-11 04:22:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3241. [2024-10-11 04:22:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.7831943553559975) internal successors, (5560), 3125 states have internal predecessors, (5560), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:22:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5745 transitions. [2024-10-11 04:22:55,840 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5745 transitions. Word has length 112 [2024-10-11 04:22:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:55,841 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5745 transitions. [2024-10-11 04:22:55,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:55,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5745 transitions. [2024-10-11 04:22:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:22:55,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:55,844 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] [2024-10-11 04:22:55,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:22:55,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:55,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1814470926, now seen corresponding path program 1 times [2024-10-11 04:22:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:55,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563207108] [2024-10-11 04:22:55,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:55,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:55,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:55,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:22:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:56,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:22:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:56,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:22:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:56,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:22:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:22:56,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:56,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563207108] [2024-10-11 04:22:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563207108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:56,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:56,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:56,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894049096] [2024-10-11 04:22:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:56,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:56,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:56,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:56,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:56,077 INFO L87 Difference]: Start difference. First operand 3241 states and 5745 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:57,340 INFO L93 Difference]: Finished difference Result 4761 states and 8241 transitions. [2024-10-11 04:22:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:22:57,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:22:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:57,357 INFO L225 Difference]: With dead ends: 4761 [2024-10-11 04:22:57,357 INFO L226 Difference]: Without dead ends: 3654 [2024-10-11 04:22:57,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:22:57,364 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4657 mSDsluCounter, 16370 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 20505 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:57,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 20505 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:22:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2024-10-11 04:22:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3241. [2024-10-11 04:22:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.781590763309814) internal successors, (5555), 3125 states have internal predecessors, (5555), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:22:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5740 transitions. [2024-10-11 04:22:57,525 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5740 transitions. Word has length 112 [2024-10-11 04:22:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5740 transitions. [2024-10-11 04:22:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5740 transitions. [2024-10-11 04:22:57,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:22:57,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:57,529 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] [2024-10-11 04:22:57,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:22:57,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:57,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:57,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1842971216, now seen corresponding path program 1 times [2024-10-11 04:22:57,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:57,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764795372] [2024-10-11 04:22:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:57,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:22:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:57,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:22:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:57,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:22:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:22:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:22:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764795372] [2024-10-11 04:22:57,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764795372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:57,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:57,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:57,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923705742] [2024-10-11 04:22:57,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:57,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:57,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:57,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:57,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:57,754 INFO L87 Difference]: Start difference. First operand 3241 states and 5740 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:58,794 INFO L93 Difference]: Finished difference Result 4754 states and 8213 transitions. [2024-10-11 04:22:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:22:58,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:22:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:58,811 INFO L225 Difference]: With dead ends: 4754 [2024-10-11 04:22:58,811 INFO L226 Difference]: Without dead ends: 3647 [2024-10-11 04:22:58,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:22:58,818 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4759 mSDsluCounter, 12296 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4774 SdHoareTripleChecker+Valid, 16431 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:58,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4774 Valid, 16431 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:22:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3647 states. [2024-10-11 04:22:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3647 to 3241. [2024-10-11 04:22:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.7799871712636306) internal successors, (5550), 3125 states have internal predecessors, (5550), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:22:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5735 transitions. [2024-10-11 04:22:58,986 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5735 transitions. Word has length 112 [2024-10-11 04:22:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:58,986 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5735 transitions. [2024-10-11 04:22:58,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:22:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5735 transitions. [2024-10-11 04:22:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:22:58,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:58,990 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] [2024-10-11 04:22:58,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:22:58,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:58,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 511414066, now seen corresponding path program 1 times [2024-10-11 04:22:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:58,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526980901] [2024-10-11 04:22:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:22:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:22:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:22:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:22:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:22:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526980901] [2024-10-11 04:22:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526980901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:59,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:59,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:59,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94518146] [2024-10-11 04:22:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:59,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:59,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:59,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:59,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:59,179 INFO L87 Difference]: Start difference. First operand 3241 states and 5735 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:00,098 INFO L93 Difference]: Finished difference Result 4742 states and 8175 transitions. [2024-10-11 04:23:00,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:23:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:23:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:00,113 INFO L225 Difference]: With dead ends: 4742 [2024-10-11 04:23:00,113 INFO L226 Difference]: Without dead ends: 3635 [2024-10-11 04:23:00,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:23:00,119 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4755 mSDsluCounter, 12296 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4770 SdHoareTripleChecker+Valid, 16431 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:00,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4770 Valid, 16431 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:23:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2024-10-11 04:23:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3241. [2024-10-11 04:23:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.7783835792174472) internal successors, (5545), 3125 states have internal predecessors, (5545), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:23:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5730 transitions. [2024-10-11 04:23:00,336 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5730 transitions. Word has length 112 [2024-10-11 04:23:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:00,338 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5730 transitions. [2024-10-11 04:23:00,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5730 transitions. [2024-10-11 04:23:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:23:00,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:00,340 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] [2024-10-11 04:23:00,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:23:00,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:00,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:00,341 INFO L85 PathProgramCache]: Analyzing trace with hash -259319500, now seen corresponding path program 1 times [2024-10-11 04:23:00,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:00,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615898039] [2024-10-11 04:23:00,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:00,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:00,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:00,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:23:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:00,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:23:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:00,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:23:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:00,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:23:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:00,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:00,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615898039] [2024-10-11 04:23:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615898039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:00,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:00,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092685898] [2024-10-11 04:23:00,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:00,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:00,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:00,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:00,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:00,537 INFO L87 Difference]: Start difference. First operand 3241 states and 5730 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:02,765 INFO L93 Difference]: Finished difference Result 6242 states and 10548 transitions. [2024-10-11 04:23:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:02,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:23:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:02,784 INFO L225 Difference]: With dead ends: 6242 [2024-10-11 04:23:02,784 INFO L226 Difference]: Without dead ends: 5135 [2024-10-11 04:23:02,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:02,791 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 5146 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5168 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:02,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5168 Valid, 21202 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:23:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2024-10-11 04:23:02,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 4122. [2024-10-11 04:23:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4122 states, 3911 states have (on average 1.7371516236256712) internal successors, (6794), 3922 states have internal predecessors, (6794), 147 states have call successors, (147), 55 states have call predecessors, (147), 62 states have return successors, (180), 152 states have call predecessors, (180), 145 states have call successors, (180) [2024-10-11 04:23:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4122 states to 4122 states and 7121 transitions. [2024-10-11 04:23:02,966 INFO L78 Accepts]: Start accepts. Automaton has 4122 states and 7121 transitions. Word has length 112 [2024-10-11 04:23:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:02,966 INFO L471 AbstractCegarLoop]: Abstraction has 4122 states and 7121 transitions. [2024-10-11 04:23:02,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states and 7121 transitions. [2024-10-11 04:23:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:23:02,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:02,970 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] [2024-10-11 04:23:02,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:23:02,971 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:02,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1254013198, now seen corresponding path program 1 times [2024-10-11 04:23:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368406469] [2024-10-11 04:23:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:03,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:03,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:23:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:23:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:03,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:23:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:03,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:23:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:03,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:03,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368406469] [2024-10-11 04:23:03,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368406469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:03,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:03,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:03,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730237735] [2024-10-11 04:23:03,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:03,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:03,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:03,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:03,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:03,157 INFO L87 Difference]: Start difference. First operand 4122 states and 7121 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:05,498 INFO L93 Difference]: Finished difference Result 9619 states and 15939 transitions. [2024-10-11 04:23:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:05,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:23:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:05,531 INFO L225 Difference]: With dead ends: 9619 [2024-10-11 04:23:05,532 INFO L226 Difference]: Without dead ends: 7631 [2024-10-11 04:23:05,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:05,541 INFO L432 NwaCegarLoop]: 4287 mSDtfsCounter, 4941 mSDsluCounter, 16911 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4954 SdHoareTripleChecker+Valid, 21198 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:05,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4954 Valid, 21198 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2627 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:23:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7631 states. [2024-10-11 04:23:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7631 to 5793. [2024-10-11 04:23:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5793 states, 5410 states have (on average 1.688354898336414) internal successors, (9134), 5429 states have internal predecessors, (9134), 263 states have call successors, (263), 103 states have call predecessors, (263), 118 states have return successors, (358), 276 states have call predecessors, (358), 261 states have call successors, (358) [2024-10-11 04:23:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5793 states to 5793 states and 9755 transitions. [2024-10-11 04:23:05,849 INFO L78 Accepts]: Start accepts. Automaton has 5793 states and 9755 transitions. Word has length 112 [2024-10-11 04:23:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:05,850 INFO L471 AbstractCegarLoop]: Abstraction has 5793 states and 9755 transitions. [2024-10-11 04:23:05,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 5793 states and 9755 transitions. [2024-10-11 04:23:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:23:05,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:05,854 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] [2024-10-11 04:23:05,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:23:05,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:05,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1840289420, now seen corresponding path program 1 times [2024-10-11 04:23:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:05,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024401993] [2024-10-11 04:23:05,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:05,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:05,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:23:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:06,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:23:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:06,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:23:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:06,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:23:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:06,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:06,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024401993] [2024-10-11 04:23:06,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024401993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:06,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:06,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:06,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946335474] [2024-10-11 04:23:06,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:06,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:06,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:06,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:06,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:06,034 INFO L87 Difference]: Start difference. First operand 5793 states and 9755 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:08,500 INFO L93 Difference]: Finished difference Result 16012 states and 26135 transitions. [2024-10-11 04:23:08,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:08,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:23:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:08,545 INFO L225 Difference]: With dead ends: 16012 [2024-10-11 04:23:08,545 INFO L226 Difference]: Without dead ends: 12353 [2024-10-11 04:23:08,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:08,562 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 5074 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5096 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:08,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5096 Valid, 21202 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:23:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12353 states. [2024-10-11 04:23:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12353 to 9214. [2024-10-11 04:23:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9214 states, 8495 states have (on average 1.6447321954090641) internal successors, (13972), 8530 states have internal predecessors, (13972), 487 states have call successors, (487), 199 states have call predecessors, (487), 230 states have return successors, (760), 516 states have call predecessors, (760), 485 states have call successors, (760) [2024-10-11 04:23:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 15219 transitions. [2024-10-11 04:23:09,093 INFO L78 Accepts]: Start accepts. Automaton has 9214 states and 15219 transitions. Word has length 112 [2024-10-11 04:23:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:09,094 INFO L471 AbstractCegarLoop]: Abstraction has 9214 states and 15219 transitions. [2024-10-11 04:23:09,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 9214 states and 15219 transitions. [2024-10-11 04:23:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:23:09,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:09,101 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] [2024-10-11 04:23:09,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:23:09,101 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:09,102 INFO L85 PathProgramCache]: Analyzing trace with hash 496103090, now seen corresponding path program 1 times [2024-10-11 04:23:09,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:09,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836187278] [2024-10-11 04:23:09,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:09,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:23:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:23:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:23:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:23:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:09,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836187278] [2024-10-11 04:23:09,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836187278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:09,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:09,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:09,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240943153] [2024-10-11 04:23:09,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:09,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:09,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:09,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:09,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:09,265 INFO L87 Difference]: Start difference. First operand 9214 states and 15219 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:12,801 INFO L93 Difference]: Finished difference Result 28783 states and 46745 transitions. [2024-10-11 04:23:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:12,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:23:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:12,869 INFO L225 Difference]: With dead ends: 28783 [2024-10-11 04:23:12,869 INFO L226 Difference]: Without dead ends: 21703 [2024-10-11 04:23:12,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:12,896 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 5038 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5060 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:12,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5060 Valid, 21202 Invalid, 2265 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [60 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:23:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21703 states. [2024-10-11 04:23:13,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21703 to 16055. [2024-10-11 04:23:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16055 states, 14680 states have (on average 1.6129427792915532) internal successors, (23678), 14747 states have internal predecessors, (23678), 919 states have call successors, (919), 391 states have call predecessors, (919), 454 states have return successors, (1710), 980 states have call predecessors, (1710), 917 states have call successors, (1710) [2024-10-11 04:23:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16055 states to 16055 states and 26307 transitions. [2024-10-11 04:23:13,856 INFO L78 Accepts]: Start accepts. Automaton has 16055 states and 26307 transitions. Word has length 112 [2024-10-11 04:23:13,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:13,856 INFO L471 AbstractCegarLoop]: Abstraction has 16055 states and 26307 transitions. [2024-10-11 04:23:13,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 16055 states and 26307 transitions. [2024-10-11 04:23:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:23:13,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:13,869 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] [2024-10-11 04:23:13,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:23:13,869 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:13,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1922381388, now seen corresponding path program 1 times [2024-10-11 04:23:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:13,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526196929] [2024-10-11 04:23:13,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:13,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:23:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:14,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:23:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:23:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:14,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:23:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:14,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:14,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526196929] [2024-10-11 04:23:14,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526196929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:14,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:14,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153968038] [2024-10-11 04:23:14,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:14,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:14,036 INFO L87 Difference]: Start difference. First operand 16055 states and 26307 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:18,041 INFO L93 Difference]: Finished difference Result 53846 states and 87783 transitions. [2024-10-11 04:23:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:18,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:23:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:18,203 INFO L225 Difference]: With dead ends: 53846 [2024-10-11 04:23:18,203 INFO L226 Difference]: Without dead ends: 39925 [2024-10-11 04:23:18,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:18,262 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 4912 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4925 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:18,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4925 Valid, 21202 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:23:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39925 states. [2024-10-11 04:23:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39925 to 29736. [2024-10-11 04:23:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29736 states, 27081 states have (on average 1.5934418965326242) internal successors, (43152), 27212 states have internal predecessors, (43152), 1751 states have call successors, (1751), 775 states have call predecessors, (1751), 902 states have return successors, (4064), 1876 states have call predecessors, (4064), 1749 states have call successors, (4064) [2024-10-11 04:23:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29736 states to 29736 states and 48967 transitions. [2024-10-11 04:23:20,742 INFO L78 Accepts]: Start accepts. Automaton has 29736 states and 48967 transitions. Word has length 112 [2024-10-11 04:23:20,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:20,743 INFO L471 AbstractCegarLoop]: Abstraction has 29736 states and 48967 transitions. [2024-10-11 04:23:20,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 29736 states and 48967 transitions. [2024-10-11 04:23:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:23:20,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:20,764 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] [2024-10-11 04:23:20,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:23:20,764 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:20,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 493454962, now seen corresponding path program 1 times [2024-10-11 04:23:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389223100] [2024-10-11 04:23:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:20,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:23:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:20,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:23:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:20,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:23:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:20,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:23:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389223100] [2024-10-11 04:23:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389223100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:20,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:20,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:20,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036965447] [2024-10-11 04:23:20,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:20,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:20,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:20,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:20,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:20,927 INFO L87 Difference]: Start difference. First operand 29736 states and 48967 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:27,510 INFO L93 Difference]: Finished difference Result 103013 states and 170141 transitions. [2024-10-11 04:23:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:27,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-11 04:23:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:27,864 INFO L225 Difference]: With dead ends: 103013 [2024-10-11 04:23:27,864 INFO L226 Difference]: Without dead ends: 75411 [2024-10-11 04:23:27,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:27,984 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 4972 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4994 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:27,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4994 Valid, 21202 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:23:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75411 states. [2024-10-11 04:23:32,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75411 to 57097. [2024-10-11 04:23:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57097 states, 51946 states have (on average 1.58291302506449) internal successors, (82226), 52205 states have internal predecessors, (82226), 3351 states have call successors, (3351), 1543 states have call predecessors, (3351), 1798 states have return successors, (10166), 3604 states have call predecessors, (10166), 3349 states have call successors, (10166) [2024-10-11 04:23:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57097 states to 57097 states and 95743 transitions. [2024-10-11 04:23:32,506 INFO L78 Accepts]: Start accepts. Automaton has 57097 states and 95743 transitions. Word has length 112 [2024-10-11 04:23:32,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:32,507 INFO L471 AbstractCegarLoop]: Abstraction has 57097 states and 95743 transitions. [2024-10-11 04:23:32,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-11 04:23:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 57097 states and 95743 transitions. [2024-10-11 04:23:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:23:32,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:32,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:32,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:23:32,541 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:32,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1818311156, now seen corresponding path program 1 times [2024-10-11 04:23:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:32,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239633025] [2024-10-11 04:23:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:32,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:32,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:32,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:23:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:32,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:23:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:32,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:23:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:32,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:23:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:32,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:32,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239633025] [2024-10-11 04:23:32,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239633025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:32,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:32,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779564900] [2024-10-11 04:23:32,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:32,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:32,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:32,701 INFO L87 Difference]: Start difference. First operand 57097 states and 95743 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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)