./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.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/pc_sfifo_1.cil-2+token_ring.05.cil-1.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 b5bbf318bd4a4e295f88f23f80bb9f32022c2eeb214e815b87206f6eafbbf272 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:53:26,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:53:26,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:53:26,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:53:26,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:53:26,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:53:26,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:53:26,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:53:26,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:53:26,337 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:53:26,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:53:26,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:53:26,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:53:26,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:53:26,340 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:53:26,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:53:26,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:53:26,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:53:26,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:53:26,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:53:26,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:53:26,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:53:26,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:53:26,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:53:26,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:53:26,346 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:53:26,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:53:26,346 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:53:26,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:53:26,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:53:26,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:53:26,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:53:26,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:53:26,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:53:26,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:53:26,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:53:26,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:53:26,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:53:26,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:53:26,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:53:26,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:53:26,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:53:26,350 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 -> b5bbf318bd4a4e295f88f23f80bb9f32022c2eeb214e815b87206f6eafbbf272 [2024-11-11 22:53:26,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:53:26,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:53:26,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:53:26,576 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:53:26,576 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:53:26,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.c [2024-11-11 22:53:27,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:53:27,962 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:53:27,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-1.c [2024-11-11 22:53:27,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ba91bf1/280a0a9967c94eb4b0c7062d712a6b59/FLAG626e20ca5 [2024-11-11 22:53:28,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ba91bf1/280a0a9967c94eb4b0c7062d712a6b59 [2024-11-11 22:53:28,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:53:28,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:53:28,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:53:28,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:53:28,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:53:28,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d4c933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28, skipping insertion in model container [2024-11-11 22:53:28,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:53:28,562 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/pc_sfifo_1.cil-2+token_ring.05.cil-1.c[913,926] [2024-11-11 22:53:28,609 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/pc_sfifo_1.cil-2+token_ring.05.cil-1.c[5977,5990] [2024-11-11 22:53:28,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:53:28,686 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:53:28,695 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/pc_sfifo_1.cil-2+token_ring.05.cil-1.c[913,926] [2024-11-11 22:53:28,705 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/pc_sfifo_1.cil-2+token_ring.05.cil-1.c[5977,5990] [2024-11-11 22:53:28,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:53:28,750 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:53:28,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28 WrapperNode [2024-11-11 22:53:28,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:53:28,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:53:28,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:53:28,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:53:28,758 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:53:28" (1/1) ... [2024-11-11 22:53:28,767 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:53:28" (1/1) ... [2024-11-11 22:53:28,792 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 663 [2024-11-11 22:53:28,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:53:28,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:53:28,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:53:28,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:53:28,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,818 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:53:28,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:53:28,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:53:28,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:53:28,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:53:28,842 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28" (1/1) ... [2024-11-11 22:53:28,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:53:28,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:53:28,877 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:53:28,880 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:53:28,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:53:28,924 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:53:28,924 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:53:28,924 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-11 22:53:28,926 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-11 22:53:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:53:28,926 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:53:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:53:28,926 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:53:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:53:28,926 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:53:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:53:28,926 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:53:28,926 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:53:28,926 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:53:28,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:53:28,927 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:53:28,927 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:53:28,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:53:28,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:53:28,927 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:53:28,927 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:53:29,025 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:53:29,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:53:29,496 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-11-11 22:53:29,497 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:53:29,513 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:53:29,514 INFO L316 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-11 22:53:29,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:53:29 BoogieIcfgContainer [2024-11-11 22:53:29,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:53:29,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:53:29,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:53:29,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:53:29,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:53:28" (1/3) ... [2024-11-11 22:53:29,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64acddc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:53:29, skipping insertion in model container [2024-11-11 22:53:29,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:28" (2/3) ... [2024-11-11 22:53:29,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64acddc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:53:29, skipping insertion in model container [2024-11-11 22:53:29,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:53:29" (3/3) ... [2024-11-11 22:53:29,521 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.05.cil-1.c [2024-11-11 22:53:29,532 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:53:29,533 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:53:29,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:53:29,594 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;@63f05017, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:53:29,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:53:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 285 states, 248 states have (on average 1.592741935483871) internal successors, (395), 253 states have internal predecessors, (395), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-11 22:53:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 22:53:29,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:29,606 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] [2024-11-11 22:53:29,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:29,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:29,611 INFO L85 PathProgramCache]: Analyzing trace with hash -755848238, now seen corresponding path program 1 times [2024-11-11 22:53:29,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:29,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612548393] [2024-11-11 22:53:29,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:29,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:29,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 22:53:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:29,853 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:53:29,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:29,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612548393] [2024-11-11 22:53:29,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612548393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:29,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:29,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:53:29,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252464628] [2024-11-11 22:53:29,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:29,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:29,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:29,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:29,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:53:29,901 INFO L87 Difference]: Start difference. First operand has 285 states, 248 states have (on average 1.592741935483871) internal successors, (395), 253 states have internal predecessors, (395), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:30,311 INFO L93 Difference]: Finished difference Result 622 states and 972 transitions. [2024-11-11 22:53:30,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:53:30,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-11 22:53:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:30,326 INFO L225 Difference]: With dead ends: 622 [2024-11-11 22:53:30,328 INFO L226 Difference]: Without dead ends: 345 [2024-11-11 22:53:30,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:53:30,337 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 529 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:30,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 582 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:53:30,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-11 22:53:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 339. [2024-11-11 22:53:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 297 states have (on average 1.468013468013468) internal successors, (436), 301 states have internal predecessors, (436), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2024-11-11 22:53:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 498 transitions. [2024-11-11 22:53:30,402 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 498 transitions. Word has length 44 [2024-11-11 22:53:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:30,402 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 498 transitions. [2024-11-11 22:53:30,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 498 transitions. [2024-11-11 22:53:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:53:30,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:30,405 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] [2024-11-11 22:53:30,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:53:30,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:30,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:30,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1540596074, now seen corresponding path program 1 times [2024-11-11 22:53:30,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:30,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478465291] [2024-11-11 22:53:30,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:30,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:53:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:30,501 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:53:30,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:30,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478465291] [2024-11-11 22:53:30,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478465291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:30,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:30,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:53:30,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029633565] [2024-11-11 22:53:30,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:30,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:30,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:30,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:30,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:53:30,504 INFO L87 Difference]: Start difference. First operand 339 states and 498 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:30,800 INFO L93 Difference]: Finished difference Result 587 states and 838 transitions. [2024-11-11 22:53:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:53:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-11 22:53:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:30,804 INFO L225 Difference]: With dead ends: 587 [2024-11-11 22:53:30,804 INFO L226 Difference]: Without dead ends: 463 [2024-11-11 22:53:30,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:53:30,805 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 229 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:30,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 772 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:53:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-11 22:53:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 406. [2024-11-11 22:53:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 358 states have (on average 1.452513966480447) internal successors, (520), 362 states have internal predecessors, (520), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (36), 30 states have call predecessors, (36), 30 states have call successors, (36) [2024-11-11 22:53:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 588 transitions. [2024-11-11 22:53:30,827 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 588 transitions. Word has length 45 [2024-11-11 22:53:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:30,827 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 588 transitions. [2024-11-11 22:53:30,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 588 transitions. [2024-11-11 22:53:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:53:30,829 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:30,829 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] [2024-11-11 22:53:30,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:53:30,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:30,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:30,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1470013761, now seen corresponding path program 1 times [2024-11-11 22:53:30,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:30,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374457701] [2024-11-11 22:53:30,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:30,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:30,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:53:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:30,878 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:53:30,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:30,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374457701] [2024-11-11 22:53:30,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374457701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:30,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:30,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:53:30,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251158555] [2024-11-11 22:53:30,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:30,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:30,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:30,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:30,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:53:30,880 INFO L87 Difference]: Start difference. First operand 406 states and 588 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:31,200 INFO L93 Difference]: Finished difference Result 814 states and 1147 transitions. [2024-11-11 22:53:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:53:31,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-11 22:53:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:31,204 INFO L225 Difference]: With dead ends: 814 [2024-11-11 22:53:31,204 INFO L226 Difference]: Without dead ends: 623 [2024-11-11 22:53:31,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:53:31,205 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 539 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:31,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 575 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:53:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-11 22:53:31,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 571. [2024-11-11 22:53:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 504 states have (on average 1.4087301587301588) internal successors, (710), 511 states have internal predecessors, (710), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (53), 39 states have call predecessors, (53), 41 states have call successors, (53) [2024-11-11 22:53:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 806 transitions. [2024-11-11 22:53:31,241 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 806 transitions. Word has length 45 [2024-11-11 22:53:31,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:31,241 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 806 transitions. [2024-11-11 22:53:31,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 806 transitions. [2024-11-11 22:53:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 22:53:31,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:31,244 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:31,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:53:31,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:31,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:31,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1444915554, now seen corresponding path program 1 times [2024-11-11 22:53:31,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:31,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799170930] [2024-11-11 22:53:31,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:31,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:31,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:31,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 22:53:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:31,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:53:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 22:53:31,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:31,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799170930] [2024-11-11 22:53:31,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799170930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:31,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:53:31,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766665666] [2024-11-11 22:53:31,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:31,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:31,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:53:31,343 INFO L87 Difference]: Start difference. First operand 571 states and 806 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:53:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:31,614 INFO L93 Difference]: Finished difference Result 1155 states and 1591 transitions. [2024-11-11 22:53:31,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:53:31,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2024-11-11 22:53:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:31,619 INFO L225 Difference]: With dead ends: 1155 [2024-11-11 22:53:31,619 INFO L226 Difference]: Without dead ends: 799 [2024-11-11 22:53:31,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:53:31,623 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 213 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:31,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 825 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:53:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-11 22:53:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 761. [2024-11-11 22:53:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 670 states have (on average 1.3582089552238805) internal successors, (910), 679 states have internal predecessors, (910), 57 states have call successors, (57), 29 states have call predecessors, (57), 32 states have return successors, (77), 53 states have call predecessors, (77), 55 states have call successors, (77) [2024-11-11 22:53:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1044 transitions. [2024-11-11 22:53:31,655 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1044 transitions. Word has length 62 [2024-11-11 22:53:31,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:31,656 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1044 transitions. [2024-11-11 22:53:31,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:53:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1044 transitions. [2024-11-11 22:53:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 22:53:31,660 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:31,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:31,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:53:31,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:31,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1696333881, now seen corresponding path program 1 times [2024-11-11 22:53:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:31,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182123987] [2024-11-11 22:53:31,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:31,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:31,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:53:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:53:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 22:53:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182123987] [2024-11-11 22:53:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182123987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:31,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:31,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:53:31,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603586806] [2024-11-11 22:53:31,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:31,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:31,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:31,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:31,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:53:31,735 INFO L87 Difference]: Start difference. First operand 761 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 22:53:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:31,972 INFO L93 Difference]: Finished difference Result 1414 states and 1897 transitions. [2024-11-11 22:53:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:53:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-11 22:53:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:31,976 INFO L225 Difference]: With dead ends: 1414 [2024-11-11 22:53:31,976 INFO L226 Difference]: Without dead ends: 960 [2024-11-11 22:53:31,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:53:31,978 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 526 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:31,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 574 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:53:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-11 22:53:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 905. [2024-11-11 22:53:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 798 states have (on average 1.3295739348370927) internal successors, (1061), 809 states have internal predecessors, (1061), 65 states have call successors, (65), 35 states have call predecessors, (65), 40 states have return successors, (91), 61 states have call predecessors, (91), 63 states have call successors, (91) [2024-11-11 22:53:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1217 transitions. [2024-11-11 22:53:32,013 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1217 transitions. Word has length 67 [2024-11-11 22:53:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:32,013 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1217 transitions. [2024-11-11 22:53:32,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 22:53:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1217 transitions. [2024-11-11 22:53:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 22:53:32,015 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:32,015 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:32,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:53:32,017 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:32,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash -343902925, now seen corresponding path program 1 times [2024-11-11 22:53:32,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:32,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120784472] [2024-11-11 22:53:32,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:32,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:32,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:53:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:32,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:53:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:53:32,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120784472] [2024-11-11 22:53:32,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120784472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:53:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534585771] [2024-11-11 22:53:32,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:32,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:53:32,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:53:32,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:53:32,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:53:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:32,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 22:53:32,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:53:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:32,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:53:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:53:32,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534585771] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 22:53:32,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 22:53:32,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-11 22:53:32,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027484955] [2024-11-11 22:53:32,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:32,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:32,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:32,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:32,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:53:32,334 INFO L87 Difference]: Start difference. First operand 905 states and 1217 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:53:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:32,488 INFO L93 Difference]: Finished difference Result 961 states and 1285 transitions. [2024-11-11 22:53:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:53:32,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2024-11-11 22:53:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:32,493 INFO L225 Difference]: With dead ends: 961 [2024-11-11 22:53:32,493 INFO L226 Difference]: Without dead ends: 958 [2024-11-11 22:53:32,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:53:32,494 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 725 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:32,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 498 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:53:32,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-11-11 22:53:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 904. [2024-11-11 22:53:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 798 states have (on average 1.3270676691729324) internal successors, (1059), 808 states have internal predecessors, (1059), 64 states have call successors, (64), 35 states have call predecessors, (64), 40 states have return successors, (91), 61 states have call predecessors, (91), 63 states have call successors, (91) [2024-11-11 22:53:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1214 transitions. [2024-11-11 22:53:32,543 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1214 transitions. Word has length 68 [2024-11-11 22:53:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:32,543 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1214 transitions. [2024-11-11 22:53:32,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:53:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1214 transitions. [2024-11-11 22:53:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 22:53:32,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:32,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:32,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:53:32,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 22:53:32,747 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:32,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2071941380, now seen corresponding path program 1 times [2024-11-11 22:53:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:32,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902741383] [2024-11-11 22:53:32,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:32,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:32,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:53:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:32,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:53:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:53:32,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:32,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902741383] [2024-11-11 22:53:32,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902741383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:53:32,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072749188] [2024-11-11 22:53:32,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:32,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:53:32,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:53:32,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:53:32,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 22:53:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:32,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 22:53:32,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:53:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:33,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:53:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:53:33,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072749188] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:53:33,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:53:33,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-11 22:53:33,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040908256] [2024-11-11 22:53:33,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:53:33,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 22:53:33,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:33,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 22:53:33,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:53:33,207 INFO L87 Difference]: Start difference. First operand 904 states and 1214 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:53:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:34,040 INFO L93 Difference]: Finished difference Result 2411 states and 3202 transitions. [2024-11-11 22:53:34,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 22:53:34,041 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-11 22:53:34,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:34,047 INFO L225 Difference]: With dead ends: 2411 [2024-11-11 22:53:34,047 INFO L226 Difference]: Without dead ends: 1867 [2024-11-11 22:53:34,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-11 22:53:34,050 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 1049 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:34,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 2365 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:53:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2024-11-11 22:53:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1267. [2024-11-11 22:53:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1122 states have (on average 1.3003565062388591) internal successors, (1459), 1140 states have internal predecessors, (1459), 84 states have call successors, (84), 49 states have call predecessors, (84), 59 states have return successors, (125), 78 states have call predecessors, (125), 83 states have call successors, (125) [2024-11-11 22:53:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1668 transitions. [2024-11-11 22:53:34,126 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1668 transitions. Word has length 69 [2024-11-11 22:53:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:34,126 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1668 transitions. [2024-11-11 22:53:34,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:53:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1668 transitions. [2024-11-11 22:53:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 22:53:34,129 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:34,129 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:34,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 22:53:34,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-11 22:53:34,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:34,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash -962917584, now seen corresponding path program 1 times [2024-11-11 22:53:34,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:34,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823006595] [2024-11-11 22:53:34,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:34,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:53:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:53:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 22:53:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 22:53:34,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823006595] [2024-11-11 22:53:34,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823006595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:53:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812810307] [2024-11-11 22:53:34,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:34,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:53:34,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:53:34,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:53:34,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 22:53:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 22:53:34,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:53:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:53:34,536 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:53:34,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812810307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:34,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:53:34,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:53:34,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127520457] [2024-11-11 22:53:34,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:34,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:53:34,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:34,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:53:34,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:34,538 INFO L87 Difference]: Start difference. First operand 1267 states and 1668 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:53:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:34,578 INFO L93 Difference]: Finished difference Result 1964 states and 2572 transitions. [2024-11-11 22:53:34,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:53:34,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-11 22:53:34,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:34,584 INFO L225 Difference]: With dead ends: 1964 [2024-11-11 22:53:34,584 INFO L226 Difference]: Without dead ends: 1145 [2024-11-11 22:53:34,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:34,587 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 367 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:34,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 512 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:53:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-11-11 22:53:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1130. [2024-11-11 22:53:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1001 states have (on average 1.2997002997002998) internal successors, (1301), 1018 states have internal predecessors, (1301), 76 states have call successors, (76), 43 states have call predecessors, (76), 51 states have return successors, (111), 69 states have call predecessors, (111), 75 states have call successors, (111) [2024-11-11 22:53:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1488 transitions. [2024-11-11 22:53:34,628 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1488 transitions. Word has length 88 [2024-11-11 22:53:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:34,629 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1488 transitions. [2024-11-11 22:53:34,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:53:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1488 transitions. [2024-11-11 22:53:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:34,631 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:34,631 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] [2024-11-11 22:53:34,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 22:53:34,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:53:34,832 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:34,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1627073702, now seen corresponding path program 1 times [2024-11-11 22:53:34,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:34,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664720606] [2024-11-11 22:53:34,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:34,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:34,947 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:53:34,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664720606] [2024-11-11 22:53:34,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664720606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:34,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:34,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:53:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609598307] [2024-11-11 22:53:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:34,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:53:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:53:34,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:53:34,949 INFO L87 Difference]: Start difference. First operand 1130 states and 1488 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:36,085 INFO L93 Difference]: Finished difference Result 1654 states and 2307 transitions. [2024-11-11 22:53:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:53:36,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:36,091 INFO L225 Difference]: With dead ends: 1654 [2024-11-11 22:53:36,091 INFO L226 Difference]: Without dead ends: 1459 [2024-11-11 22:53:36,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:53:36,093 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 907 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:36,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 996 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:53:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-11-11 22:53:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1330. [2024-11-11 22:53:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1180 states have (on average 1.335593220338983) internal successors, (1576), 1198 states have internal predecessors, (1576), 90 states have call successors, (90), 49 states have call predecessors, (90), 58 states have return successors, (128), 83 states have call predecessors, (128), 89 states have call successors, (128) [2024-11-11 22:53:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1794 transitions. [2024-11-11 22:53:36,176 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1794 transitions. Word has length 101 [2024-11-11 22:53:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:36,177 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1794 transitions. [2024-11-11 22:53:36,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1794 transitions. [2024-11-11 22:53:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:36,180 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:36,180 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] [2024-11-11 22:53:36,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:53:36,181 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:36,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:36,181 INFO L85 PathProgramCache]: Analyzing trace with hash -89810902, now seen corresponding path program 1 times [2024-11-11 22:53:36,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:36,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193229077] [2024-11-11 22:53:36,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:36,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:36,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:36,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:36,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:36,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:36,314 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:53:36,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:36,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193229077] [2024-11-11 22:53:36,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193229077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:36,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:36,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:36,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216894526] [2024-11-11 22:53:36,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:36,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:36,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:36,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:36,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:36,316 INFO L87 Difference]: Start difference. First operand 1330 states and 1794 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:37,853 INFO L93 Difference]: Finished difference Result 2124 states and 3030 transitions. [2024-11-11 22:53:37,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:53:37,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:37,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:37,859 INFO L225 Difference]: With dead ends: 2124 [2024-11-11 22:53:37,859 INFO L226 Difference]: Without dead ends: 1729 [2024-11-11 22:53:37,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:53:37,861 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 922 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 1860 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:37,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1615 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1860 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:53:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2024-11-11 22:53:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1517. [2024-11-11 22:53:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1346 states have (on average 1.3558692421991085) internal successors, (1825), 1365 states have internal predecessors, (1825), 104 states have call successors, (104), 55 states have call predecessors, (104), 65 states have return successors, (144), 98 states have call predecessors, (144), 103 states have call successors, (144) [2024-11-11 22:53:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2073 transitions. [2024-11-11 22:53:37,937 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2073 transitions. Word has length 101 [2024-11-11 22:53:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:37,937 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2073 transitions. [2024-11-11 22:53:37,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2073 transitions. [2024-11-11 22:53:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:37,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:37,940 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] [2024-11-11 22:53:37,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:53:37,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:37,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1968941848, now seen corresponding path program 1 times [2024-11-11 22:53:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:37,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724832339] [2024-11-11 22:53:37,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:37,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:38,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:38,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:38,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:38,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:38,067 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:53:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724832339] [2024-11-11 22:53:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724832339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:38,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:38,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:38,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160496199] [2024-11-11 22:53:38,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:38,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:38,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:38,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:38,069 INFO L87 Difference]: Start difference. First operand 1517 states and 2073 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:38,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:38,766 INFO L93 Difference]: Finished difference Result 2315 states and 3323 transitions. [2024-11-11 22:53:38,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:53:38,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:38,773 INFO L225 Difference]: With dead ends: 2315 [2024-11-11 22:53:38,773 INFO L226 Difference]: Without dead ends: 1733 [2024-11-11 22:53:38,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:53:38,775 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 826 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:38,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 782 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:53:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2024-11-11 22:53:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1517. [2024-11-11 22:53:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1346 states have (on average 1.3536404160475484) internal successors, (1822), 1365 states have internal predecessors, (1822), 104 states have call successors, (104), 55 states have call predecessors, (104), 65 states have return successors, (144), 98 states have call predecessors, (144), 103 states have call successors, (144) [2024-11-11 22:53:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2070 transitions. [2024-11-11 22:53:38,863 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2070 transitions. Word has length 101 [2024-11-11 22:53:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:38,863 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2070 transitions. [2024-11-11 22:53:38,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2070 transitions. [2024-11-11 22:53:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:38,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:38,865 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] [2024-11-11 22:53:38,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:53:38,865 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:38,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:38,866 INFO L85 PathProgramCache]: Analyzing trace with hash -402183898, now seen corresponding path program 1 times [2024-11-11 22:53:38,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:38,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275290316] [2024-11-11 22:53:38,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:38,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:38,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:38,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:38,996 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:53:38,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:38,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275290316] [2024-11-11 22:53:38,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275290316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:38,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:38,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:38,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890793739] [2024-11-11 22:53:38,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:38,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:38,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:38,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:38,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:38,998 INFO L87 Difference]: Start difference. First operand 1517 states and 2070 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:40,213 INFO L93 Difference]: Finished difference Result 2811 states and 4067 transitions. [2024-11-11 22:53:40,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:53:40,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:40,220 INFO L225 Difference]: With dead ends: 2811 [2024-11-11 22:53:40,220 INFO L226 Difference]: Without dead ends: 2229 [2024-11-11 22:53:40,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:53:40,222 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 909 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:40,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1613 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1814 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:53:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2024-11-11 22:53:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 1898. [2024-11-11 22:53:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1685 states have (on average 1.3821958456973293) internal successors, (2329), 1706 states have internal predecessors, (2329), 132 states have call successors, (132), 67 states have call predecessors, (132), 79 states have return successors, (180), 128 states have call predecessors, (180), 131 states have call successors, (180) [2024-11-11 22:53:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2641 transitions. [2024-11-11 22:53:40,339 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2641 transitions. Word has length 101 [2024-11-11 22:53:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:40,340 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2641 transitions. [2024-11-11 22:53:40,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2641 transitions. [2024-11-11 22:53:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:40,343 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:40,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] [2024-11-11 22:53:40,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:53:40,343 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:40,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:40,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1460021976, now seen corresponding path program 1 times [2024-11-11 22:53:40,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:40,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665387628] [2024-11-11 22:53:40,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:40,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:40,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:40,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:40,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:40,496 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:53:40,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:40,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665387628] [2024-11-11 22:53:40,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665387628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:40,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:40,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006253979] [2024-11-11 22:53:40,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:40,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:40,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:40,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:40,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:40,499 INFO L87 Difference]: Start difference. First operand 1898 states and 2641 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:41,875 INFO L93 Difference]: Finished difference Result 4152 states and 6102 transitions. [2024-11-11 22:53:41,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:53:41,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:41,886 INFO L225 Difference]: With dead ends: 4152 [2024-11-11 22:53:41,886 INFO L226 Difference]: Without dead ends: 3189 [2024-11-11 22:53:41,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:53:41,889 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 908 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:41,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1613 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:53:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2024-11-11 22:53:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2659. [2024-11-11 22:53:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2659 states, 2362 states have (on average 1.413632514817951) internal successors, (3339), 2387 states have internal predecessors, (3339), 188 states have call successors, (188), 91 states have call predecessors, (188), 107 states have return successors, (258), 188 states have call predecessors, (258), 187 states have call successors, (258) [2024-11-11 22:53:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 3785 transitions. [2024-11-11 22:53:42,043 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 3785 transitions. Word has length 101 [2024-11-11 22:53:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:42,043 INFO L471 AbstractCegarLoop]: Abstraction has 2659 states and 3785 transitions. [2024-11-11 22:53:42,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3785 transitions. [2024-11-11 22:53:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:42,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:42,046 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] [2024-11-11 22:53:42,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:53:42,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:42,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1692442854, now seen corresponding path program 1 times [2024-11-11 22:53:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457184039] [2024-11-11 22:53:42,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,183 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:53:42,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:42,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457184039] [2024-11-11 22:53:42,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457184039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:42,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:42,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:42,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119867934] [2024-11-11 22:53:42,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:42,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:42,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:42,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:42,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:42,185 INFO L87 Difference]: Start difference. First operand 2659 states and 3785 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:43,672 INFO L93 Difference]: Finished difference Result 7463 states and 11130 transitions. [2024-11-11 22:53:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:53:43,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:43,688 INFO L225 Difference]: With dead ends: 7463 [2024-11-11 22:53:43,688 INFO L226 Difference]: Without dead ends: 5739 [2024-11-11 22:53:43,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:53:43,692 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 1008 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:43,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1151 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:53:43,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5739 states. [2024-11-11 22:53:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5739 to 4164. [2024-11-11 22:53:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 3707 states have (on average 1.4440248179120583) internal successors, (5353), 3740 states have internal predecessors, (5353), 292 states have call successors, (292), 139 states have call predecessors, (292), 163 states have return successors, (424), 300 states have call predecessors, (424), 291 states have call successors, (424) [2024-11-11 22:53:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 6069 transitions. [2024-11-11 22:53:43,920 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 6069 transitions. Word has length 101 [2024-11-11 22:53:43,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:43,920 INFO L471 AbstractCegarLoop]: Abstraction has 4164 states and 6069 transitions. [2024-11-11 22:53:43,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 6069 transitions. [2024-11-11 22:53:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:43,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:43,923 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] [2024-11-11 22:53:43,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:53:43,923 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:43,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1932682600, now seen corresponding path program 1 times [2024-11-11 22:53:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:43,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135435882] [2024-11-11 22:53:43,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:43,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:43,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,021 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:53:44,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:44,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135435882] [2024-11-11 22:53:44,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135435882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:44,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:44,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:44,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000618692] [2024-11-11 22:53:44,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:44,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:44,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:44,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:44,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:44,023 INFO L87 Difference]: Start difference. First operand 4164 states and 6069 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:44,875 INFO L93 Difference]: Finished difference Result 8329 states and 12528 transitions. [2024-11-11 22:53:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:53:44,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:44,897 INFO L225 Difference]: With dead ends: 8329 [2024-11-11 22:53:44,898 INFO L226 Difference]: Without dead ends: 5100 [2024-11-11 22:53:44,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:53:44,925 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 714 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:44,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 943 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:53:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2024-11-11 22:53:45,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 4164. [2024-11-11 22:53:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 3707 states have (on average 1.4394388993795522) internal successors, (5336), 3740 states have internal predecessors, (5336), 292 states have call successors, (292), 139 states have call predecessors, (292), 163 states have return successors, (424), 300 states have call predecessors, (424), 291 states have call successors, (424) [2024-11-11 22:53:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 6052 transitions. [2024-11-11 22:53:45,201 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 6052 transitions. Word has length 101 [2024-11-11 22:53:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:45,201 INFO L471 AbstractCegarLoop]: Abstraction has 4164 states and 6052 transitions. [2024-11-11 22:53:45,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 6052 transitions. [2024-11-11 22:53:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:45,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:45,205 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] [2024-11-11 22:53:45,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:53:45,205 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:45,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:45,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1523251034, now seen corresponding path program 1 times [2024-11-11 22:53:45,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:45,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978035343] [2024-11-11 22:53:45,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:45,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:45,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:45,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:45,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:45,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:45,330 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:53:45,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:45,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978035343] [2024-11-11 22:53:45,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978035343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:45,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:45,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:45,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480265564] [2024-11-11 22:53:45,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:45,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:45,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:45,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:45,332 INFO L87 Difference]: Start difference. First operand 4164 states and 6052 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:46,064 INFO L93 Difference]: Finished difference Result 8311 states and 12441 transitions. [2024-11-11 22:53:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:53:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:46,084 INFO L225 Difference]: With dead ends: 8311 [2024-11-11 22:53:46,085 INFO L226 Difference]: Without dead ends: 5082 [2024-11-11 22:53:46,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:53:46,091 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 823 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:46,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 780 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:53:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5082 states. [2024-11-11 22:53:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5082 to 4164. [2024-11-11 22:53:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 3707 states have (on average 1.434852980847046) internal successors, (5319), 3740 states have internal predecessors, (5319), 292 states have call successors, (292), 139 states have call predecessors, (292), 163 states have return successors, (424), 300 states have call predecessors, (424), 291 states have call successors, (424) [2024-11-11 22:53:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 6035 transitions. [2024-11-11 22:53:46,334 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 6035 transitions. Word has length 101 [2024-11-11 22:53:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:46,334 INFO L471 AbstractCegarLoop]: Abstraction has 4164 states and 6035 transitions. [2024-11-11 22:53:46,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 6035 transitions. [2024-11-11 22:53:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:46,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:46,338 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] [2024-11-11 22:53:46,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:53:46,339 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:46,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1496185432, now seen corresponding path program 1 times [2024-11-11 22:53:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:46,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349755890] [2024-11-11 22:53:46,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,462 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:53:46,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:46,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349755890] [2024-11-11 22:53:46,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349755890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:46,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:46,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:46,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265631270] [2024-11-11 22:53:46,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:46,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:46,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:46,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:46,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:46,468 INFO L87 Difference]: Start difference. First operand 4164 states and 6035 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:48,145 INFO L93 Difference]: Finished difference Result 12722 states and 19036 transitions. [2024-11-11 22:53:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:53:48,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:48,179 INFO L225 Difference]: With dead ends: 12722 [2024-11-11 22:53:48,180 INFO L226 Difference]: Without dead ends: 9493 [2024-11-11 22:53:48,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:53:48,189 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 994 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:48,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 1603 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:53:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9493 states. [2024-11-11 22:53:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9493 to 7199. [2024-11-11 22:53:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7199 states, 6430 states have (on average 1.4552099533437013) internal successors, (9357), 6479 states have internal predecessors, (9357), 492 states have call successors, (492), 235 states have call predecessors, (492), 275 states have return successors, (802), 516 states have call predecessors, (802), 491 states have call successors, (802) [2024-11-11 22:53:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7199 states to 7199 states and 10651 transitions. [2024-11-11 22:53:48,639 INFO L78 Accepts]: Start accepts. Automaton has 7199 states and 10651 transitions. Word has length 101 [2024-11-11 22:53:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:48,640 INFO L471 AbstractCegarLoop]: Abstraction has 7199 states and 10651 transitions. [2024-11-11 22:53:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 7199 states and 10651 transitions. [2024-11-11 22:53:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:48,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:48,647 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] [2024-11-11 22:53:48,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:53:48,648 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:48,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash 721444966, now seen corresponding path program 1 times [2024-11-11 22:53:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:48,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095461690] [2024-11-11 22:53:48,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,796 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:53:48,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:48,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095461690] [2024-11-11 22:53:48,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095461690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:48,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:48,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342716049] [2024-11-11 22:53:48,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:48,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:48,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:48,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:48,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:48,798 INFO L87 Difference]: Start difference. First operand 7199 states and 10651 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:50,959 INFO L93 Difference]: Finished difference Result 22937 states and 34754 transitions. [2024-11-11 22:53:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:53:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:51,007 INFO L225 Difference]: With dead ends: 22937 [2024-11-11 22:53:51,007 INFO L226 Difference]: Without dead ends: 16673 [2024-11-11 22:53:51,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:53:51,023 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 908 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:51,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 1603 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:53:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16673 states. [2024-11-11 22:53:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16673 to 13281. [2024-11-11 22:53:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13281 states, 11904 states have (on average 1.4705141129032258) internal successors, (17505), 11985 states have internal predecessors, (17505), 876 states have call successors, (876), 427 states have call predecessors, (876), 499 states have return successors, (1704), 932 states have call predecessors, (1704), 875 states have call successors, (1704) [2024-11-11 22:53:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13281 states to 13281 states and 20085 transitions. [2024-11-11 22:53:51,865 INFO L78 Accepts]: Start accepts. Automaton has 13281 states and 20085 transitions. Word has length 101 [2024-11-11 22:53:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:51,865 INFO L471 AbstractCegarLoop]: Abstraction has 13281 states and 20085 transitions. [2024-11-11 22:53:51,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 13281 states and 20085 transitions. [2024-11-11 22:53:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:51,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:51,874 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] [2024-11-11 22:53:51,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:53:51,874 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:51,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:51,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1608667812, now seen corresponding path program 1 times [2024-11-11 22:53:51,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:51,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536868219] [2024-11-11 22:53:51,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:51,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,970 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:53:51,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:51,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536868219] [2024-11-11 22:53:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536868219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:51,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225834773] [2024-11-11 22:53:51,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:51,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:51,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:51,973 INFO L87 Difference]: Start difference. First operand 13281 states and 20085 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:53,887 INFO L93 Difference]: Finished difference Result 28649 states and 43882 transitions. [2024-11-11 22:53:53,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 22:53:53,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:53,931 INFO L225 Difference]: With dead ends: 28649 [2024-11-11 22:53:53,931 INFO L226 Difference]: Without dead ends: 16304 [2024-11-11 22:53:53,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:53:53,962 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 314 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:53,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1256 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:53:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2024-11-11 22:53:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 13476. [2024-11-11 22:53:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13476 states, 12099 states have (on average 1.462930820728986) internal successors, (17700), 12180 states have internal predecessors, (17700), 876 states have call successors, (876), 427 states have call predecessors, (876), 499 states have return successors, (1704), 932 states have call predecessors, (1704), 875 states have call successors, (1704) [2024-11-11 22:53:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13476 states to 13476 states and 20280 transitions. [2024-11-11 22:53:54,766 INFO L78 Accepts]: Start accepts. Automaton has 13476 states and 20280 transitions. Word has length 101 [2024-11-11 22:53:54,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:54,766 INFO L471 AbstractCegarLoop]: Abstraction has 13476 states and 20280 transitions. [2024-11-11 22:53:54,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 13476 states and 20280 transitions. [2024-11-11 22:53:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:54,776 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:54,776 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] [2024-11-11 22:53:54,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:53:54,776 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:54,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:54,777 INFO L85 PathProgramCache]: Analyzing trace with hash -77512026, now seen corresponding path program 1 times [2024-11-11 22:53:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:54,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802568554] [2024-11-11 22:53:54,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:54,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,870 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:53:54,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:54,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802568554] [2024-11-11 22:53:54,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802568554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:54,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:54,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:53:54,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105624483] [2024-11-11 22:53:54,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:54,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:53:54,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:54,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:53:54,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:53:54,872 INFO L87 Difference]: Start difference. First operand 13476 states and 20280 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:57,503 INFO L93 Difference]: Finished difference Result 43821 states and 66535 transitions. [2024-11-11 22:53:57,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:53:57,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:53:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:57,605 INFO L225 Difference]: With dead ends: 43821 [2024-11-11 22:53:57,606 INFO L226 Difference]: Without dead ends: 31281 [2024-11-11 22:53:57,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:53:57,637 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 1164 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:57,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 1238 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:53:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31281 states. [2024-11-11 22:53:59,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31281 to 25558. [2024-11-11 22:53:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25558 states, 22977 states have (on average 1.4669887278582932) internal successors, (33707), 23122 states have internal predecessors, (33707), 1626 states have call successors, (1626), 817 states have call predecessors, (1626), 953 states have return successors, (3184), 1682 states have call predecessors, (3184), 1625 states have call successors, (3184) [2024-11-11 22:53:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25558 states to 25558 states and 38517 transitions. [2024-11-11 22:53:59,614 INFO L78 Accepts]: Start accepts. Automaton has 25558 states and 38517 transitions. Word has length 101 [2024-11-11 22:53:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:59,615 INFO L471 AbstractCegarLoop]: Abstraction has 25558 states and 38517 transitions. [2024-11-11 22:53:59,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 25558 states and 38517 transitions. [2024-11-11 22:53:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:53:59,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:59,624 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] [2024-11-11 22:53:59,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:53:59,624 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:59,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:59,624 INFO L85 PathProgramCache]: Analyzing trace with hash 499416615, now seen corresponding path program 1 times [2024-11-11 22:53:59,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:59,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078590411] [2024-11-11 22:53:59,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:59,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:59,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:59,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:53:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:59,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:53:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:59,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:53:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:59,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:53:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:59,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:59,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078590411] [2024-11-11 22:53:59,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078590411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:59,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:59,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:59,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543539884] [2024-11-11 22:53:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:59,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:59,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:59,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:59,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:59,715 INFO L87 Difference]: Start difference. First operand 25558 states and 38517 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:02,276 INFO L93 Difference]: Finished difference Result 56161 states and 85326 transitions. [2024-11-11 22:54:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:54:02,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:54:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:02,375 INFO L225 Difference]: With dead ends: 56161 [2024-11-11 22:54:02,375 INFO L226 Difference]: Without dead ends: 31539 [2024-11-11 22:54:02,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:54:02,421 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 327 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:02,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1256 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:54:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31539 states. [2024-11-11 22:54:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31539 to 25753. [2024-11-11 22:54:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25753 states, 23172 states have (on average 1.460253754531331) internal successors, (33837), 23317 states have internal predecessors, (33837), 1626 states have call successors, (1626), 817 states have call predecessors, (1626), 953 states have return successors, (3184), 1682 states have call predecessors, (3184), 1625 states have call successors, (3184) [2024-11-11 22:54:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25753 states to 25753 states and 38647 transitions. [2024-11-11 22:54:04,474 INFO L78 Accepts]: Start accepts. Automaton has 25753 states and 38647 transitions. Word has length 101 [2024-11-11 22:54:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:04,474 INFO L471 AbstractCegarLoop]: Abstraction has 25753 states and 38647 transitions. [2024-11-11 22:54:04,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 25753 states and 38647 transitions. [2024-11-11 22:54:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:54:04,485 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:04,485 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] [2024-11-11 22:54:04,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:54:04,486 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:04,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1060116393, now seen corresponding path program 1 times [2024-11-11 22:54:04,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:04,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178387700] [2024-11-11 22:54:04,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:04,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:04,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:54:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:04,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:54:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:04,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:54:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:04,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:54:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:04,597 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:54:04,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:04,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178387700] [2024-11-11 22:54:04,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178387700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:04,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:04,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:04,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671356428] [2024-11-11 22:54:04,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:04,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:04,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:04,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:04,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:04,599 INFO L87 Difference]: Start difference. First operand 25753 states and 38647 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:07,490 INFO L93 Difference]: Finished difference Result 57136 states and 86236 transitions. [2024-11-11 22:54:07,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:54:07,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:54:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:07,583 INFO L225 Difference]: With dead ends: 57136 [2024-11-11 22:54:07,583 INFO L226 Difference]: Without dead ends: 32319 [2024-11-11 22:54:07,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:54:07,639 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 337 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:07,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1256 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:54:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32319 states. [2024-11-11 22:54:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32319 to 26143. [2024-11-11 22:54:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26143 states, 23562 states have (on average 1.4526355996944231) internal successors, (34227), 23707 states have internal predecessors, (34227), 1626 states have call successors, (1626), 817 states have call predecessors, (1626), 953 states have return successors, (3184), 1682 states have call predecessors, (3184), 1625 states have call successors, (3184) [2024-11-11 22:54:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26143 states to 26143 states and 39037 transitions. [2024-11-11 22:54:09,424 INFO L78 Accepts]: Start accepts. Automaton has 26143 states and 39037 transitions. Word has length 101 [2024-11-11 22:54:09,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:09,424 INFO L471 AbstractCegarLoop]: Abstraction has 26143 states and 39037 transitions. [2024-11-11 22:54:09,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 26143 states and 39037 transitions. [2024-11-11 22:54:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:54:09,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:09,433 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] [2024-11-11 22:54:09,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 22:54:09,433 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1504017067, now seen corresponding path program 1 times [2024-11-11 22:54:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:09,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557453373] [2024-11-11 22:54:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:09,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:09,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:54:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:09,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:54:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:09,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:54:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:09,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:54:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:09,514 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:54:09,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:09,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557453373] [2024-11-11 22:54:09,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557453373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:09,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:09,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:54:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971771190] [2024-11-11 22:54:09,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:09,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:54:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:54:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:54:09,516 INFO L87 Difference]: Start difference. First operand 26143 states and 39037 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:13,680 INFO L93 Difference]: Finished difference Result 88128 states and 131411 transitions. [2024-11-11 22:54:13,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:54:13,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:54:13,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:13,855 INFO L225 Difference]: With dead ends: 88128 [2024-11-11 22:54:13,855 INFO L226 Difference]: Without dead ends: 62921 [2024-11-11 22:54:13,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:54:13,920 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 1256 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:13,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1238 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:54:13,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62921 states. [2024-11-11 22:54:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62921 to 50437. [2024-11-11 22:54:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50437 states, 45513 states have (on average 1.4525739898490542) internal successors, (66111), 45786 states have internal predecessors, (66111), 3061 states have call successors, (3061), 1597 states have call predecessors, (3061), 1861 states have return successors, (6079), 3117 states have call predecessors, (6079), 3060 states have call successors, (6079) [2024-11-11 22:54:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50437 states to 50437 states and 75251 transitions. [2024-11-11 22:54:17,486 INFO L78 Accepts]: Start accepts. Automaton has 50437 states and 75251 transitions. Word has length 101 [2024-11-11 22:54:17,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:17,487 INFO L471 AbstractCegarLoop]: Abstraction has 50437 states and 75251 transitions. [2024-11-11 22:54:17,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 50437 states and 75251 transitions. [2024-11-11 22:54:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:54:17,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:17,496 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] [2024-11-11 22:54:17,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 22:54:17,497 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:17,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:17,497 INFO L85 PathProgramCache]: Analyzing trace with hash -596824148, now seen corresponding path program 1 times [2024-11-11 22:54:17,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:17,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456523446] [2024-11-11 22:54:17,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:17,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:54:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:54:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:54:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:54:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,592 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:54:17,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:17,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456523446] [2024-11-11 22:54:17,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456523446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:17,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:17,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:17,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133315300] [2024-11-11 22:54:17,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:17,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:17,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:17,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:17,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:17,594 INFO L87 Difference]: Start difference. First operand 50437 states and 75251 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:21,877 INFO L93 Difference]: Finished difference Result 112940 states and 168669 transitions. [2024-11-11 22:54:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:54:21,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:54:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:22,093 INFO L225 Difference]: With dead ends: 112940 [2024-11-11 22:54:22,093 INFO L226 Difference]: Without dead ends: 63439 [2024-11-11 22:54:22,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:54:22,193 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 347 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:22,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1256 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:54:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63439 states. [2024-11-11 22:54:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63439 to 50827. [2024-11-11 22:54:25,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50827 states, 45903 states have (on average 1.4458967823453805) internal successors, (66371), 46176 states have internal predecessors, (66371), 3061 states have call successors, (3061), 1597 states have call predecessors, (3061), 1861 states have return successors, (6079), 3117 states have call predecessors, (6079), 3060 states have call successors, (6079) [2024-11-11 22:54:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50827 states to 50827 states and 75511 transitions. [2024-11-11 22:54:25,508 INFO L78 Accepts]: Start accepts. Automaton has 50827 states and 75511 transitions. Word has length 101 [2024-11-11 22:54:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:25,509 INFO L471 AbstractCegarLoop]: Abstraction has 50827 states and 75511 transitions. [2024-11-11 22:54:25,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 50827 states and 75511 transitions. [2024-11-11 22:54:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:54:25,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:25,516 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] [2024-11-11 22:54:25,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 22:54:25,516 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:25,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash -949912530, now seen corresponding path program 1 times [2024-11-11 22:54:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:25,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203109833] [2024-11-11 22:54:25,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:25,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:25,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:54:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:25,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:54:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:25,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:54:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:25,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:54:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:25,603 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:54:25,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:25,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203109833] [2024-11-11 22:54:25,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203109833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:25,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:25,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:25,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524114055] [2024-11-11 22:54:25,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:25,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:25,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:25,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:25,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:25,606 INFO L87 Difference]: Start difference. First operand 50827 states and 75511 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:30,080 INFO L93 Difference]: Finished difference Result 114890 states and 170489 transitions. [2024-11-11 22:54:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:54:30,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:54:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:30,254 INFO L225 Difference]: With dead ends: 114890 [2024-11-11 22:54:30,254 INFO L226 Difference]: Without dead ends: 64999 [2024-11-11 22:54:30,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:54:30,335 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 357 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:30,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1256 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:54:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64999 states. [2024-11-11 22:54:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64999 to 51607. [2024-11-11 22:54:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51607 states, 46683 states have (on average 1.4384465437097016) internal successors, (67151), 46956 states have internal predecessors, (67151), 3061 states have call successors, (3061), 1597 states have call predecessors, (3061), 1861 states have return successors, (6079), 3117 states have call predecessors, (6079), 3060 states have call successors, (6079) [2024-11-11 22:54:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51607 states to 51607 states and 76291 transitions. [2024-11-11 22:54:33,722 INFO L78 Accepts]: Start accepts. Automaton has 51607 states and 76291 transitions. Word has length 101 [2024-11-11 22:54:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:33,722 INFO L471 AbstractCegarLoop]: Abstraction has 51607 states and 76291 transitions. [2024-11-11 22:54:33,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 51607 states and 76291 transitions. [2024-11-11 22:54:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:54:33,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:33,734 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] [2024-11-11 22:54:33,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 22:54:33,734 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:33,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -526265808, now seen corresponding path program 1 times [2024-11-11 22:54:33,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:33,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939289820] [2024-11-11 22:54:33,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:33,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:54:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:54:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:54:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:54:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,906 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:54:33,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:33,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939289820] [2024-11-11 22:54:33,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939289820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:33,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:33,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:33,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796581263] [2024-11-11 22:54:33,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:33,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:33,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:33,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:33,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:33,909 INFO L87 Difference]: Start difference. First operand 51607 states and 76291 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)