./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 38a1f42f3cb7a9f66fd0bd1b473ab60f2efbe0fc9c998d9f18da86c331297566 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:22:02,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:22:02,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:22:02,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:22:02,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:22:02,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:22:02,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:22:02,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:22:02,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:22:02,175 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:22:02,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:22:02,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:22:02,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:22:02,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:22:02,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:22:02,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:22:02,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:22:02,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:22:02,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:22:02,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:22:02,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:22:02,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:22:02,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:22:02,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:22:02,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:22:02,181 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:22:02,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:22:02,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:22:02,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:22:02,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:22:02,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:22:02,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:22:02,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:22:02,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:22:02,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:22:02,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:22:02,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:22:02,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:22:02,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:22:02,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:22:02,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:22:02,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:22:02,187 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 38a1f42f3cb7a9f66fd0bd1b473ab60f2efbe0fc9c998d9f18da86c331297566 [2024-11-11 22:22:02,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:22:02,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:22:02,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:22:02,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:22:02,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:22:02,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c [2024-11-11 22:22:03,950 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:22:04,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:22:04,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c [2024-11-11 22:22:04,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67021dffc/98777cc1bbbc4aa7b1ba9efdaf38dbf1/FLAGfc8bd42a5 [2024-11-11 22:22:05,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67021dffc/98777cc1bbbc4aa7b1ba9efdaf38dbf1 [2024-11-11 22:22:05,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:22:05,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:22:05,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:22:05,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:22:05,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:22:05,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:22:05" (1/1) ... [2024-11-11 22:22:05,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de81932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:05, skipping insertion in model container [2024-11-11 22:22:05,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:22:05" (1/1) ... [2024-11-11 22:22:05,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:22:06,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[380593,380606] [2024-11-11 22:22:06,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[383339,383352] [2024-11-11 22:22:07,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:22:07,205 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:22:07,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[380593,380606] [2024-11-11 22:22:07,965 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[383339,383352] [2024-11-11 22:22:07,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:22:08,087 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:22:08,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08 WrapperNode [2024-11-11 22:22:08,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:22:08,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:22:08,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:22:08,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:22:08,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:08,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:08,584 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13237 [2024-11-11 22:22:08,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:22:08,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:22:08,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:22:08,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:22:08,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:08,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:08,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:08,752 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-11-11 22:22:08,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:08,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:09,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:09,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:09,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:09,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:09,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:22:09,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:22:09,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:22:09,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:22:09,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (1/1) ... [2024-11-11 22:22:09,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:22:09,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:22:09,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:22:09,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:22:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:22:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 22:22:09,278 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 22:22:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:22:09,278 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:22:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 22:22:09,278 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 22:22:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-11 22:22:09,278 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-11 22:22:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 22:22:09,279 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 22:22:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 22:22:09,279 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 22:22:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 22:22:09,279 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 22:22:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:22:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:22:09,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:22:09,429 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:22:09,431 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:22:17,319 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2024-11-11 22:22:17,320 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:22:17,382 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:22:17,383 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-11 22:22:17,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:22:17 BoogieIcfgContainer [2024-11-11 22:22:17,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:22:17,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:22:17,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:22:17,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:22:17,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:22:05" (1/3) ... [2024-11-11 22:22:17,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e16aa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:22:17, skipping insertion in model container [2024-11-11 22:22:17,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:22:08" (2/3) ... [2024-11-11 22:22:17,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e16aa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:22:17, skipping insertion in model container [2024-11-11 22:22:17,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:22:17" (3/3) ... [2024-11-11 22:22:17,395 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.14.cil.c [2024-11-11 22:22:17,412 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:22:17,412 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:22:17,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:22:17,546 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;@1ba17fb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:22:17,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:22:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 2584 states, 2546 states have (on average 1.8389630793401415) internal successors, (4682), 2551 states have internal predecessors, (4682), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-11 22:22:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:22:17,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:22:17,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:22:17,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:22:17,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:22:17,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1563326470, now seen corresponding path program 1 times [2024-11-11 22:22:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:22:17,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903644962] [2024-11-11 22:22:17,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:22:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:22:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:18,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:22:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:18,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:22:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:18,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:22:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:18,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:22:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:18,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:22:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:22:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:22:18,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903644962] [2024-11-11 22:22:18,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903644962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:22:18,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:22:18,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:22:18,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144524302] [2024-11-11 22:22:18,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:22:18,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:22:18,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:22:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:22:18,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:22:18,370 INFO L87 Difference]: Start difference. First operand has 2584 states, 2546 states have (on average 1.8389630793401415) internal successors, (4682), 2551 states have internal predecessors, (4682), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:22:20,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:22:20,513 INFO L93 Difference]: Finished difference Result 5303 states and 9710 transitions. [2024-11-11 22:22:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:22:20,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-11 22:22:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:22:20,546 INFO L225 Difference]: With dead ends: 5303 [2024-11-11 22:22:20,546 INFO L226 Difference]: Without dead ends: 2658 [2024-11-11 22:22:20,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:22:20,560 INFO L435 NwaCegarLoop]: 4390 mSDtfsCounter, 1061 mSDsluCounter, 12501 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 16891 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:22:20,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 16891 Invalid, 1097 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 22:22:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-11-11 22:22:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2516. [2024-11-11 22:22:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2516 states, 2480 states have (on average 1.8221774193548388) internal successors, (4519), 2483 states have internal predecessors, (4519), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 22:22:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 4573 transitions. [2024-11-11 22:22:20,712 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 4573 transitions. Word has length 179 [2024-11-11 22:22:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:22:20,712 INFO L471 AbstractCegarLoop]: Abstraction has 2516 states and 4573 transitions. [2024-11-11 22:22:20,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:22:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 4573 transitions. [2024-11-11 22:22:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:22:20,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:22:20,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:22:20,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:22:20,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:22:20,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:22:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash -60228164, now seen corresponding path program 1 times [2024-11-11 22:22:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:22:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770314534] [2024-11-11 22:22:20,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:22:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:22:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:20,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:22:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:20,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:22:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:20,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:22:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:22:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:21,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:22:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:22:21,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:22:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770314534] [2024-11-11 22:22:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770314534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:22:21,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:22:21,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:22:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306188797] [2024-11-11 22:22:21,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:22:21,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:22:21,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:22:21,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:22:21,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:22:21,052 INFO L87 Difference]: Start difference. First operand 2516 states and 4573 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:22:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:22:22,935 INFO L93 Difference]: Finished difference Result 3038 states and 5408 transitions. [2024-11-11 22:22:22,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:22:22,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-11 22:22:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:22:22,953 INFO L225 Difference]: With dead ends: 3038 [2024-11-11 22:22:22,953 INFO L226 Difference]: Without dead ends: 2658 [2024-11-11 22:22:22,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:22:22,958 INFO L435 NwaCegarLoop]: 4320 mSDtfsCounter, 1047 mSDsluCounter, 12298 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 16618 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:22:22,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 16618 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:22:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-11-11 22:22:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2516. [2024-11-11 22:22:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2516 states, 2480 states have (on average 1.821774193548387) internal successors, (4518), 2483 states have internal predecessors, (4518), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 22:22:23,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 4572 transitions. [2024-11-11 22:22:23,032 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 4572 transitions. Word has length 179 [2024-11-11 22:22:23,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:22:23,033 INFO L471 AbstractCegarLoop]: Abstraction has 2516 states and 4572 transitions. [2024-11-11 22:22:23,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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-11-11 22:22:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 4572 transitions. [2024-11-11 22:22:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:22:23,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:22:23,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:22:23,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:22:23,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:22:23,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:22:23,037 INFO L85 PathProgramCache]: Analyzing trace with hash -630499970, now seen corresponding path program 1 times [2024-11-11 22:22:23,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:22:23,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235347518] [2024-11-11 22:22:23,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:22:23,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:22:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:22:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:22:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:23,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:22:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:23,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:22:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:23,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:22:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:22:23,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:22:23,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235347518] [2024-11-11 22:22:23,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235347518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:22:23,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:22:23,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:22:23,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363017116] [2024-11-11 22:22:23,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:22:23,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:22:23,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:22:23,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:22:23,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:22:23,402 INFO L87 Difference]: Start difference. First operand 2516 states and 4572 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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-11-11 22:22:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:22:26,207 INFO L93 Difference]: Finished difference Result 3568 states and 6261 transitions. [2024-11-11 22:22:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:22:26,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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 179 [2024-11-11 22:22:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:22:26,222 INFO L225 Difference]: With dead ends: 3568 [2024-11-11 22:22:26,222 INFO L226 Difference]: Without dead ends: 3193 [2024-11-11 22:22:26,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:22:26,225 INFO L435 NwaCegarLoop]: 4290 mSDtfsCounter, 5542 mSDsluCounter, 12890 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5561 SdHoareTripleChecker+Valid, 17180 SdHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:22:26,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5561 Valid, 17180 Invalid, 2385 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [116 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 22:22:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2024-11-11 22:22:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 2908. [2024-11-11 22:22:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2844 states have (on average 1.7907876230661042) internal successors, (5093), 2848 states have internal predecessors, (5093), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-11-11 22:22:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 5192 transitions. [2024-11-11 22:22:26,340 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 5192 transitions. Word has length 179 [2024-11-11 22:22:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:22:26,341 INFO L471 AbstractCegarLoop]: Abstraction has 2908 states and 5192 transitions. [2024-11-11 22:22:26,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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-11-11 22:22:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 5192 transitions. [2024-11-11 22:22:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:22:26,343 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:22:26,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:22:26,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:22:26,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:22:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:22:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2016239750, now seen corresponding path program 1 times [2024-11-11 22:22:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:22:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089497936] [2024-11-11 22:22:26,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:22:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:22:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:26,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:22:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:26,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:22:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:26,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:22:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:22:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:22:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:22:26,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:22:26,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089497936] [2024-11-11 22:22:26,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089497936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:22:26,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:22:26,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:22:26,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171304903] [2024-11-11 22:22:26,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:22:26,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:22:26,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:22:26,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:22:26,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:22:26,692 INFO L87 Difference]: Start difference. First operand 2908 states and 5192 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:22:30,539 INFO L93 Difference]: Finished difference Result 4513 states and 7773 transitions. [2024-11-11 22:22:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:22:30,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:22:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:22:30,562 INFO L225 Difference]: With dead ends: 4513 [2024-11-11 22:22:30,562 INFO L226 Difference]: Without dead ends: 3746 [2024-11-11 22:22:30,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:22:30,570 INFO L435 NwaCegarLoop]: 4548 mSDtfsCounter, 5575 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3597 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5594 SdHoareTripleChecker+Valid, 22413 SdHoareTripleChecker+Invalid, 3662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:22:30,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5594 Valid, 22413 Invalid, 3662 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3597 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 22:22:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2024-11-11 22:22:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3273. [2024-11-11 22:22:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3273 states, 3181 states have (on average 1.7648538195535994) internal successors, (5614), 3186 states have internal predecessors, (5614), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-11 22:22:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 5757 transitions. [2024-11-11 22:22:30,705 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 5757 transitions. Word has length 179 [2024-11-11 22:22:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:22:30,705 INFO L471 AbstractCegarLoop]: Abstraction has 3273 states and 5757 transitions. [2024-11-11 22:22:30,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 5757 transitions. [2024-11-11 22:22:30,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:22:30,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:22:30,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:22:30,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:22:30,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:22:30,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:22:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash 509255932, now seen corresponding path program 1 times [2024-11-11 22:22:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:22:30,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843557126] [2024-11-11 22:22:30,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:22:30,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:22:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:30,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:22:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:30,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:22:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:31,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:22:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:31,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:22:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:22:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:22:31,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:22:31,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843557126] [2024-11-11 22:22:31,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843557126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:22:31,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:22:31,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:22:31,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388674227] [2024-11-11 22:22:31,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:22:31,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:22:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:22:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:22:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:22:31,048 INFO L87 Difference]: Start difference. First operand 3273 states and 5757 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:22:34,689 INFO L93 Difference]: Finished difference Result 5907 states and 9984 transitions. [2024-11-11 22:22:34,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:22:34,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:22:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:22:34,716 INFO L225 Difference]: With dead ends: 5907 [2024-11-11 22:22:34,716 INFO L226 Difference]: Without dead ends: 4775 [2024-11-11 22:22:34,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:22:34,725 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 5689 mSDsluCounter, 17155 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5708 SdHoareTripleChecker+Valid, 21455 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:22:34,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5708 Valid, 21455 Invalid, 3165 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [107 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 22:22:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-11-11 22:22:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4004. [2024-11-11 22:22:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4004 states, 3856 states have (on average 1.7264004149377594) internal successors, (6657), 3863 states have internal predecessors, (6657), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-11 22:22:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 6892 transitions. [2024-11-11 22:22:34,957 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 6892 transitions. Word has length 179 [2024-11-11 22:22:34,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:22:34,958 INFO L471 AbstractCegarLoop]: Abstraction has 4004 states and 6892 transitions. [2024-11-11 22:22:34,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 6892 transitions. [2024-11-11 22:22:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:22:34,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:22:34,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:22:34,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:22:34,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:22:34,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:22:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash -102013126, now seen corresponding path program 1 times [2024-11-11 22:22:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:22:34,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168656525] [2024-11-11 22:22:34,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:22:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:22:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:22:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:22:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:22:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:35,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:22:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:35,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:22:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:22:35,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:22:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168656525] [2024-11-11 22:22:35,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168656525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:22:35,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:22:35,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:22:35,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366892987] [2024-11-11 22:22:35,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:22:35,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:22:35,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:22:35,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:22:35,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:22:35,321 INFO L87 Difference]: Start difference. First operand 4004 states and 6892 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:22:39,034 INFO L93 Difference]: Finished difference Result 8590 states and 14211 transitions. [2024-11-11 22:22:39,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:22:39,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:22:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:22:39,065 INFO L225 Difference]: With dead ends: 8590 [2024-11-11 22:22:39,066 INFO L226 Difference]: Without dead ends: 6727 [2024-11-11 22:22:39,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:22:39,075 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 5573 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3586 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5592 SdHoareTripleChecker+Valid, 22411 SdHoareTripleChecker+Invalid, 3653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:22:39,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5592 Valid, 22411 Invalid, 3653 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3586 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 22:22:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6727 states. [2024-11-11 22:22:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6727 to 5467. [2024-11-11 22:22:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5467 states, 5207 states have (on average 1.67908584597657) internal successors, (8743), 5218 states have internal predecessors, (8743), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-11 22:22:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5467 states to 5467 states and 9168 transitions. [2024-11-11 22:22:39,298 INFO L78 Accepts]: Start accepts. Automaton has 5467 states and 9168 transitions. Word has length 179 [2024-11-11 22:22:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:22:39,299 INFO L471 AbstractCegarLoop]: Abstraction has 5467 states and 9168 transitions. [2024-11-11 22:22:39,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5467 states and 9168 transitions. [2024-11-11 22:22:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:22:39,308 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:22:39,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:22:39,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:22:39,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:22:39,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:22:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1507204804, now seen corresponding path program 1 times [2024-11-11 22:22:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:22:39,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739259027] [2024-11-11 22:22:39,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:22:39,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:22:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:39,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:22:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:22:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:39,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:22:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:22:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:39,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:22:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:22:39,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:22:39,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739259027] [2024-11-11 22:22:39,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739259027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:22:39,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:22:39,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:22:39,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027559245] [2024-11-11 22:22:39,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:22:39,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:22:39,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:22:39,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:22:39,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:22:39,635 INFO L87 Difference]: Start difference. First operand 5467 states and 9168 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:22:43,156 INFO L93 Difference]: Finished difference Result 13948 states and 22669 transitions. [2024-11-11 22:22:43,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:22:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:22:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:22:43,209 INFO L225 Difference]: With dead ends: 13948 [2024-11-11 22:22:43,210 INFO L226 Difference]: Without dead ends: 10622 [2024-11-11 22:22:43,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:22:43,229 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 5569 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3558 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5588 SdHoareTripleChecker+Valid, 22411 SdHoareTripleChecker+Invalid, 3625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:22:43,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5588 Valid, 22411 Invalid, 3625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3558 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 22:22:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10622 states. [2024-11-11 22:22:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10622 to 8407. [2024-11-11 22:22:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8407 states, 7923 states have (on average 1.6330935251798562) internal successors, (12939), 7942 states have internal predecessors, (12939), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-11 22:22:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8407 states to 8407 states and 13762 transitions. [2024-11-11 22:22:43,770 INFO L78 Accepts]: Start accepts. Automaton has 8407 states and 13762 transitions. Word has length 179 [2024-11-11 22:22:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:22:43,772 INFO L471 AbstractCegarLoop]: Abstraction has 8407 states and 13762 transitions. [2024-11-11 22:22:43,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 8407 states and 13762 transitions. [2024-11-11 22:22:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:22:43,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:22:43,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:22:43,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:22:43,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:22:43,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:22:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash -60623938, now seen corresponding path program 1 times [2024-11-11 22:22:43,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:22:43,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385098647] [2024-11-11 22:22:43,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:22:43,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:22:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:43,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:22:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:43,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:22:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:44,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:22:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:44,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:22:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:22:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:22:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:22:44,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385098647] [2024-11-11 22:22:44,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385098647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:22:44,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:22:44,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:22:44,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908551202] [2024-11-11 22:22:44,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:22:44,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:22:44,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:22:44,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:22:44,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:22:44,091 INFO L87 Difference]: Start difference. First operand 8407 states and 13762 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:22:48,159 INFO L93 Difference]: Finished difference Result 24682 states and 39677 transitions. [2024-11-11 22:22:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:22:48,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:22:48,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:22:48,231 INFO L225 Difference]: With dead ends: 24682 [2024-11-11 22:22:48,232 INFO L226 Difference]: Without dead ends: 18416 [2024-11-11 22:22:48,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:22:48,260 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 5568 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3545 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5587 SdHoareTripleChecker+Valid, 22411 SdHoareTripleChecker+Invalid, 3612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:22:48,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5587 Valid, 22411 Invalid, 3612 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3545 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 22:22:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18416 states. [2024-11-11 22:22:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18416 to 14300. [2024-11-11 22:22:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14300 states, 13368 states have (on average 1.5970227408737283) internal successors, (21349), 13403 states have internal predecessors, (21349), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-11 22:22:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14300 states to 14300 states and 23022 transitions. [2024-11-11 22:22:48,941 INFO L78 Accepts]: Start accepts. Automaton has 14300 states and 23022 transitions. Word has length 179 [2024-11-11 22:22:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:22:48,942 INFO L471 AbstractCegarLoop]: Abstraction has 14300 states and 23022 transitions. [2024-11-11 22:22:48,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 14300 states and 23022 transitions. [2024-11-11 22:22:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:22:48,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:22:48,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:22:48,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:22:48,951 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:22:48,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:22:48,953 INFO L85 PathProgramCache]: Analyzing trace with hash -983791364, now seen corresponding path program 1 times [2024-11-11 22:22:48,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:22:48,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183913295] [2024-11-11 22:22:48,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:22:48,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:22:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:49,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:22:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:22:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:49,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:22:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:49,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:22:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:49,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:22:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:22:49,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:22:49,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183913295] [2024-11-11 22:22:49,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183913295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:22:49,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:22:49,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:22:49,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000128649] [2024-11-11 22:22:49,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:22:49,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:22:49,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:22:49,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:22:49,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:22:49,339 INFO L87 Difference]: Start difference. First operand 14300 states and 23022 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:22:51,492 INFO L93 Difference]: Finished difference Result 30826 states and 49644 transitions. [2024-11-11 22:22:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:22:51,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:22:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:22:51,567 INFO L225 Difference]: With dead ends: 30826 [2024-11-11 22:22:51,567 INFO L226 Difference]: Without dead ends: 18667 [2024-11-11 22:22:51,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:22:51,613 INFO L435 NwaCegarLoop]: 4275 mSDtfsCounter, 5121 mSDsluCounter, 16832 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5141 SdHoareTripleChecker+Valid, 21107 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:22:51,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5141 Valid, 21107 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:22:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18667 states. [2024-11-11 22:22:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18667 to 14300. [2024-11-11 22:22:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14300 states, 13368 states have (on average 1.594554159186116) internal successors, (21316), 13403 states have internal predecessors, (21316), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-11 22:22:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14300 states to 14300 states and 22989 transitions. [2024-11-11 22:22:52,441 INFO L78 Accepts]: Start accepts. Automaton has 14300 states and 22989 transitions. Word has length 179 [2024-11-11 22:22:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:22:52,441 INFO L471 AbstractCegarLoop]: Abstraction has 14300 states and 22989 transitions. [2024-11-11 22:22:52,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 14300 states and 22989 transitions. [2024-11-11 22:22:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:22:52,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:22:52,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:22:52,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:22:52,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:22:52,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:22:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash -597928962, now seen corresponding path program 1 times [2024-11-11 22:22:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:22:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547443140] [2024-11-11 22:22:52,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:22:52,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:22:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:52,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:22:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:22:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:52,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:22:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:52,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:22:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:52,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:22:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:22:52,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:22:52,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547443140] [2024-11-11 22:22:52,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547443140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:22:52,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:22:52,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:22:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023824898] [2024-11-11 22:22:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:22:52,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:22:52,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:22:52,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:22:52,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:22:52,729 INFO L87 Difference]: Start difference. First operand 14300 states and 22989 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:22:57,104 INFO L93 Difference]: Finished difference Result 46115 states and 73651 transitions. [2024-11-11 22:22:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:22:57,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:22:57,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:22:57,251 INFO L225 Difference]: With dead ends: 46115 [2024-11-11 22:22:57,251 INFO L226 Difference]: Without dead ends: 33956 [2024-11-11 22:22:57,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:22:57,300 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 5560 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5579 SdHoareTripleChecker+Valid, 22411 SdHoareTripleChecker+Invalid, 3574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:22:57,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5579 Valid, 22411 Invalid, 3574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 22:22:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33956 states. [2024-11-11 22:22:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33956 to 26150. [2024-11-11 22:22:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26150 states, 24322 states have (on average 1.5699366828385823) internal successors, (38184), 24389 states have internal predecessors, (38184), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-11-11 22:22:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26150 states to 26150 states and 41719 transitions. [2024-11-11 22:22:58,842 INFO L78 Accepts]: Start accepts. Automaton has 26150 states and 41719 transitions. Word has length 179 [2024-11-11 22:22:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:22:58,842 INFO L471 AbstractCegarLoop]: Abstraction has 26150 states and 41719 transitions. [2024-11-11 22:22:58,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:22:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 26150 states and 41719 transitions. [2024-11-11 22:22:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:22:58,863 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:22:58,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:22:58,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:22:58,864 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:22:58,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:22:58,864 INFO L85 PathProgramCache]: Analyzing trace with hash -862576452, now seen corresponding path program 1 times [2024-11-11 22:22:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:22:58,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334328330] [2024-11-11 22:22:58,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:22:58,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:22:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:58,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:22:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:22:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:22:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:59,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:22:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:59,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:22:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:22:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:22:59,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:22:59,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334328330] [2024-11-11 22:22:59,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334328330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:22:59,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:22:59,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:22:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359478982] [2024-11-11 22:22:59,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:22:59,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:22:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:22:59,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:22:59,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:22:59,116 INFO L87 Difference]: Start difference. First operand 26150 states and 41719 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:23:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:23:04,521 INFO L93 Difference]: Finished difference Result 89051 states and 142475 transitions. [2024-11-11 22:23:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:23:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:23:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:23:04,751 INFO L225 Difference]: With dead ends: 89051 [2024-11-11 22:23:04,752 INFO L226 Difference]: Without dead ends: 65042 [2024-11-11 22:23:04,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:23:04,821 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 5559 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3494 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5578 SdHoareTripleChecker+Valid, 22411 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:23:04,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5578 Valid, 22411 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3494 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 22:23:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65042 states. [2024-11-11 22:23:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65042 to 49911. [2024-11-11 22:23:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49911 states, 46291 states have (on average 1.555593959949018) internal successors, (72010), 46422 states have internal predecessors, (72010), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 902 states have return successors, (5029), 2841 states have call predecessors, (5029), 2714 states have call successors, (5029) [2024-11-11 22:23:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49911 states to 49911 states and 79755 transitions. [2024-11-11 22:23:07,889 INFO L78 Accepts]: Start accepts. Automaton has 49911 states and 79755 transitions. Word has length 179 [2024-11-11 22:23:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:23:07,890 INFO L471 AbstractCegarLoop]: Abstraction has 49911 states and 79755 transitions. [2024-11-11 22:23:07,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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-11-11 22:23:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 49911 states and 79755 transitions. [2024-11-11 22:23:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:23:07,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:23:07,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:23:07,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:23:07,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:23:07,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:23:07,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1068549182, now seen corresponding path program 1 times [2024-11-11 22:23:07,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:23:07,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701711738] [2024-11-11 22:23:07,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:23:07,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:23:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:23:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:23:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:23:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:23:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:23:08,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:23:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:23:08,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:23:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:23:08,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:23:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:23:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:23:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:23:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701711738] [2024-11-11 22:23:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701711738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:23:08,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:23:08,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:23:08,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792481934] [2024-11-11 22:23:08,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:23:08,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:23:08,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:23:08,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:23:08,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:23:08,183 INFO L87 Difference]: Start difference. First operand 49911 states and 79755 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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)