./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.06.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.06.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9f893ab935631e26843412fbbbf983c2aeac51b5ea91d56e5f6804258a66568 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:19:51,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:19:52,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:19:52,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:19:52,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:19:52,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:19:52,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:19:52,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:19:52,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:19:52,090 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:19:52,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:19:52,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:19:52,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:19:52,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:19:52,094 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:19:52,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:19:52,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:19:52,095 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:19:52,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:19:52,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:19:52,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:19:52,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:19:52,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:19:52,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:19:52,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:19:52,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:19:52,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:19:52,101 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:19:52,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:19:52,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:19:52,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:19:52,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:19:52,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:19:52,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:19:52,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:19:52,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:19:52,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:19:52,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:19:52,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:19:52,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:19:52,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:19:52,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:19:52,106 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9f893ab935631e26843412fbbbf983c2aeac51b5ea91d56e5f6804258a66568 [2024-10-11 04:19:52,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:19:52,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:19:52,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:19:52,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:19:52,398 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:19:52,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.06.cil-1.c [2024-10-11 04:19:53,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:19:54,543 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:19:54,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.06.cil-1.c [2024-10-11 04:19:54,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b3bc5149/0bdc597dfbe449aab78e62d4c52e1853/FLAG709c33667 [2024-10-11 04:19:55,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b3bc5149/0bdc597dfbe449aab78e62d4c52e1853 [2024-10-11 04:19:55,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:19:55,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:19:55,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:19:55,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:19:55,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:19:55,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:19:55" (1/1) ... [2024-10-11 04:19:55,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c614fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:55, skipping insertion in model container [2024-10-11 04:19:55,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:19:55" (1/1) ... [2024-10-11 04:19:55,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:19:56,815 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.06.cil-1.c[380323,380336] [2024-10-11 04:19:56,845 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.06.cil-1.c[383339,383352] [2024-10-11 04:19:57,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:19:57,078 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:19:57,849 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.06.cil-1.c[380323,380336] [2024-10-11 04:19:57,857 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.06.cil-1.c[383339,383352] [2024-10-11 04:19:57,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:19:57,949 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:19:57,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57 WrapperNode [2024-10-11 04:19:57,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:19:57,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:19:57,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:19:57,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:19:57,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:58,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:58,527 INFO L138 Inliner]: procedures = 56, calls = 60, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 12879 [2024-10-11 04:19:58,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:19:58,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:19:58,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:19:58,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:19:58,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:58,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:58,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:58,801 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:19:58,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:58,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:58,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:59,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:59,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:59,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:59,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:19:59,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:19:59,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:19:59,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:19:59,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (1/1) ... [2024-10-11 04:19:59,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:19:59,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:19:59,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:19:59,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:19:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:19:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:19:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:19:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:19:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:19:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:19:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:19:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:19:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:19:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:19:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:19:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:19:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:19:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:19:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:19:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:19:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:19:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:19:59,359 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:19:59,360 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:20:07,245 INFO L? ?]: Removed 1723 outVars from TransFormulas that were not future-live. [2024-10-11 04:20:07,246 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:20:07,373 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:20:07,374 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 04:20:07,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:20:07 BoogieIcfgContainer [2024-10-11 04:20:07,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:20:07,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:20:07,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:20:07,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:20:07,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:19:55" (1/3) ... [2024-10-11 04:20:07,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106b1c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:20:07, skipping insertion in model container [2024-10-11 04:20:07,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:57" (2/3) ... [2024-10-11 04:20:07,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106b1c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:20:07, skipping insertion in model container [2024-10-11 04:20:07,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:20:07" (3/3) ... [2024-10-11 04:20:07,384 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.06.cil-1.c [2024-10-11 04:20:07,404 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:20:07,404 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:20:07,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:20:07,531 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;@31b5aa35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:20:07,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:20:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 2341 states, 2309 states have (on average 1.8817669987007362) internal successors, (4345), 2314 states have internal predecessors, (4345), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 04:20:07,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:07,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:07,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:07,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:07,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash 633022234, now seen corresponding path program 1 times [2024-10-11 04:20:07,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:07,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4451541] [2024-10-11 04:20:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:07,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:08,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:08,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:08,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:08,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4451541] [2024-10-11 04:20:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4451541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:08,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:08,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:20:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891238739] [2024-10-11 04:20:08,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:08,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:20:08,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:20:08,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:20:08,135 INFO L87 Difference]: Start difference. First operand has 2341 states, 2309 states have (on average 1.8817669987007362) internal successors, (4345), 2314 states have internal predecessors, (4345), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:09,316 INFO L93 Difference]: Finished difference Result 4743 states and 8886 transitions. [2024-10-11 04:20:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:20:09,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:09,354 INFO L225 Difference]: With dead ends: 4743 [2024-10-11 04:20:09,354 INFO L226 Difference]: Without dead ends: 2406 [2024-10-11 04:20:09,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:20:09,372 INFO L432 NwaCegarLoop]: 4154 mSDtfsCounter, 567 mSDsluCounter, 12090 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 16244 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:09,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 16244 Invalid, 648 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:20:09,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2024-10-11 04:20:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2336. [2024-10-11 04:20:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2306 states have (on average 1.8460537727666955) internal successors, (4257), 2309 states have internal predecessors, (4257), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 04:20:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 4299 transitions. [2024-10-11 04:20:09,540 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 4299 transitions. Word has length 102 [2024-10-11 04:20:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:09,541 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 4299 transitions. [2024-10-11 04:20:09,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 4299 transitions. [2024-10-11 04:20:09,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:09,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:09,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:09,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:20:09,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:09,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1721363048, now seen corresponding path program 1 times [2024-10-11 04:20:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459070582] [2024-10-11 04:20:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:09,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:09,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459070582] [2024-10-11 04:20:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459070582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:09,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:09,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:09,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636212807] [2024-10-11 04:20:09,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:09,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:09,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:09,879 INFO L87 Difference]: Start difference. First operand 2336 states and 4299 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:12,306 INFO L93 Difference]: Finished difference Result 2902 states and 5234 transitions. [2024-10-11 04:20:12,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:20:12,307 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:12,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:12,322 INFO L225 Difference]: With dead ends: 2902 [2024-10-11 04:20:12,322 INFO L226 Difference]: Without dead ends: 2699 [2024-10-11 04:20:12,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:20:12,326 INFO L432 NwaCegarLoop]: 4263 mSDtfsCounter, 4757 mSDsluCounter, 16816 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4770 SdHoareTripleChecker+Valid, 21079 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:12,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4770 Valid, 21079 Invalid, 2245 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:20:12,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2024-10-11 04:20:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2548. [2024-10-11 04:20:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2493 states have (on average 1.829923786602487) internal successors, (4562), 2498 states have internal predecessors, (4562), 39 states have call successors, (39), 13 states have call predecessors, (39), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2024-10-11 04:20:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 4645 transitions. [2024-10-11 04:20:12,421 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 4645 transitions. Word has length 102 [2024-10-11 04:20:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:12,422 INFO L471 AbstractCegarLoop]: Abstraction has 2548 states and 4645 transitions. [2024-10-11 04:20:12,422 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 4645 transitions. [2024-10-11 04:20:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:12,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:12,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:12,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:20:12,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:12,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash 615029462, now seen corresponding path program 1 times [2024-10-11 04:20:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:12,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013869000] [2024-10-11 04:20:12,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:12,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:12,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:12,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:12,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:12,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:12,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:12,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013869000] [2024-10-11 04:20:12,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013869000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:12,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:12,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:12,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965635941] [2024-10-11 04:20:12,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:12,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:12,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:12,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:12,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:12,699 INFO L87 Difference]: Start difference. First operand 2548 states and 4645 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:14,783 INFO L93 Difference]: Finished difference Result 3616 states and 6396 transitions. [2024-10-11 04:20:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:20:14,784 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:14,801 INFO L225 Difference]: With dead ends: 3616 [2024-10-11 04:20:14,801 INFO L226 Difference]: Without dead ends: 3203 [2024-10-11 04:20:14,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:20:14,806 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 4782 mSDsluCounter, 16764 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4795 SdHoareTripleChecker+Valid, 20989 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:14,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4795 Valid, 20989 Invalid, 2050 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:20:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2024-10-11 04:20:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 2936. [2024-10-11 04:20:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2837 states have (on average 1.8022559041240747) internal successors, (5113), 2844 states have internal predecessors, (5113), 69 states have call successors, (69), 25 states have call predecessors, (69), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:20:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 5266 transitions. [2024-10-11 04:20:14,952 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 5266 transitions. Word has length 102 [2024-10-11 04:20:14,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:14,953 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 5266 transitions. [2024-10-11 04:20:14,953 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 5266 transitions. [2024-10-11 04:20:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:14,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:14,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:14,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:20:14,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:14,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:14,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1803455016, now seen corresponding path program 1 times [2024-10-11 04:20:14,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:14,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606146163] [2024-10-11 04:20:14,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:14,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:15,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:15,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:15,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:15,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:15,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:15,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606146163] [2024-10-11 04:20:15,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606146163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:15,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:15,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:15,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389493368] [2024-10-11 04:20:15,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:15,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:15,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:15,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:15,218 INFO L87 Difference]: Start difference. First operand 2936 states and 5266 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:16,260 INFO L93 Difference]: Finished difference Result 4009 states and 7040 transitions. [2024-10-11 04:20:16,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:20:16,260 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:16,278 INFO L225 Difference]: With dead ends: 4009 [2024-10-11 04:20:16,279 INFO L226 Difference]: Without dead ends: 3206 [2024-10-11 04:20:16,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:20:16,285 INFO L432 NwaCegarLoop]: 4118 mSDtfsCounter, 4659 mSDsluCounter, 12253 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 16371 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:16,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 16371 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:20:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2024-10-11 04:20:16,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2936. [2024-10-11 04:20:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2837 states have (on average 1.8004934790271414) internal successors, (5108), 2844 states have internal predecessors, (5108), 69 states have call successors, (69), 25 states have call predecessors, (69), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:20:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 5261 transitions. [2024-10-11 04:20:16,441 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 5261 transitions. Word has length 102 [2024-10-11 04:20:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:16,441 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 5261 transitions. [2024-10-11 04:20:16,442 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 5261 transitions. [2024-10-11 04:20:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:16,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:16,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:16,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:20:16,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:16,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash 612381334, now seen corresponding path program 1 times [2024-10-11 04:20:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:16,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796825635] [2024-10-11 04:20:16,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:16,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:16,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:16,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:16,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:16,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:16,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:16,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796825635] [2024-10-11 04:20:16,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796825635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:16,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:16,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:16,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173923797] [2024-10-11 04:20:16,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:16,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:16,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:16,669 INFO L87 Difference]: Start difference. First operand 2936 states and 5261 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:17,960 INFO L93 Difference]: Finished difference Result 4005 states and 7019 transitions. [2024-10-11 04:20:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:20:17,961 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:17,975 INFO L225 Difference]: With dead ends: 4005 [2024-10-11 04:20:17,976 INFO L226 Difference]: Without dead ends: 3202 [2024-10-11 04:20:17,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:20:17,980 INFO L432 NwaCegarLoop]: 4118 mSDtfsCounter, 4571 mSDsluCounter, 16316 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4585 SdHoareTripleChecker+Valid, 20434 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:17,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4585 Valid, 20434 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:20:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2024-10-11 04:20:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 2936. [2024-10-11 04:20:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2837 states have (on average 1.798731053930208) internal successors, (5103), 2844 states have internal predecessors, (5103), 69 states have call successors, (69), 25 states have call predecessors, (69), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:20:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 5256 transitions. [2024-10-11 04:20:18,083 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 5256 transitions. Word has length 102 [2024-10-11 04:20:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:18,084 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 5256 transitions. [2024-10-11 04:20:18,084 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 5256 transitions. [2024-10-11 04:20:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:18,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:18,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:18,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:20:18,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:18,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:18,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1937237528, now seen corresponding path program 1 times [2024-10-11 04:20:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:18,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790286167] [2024-10-11 04:20:18,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:18,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:18,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:18,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:18,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:18,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790286167] [2024-10-11 04:20:18,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790286167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:18,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592763615] [2024-10-11 04:20:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:18,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:18,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:18,279 INFO L87 Difference]: Start difference. First operand 2936 states and 5256 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:19,144 INFO L93 Difference]: Finished difference Result 4000 states and 6996 transitions. [2024-10-11 04:20:19,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:20:19,145 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:19,159 INFO L225 Difference]: With dead ends: 4000 [2024-10-11 04:20:19,160 INFO L226 Difference]: Without dead ends: 3197 [2024-10-11 04:20:19,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:20:19,164 INFO L432 NwaCegarLoop]: 4118 mSDtfsCounter, 4569 mSDsluCounter, 16316 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4583 SdHoareTripleChecker+Valid, 20434 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:19,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4583 Valid, 20434 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:20:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2024-10-11 04:20:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2936. [2024-10-11 04:20:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2837 states have (on average 1.7969686288332747) internal successors, (5098), 2844 states have internal predecessors, (5098), 69 states have call successors, (69), 25 states have call predecessors, (69), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:20:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 5251 transitions. [2024-10-11 04:20:19,267 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 5251 transitions. Word has length 102 [2024-10-11 04:20:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:19,267 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 5251 transitions. [2024-10-11 04:20:19,268 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 5251 transitions. [2024-10-11 04:20:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:19,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:19,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:19,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:20:19,270 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:19,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash -790971818, now seen corresponding path program 1 times [2024-10-11 04:20:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846072856] [2024-10-11 04:20:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:19,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:19,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:19,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:19,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:19,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846072856] [2024-10-11 04:20:19,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846072856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:19,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:19,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497315360] [2024-10-11 04:20:19,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:19,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:19,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:19,452 INFO L87 Difference]: Start difference. First operand 2936 states and 5251 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:21,259 INFO L93 Difference]: Finished difference Result 4993 states and 8567 transitions. [2024-10-11 04:20:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:20:21,259 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:21,278 INFO L225 Difference]: With dead ends: 4993 [2024-10-11 04:20:21,278 INFO L226 Difference]: Without dead ends: 4192 [2024-10-11 04:20:21,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:20:21,284 INFO L432 NwaCegarLoop]: 4259 mSDtfsCounter, 4748 mSDsluCounter, 16816 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4761 SdHoareTripleChecker+Valid, 21075 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:21,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4761 Valid, 21075 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:20:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2024-10-11 04:20:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 3723. [2024-10-11 04:20:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3723 states, 3536 states have (on average 1.7531108597285068) internal successors, (6199), 3547 states have internal predecessors, (6199), 129 states have call successors, (129), 49 states have call predecessors, (129), 56 states have return successors, (170), 134 states have call predecessors, (170), 127 states have call successors, (170) [2024-10-11 04:20:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 6498 transitions. [2024-10-11 04:20:21,514 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 6498 transitions. Word has length 102 [2024-10-11 04:20:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:21,515 INFO L471 AbstractCegarLoop]: Abstraction has 3723 states and 6498 transitions. [2024-10-11 04:20:21,515 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 6498 transitions. [2024-10-11 04:20:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:21,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:21,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:21,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:20:21,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:21,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1848809896, now seen corresponding path program 1 times [2024-10-11 04:20:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:21,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081159337] [2024-10-11 04:20:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:21,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:21,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:21,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:21,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:21,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:21,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081159337] [2024-10-11 04:20:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081159337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:21,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:21,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017480106] [2024-10-11 04:20:21,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:21,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:21,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:21,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:21,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:21,705 INFO L87 Difference]: Start difference. First operand 3723 states and 6498 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:23,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:23,563 INFO L93 Difference]: Finished difference Result 8412 states and 14052 transitions. [2024-10-11 04:20:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:20:23,564 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:23,610 INFO L225 Difference]: With dead ends: 8412 [2024-10-11 04:20:23,610 INFO L226 Difference]: Without dead ends: 6824 [2024-10-11 04:20:23,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:20:23,622 INFO L432 NwaCegarLoop]: 4257 mSDtfsCounter, 4978 mSDsluCounter, 16811 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4998 SdHoareTripleChecker+Valid, 21068 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:23,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4998 Valid, 21068 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:20:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6824 states. [2024-10-11 04:20:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6824 to 5288. [2024-10-11 04:20:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5288 states, 4933 states have (on average 1.7034259071558888) internal successors, (8403), 4952 states have internal predecessors, (8403), 241 states have call successors, (241), 97 states have call predecessors, (241), 112 states have return successors, (352), 254 states have call predecessors, (352), 239 states have call successors, (352) [2024-10-11 04:20:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5288 states to 5288 states and 8996 transitions. [2024-10-11 04:20:23,891 INFO L78 Accepts]: Start accepts. Automaton has 5288 states and 8996 transitions. Word has length 102 [2024-10-11 04:20:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:23,891 INFO L471 AbstractCegarLoop]: Abstraction has 5288 states and 8996 transitions. [2024-10-11 04:20:23,892 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 8996 transitions. [2024-10-11 04:20:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:23,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:23,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:23,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:20:23,897 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:23,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1303654934, now seen corresponding path program 1 times [2024-10-11 04:20:23,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:23,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569190879] [2024-10-11 04:20:23,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:23,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:23,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:24,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:24,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:24,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:24,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569190879] [2024-10-11 04:20:24,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569190879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:24,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:24,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398410435] [2024-10-11 04:20:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:24,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:24,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:24,099 INFO L87 Difference]: Start difference. First operand 5288 states and 8996 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:26,159 INFO L93 Difference]: Finished difference Result 14195 states and 23402 transitions. [2024-10-11 04:20:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:20:26,159 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:26,193 INFO L225 Difference]: With dead ends: 14195 [2024-10-11 04:20:26,193 INFO L226 Difference]: Without dead ends: 11042 [2024-10-11 04:20:26,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:20:26,211 INFO L432 NwaCegarLoop]: 4257 mSDtfsCounter, 4921 mSDsluCounter, 16811 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4941 SdHoareTripleChecker+Valid, 21068 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:26,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4941 Valid, 21068 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:20:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11042 states. [2024-10-11 04:20:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11042 to 8433. [2024-10-11 04:20:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8433 states, 7750 states have (on average 1.6589677419354838) internal successors, (12857), 7785 states have internal predecessors, (12857), 457 states have call successors, (457), 193 states have call predecessors, (457), 224 states have return successors, (762), 486 states have call predecessors, (762), 455 states have call successors, (762) [2024-10-11 04:20:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8433 states to 8433 states and 14076 transitions. [2024-10-11 04:20:26,792 INFO L78 Accepts]: Start accepts. Automaton has 8433 states and 14076 transitions. Word has length 102 [2024-10-11 04:20:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:26,792 INFO L471 AbstractCegarLoop]: Abstraction has 8433 states and 14076 transitions. [2024-10-11 04:20:26,793 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 8433 states and 14076 transitions. [2024-10-11 04:20:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:26,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:26,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:26,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:20:26,801 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:26,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2142688596, now seen corresponding path program 1 times [2024-10-11 04:20:26,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:26,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519474285] [2024-10-11 04:20:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:26,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:26,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:26,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:26,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:26,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:26,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:27,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:27,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519474285] [2024-10-11 04:20:27,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519474285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:27,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:27,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:27,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603620326] [2024-10-11 04:20:27,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:27,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:27,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:27,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:27,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:27,002 INFO L87 Difference]: Start difference. First operand 8433 states and 14076 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:29,700 INFO L93 Difference]: Finished difference Result 25710 states and 42196 transitions. [2024-10-11 04:20:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:20:29,701 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:29,772 INFO L225 Difference]: With dead ends: 25710 [2024-10-11 04:20:29,772 INFO L226 Difference]: Without dead ends: 19412 [2024-10-11 04:20:29,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:20:29,798 INFO L432 NwaCegarLoop]: 4226 mSDtfsCounter, 4898 mSDsluCounter, 16762 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4918 SdHoareTripleChecker+Valid, 20988 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:29,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4918 Valid, 20988 Invalid, 1943 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:20:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19412 states. [2024-10-11 04:20:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19412 to 14723. [2024-10-11 04:20:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14723 states, 13400 states have (on average 1.6266417910447761) internal successors, (21797), 13467 states have internal predecessors, (21797), 873 states have call successors, (873), 385 states have call predecessors, (873), 448 states have return successors, (1728), 934 states have call predecessors, (1728), 871 states have call successors, (1728) [2024-10-11 04:20:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14723 states to 14723 states and 24398 transitions. [2024-10-11 04:20:30,696 INFO L78 Accepts]: Start accepts. Automaton has 14723 states and 24398 transitions. Word has length 102 [2024-10-11 04:20:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:30,697 INFO L471 AbstractCegarLoop]: Abstraction has 14723 states and 24398 transitions. [2024-10-11 04:20:30,697 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:30,697 INFO L276 IsEmpty]: Start isEmpty. Operand 14723 states and 24398 transitions. [2024-10-11 04:20:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:30,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:30,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:30,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:20:30,710 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:30,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2125213098, now seen corresponding path program 1 times [2024-10-11 04:20:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:30,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579164603] [2024-10-11 04:20:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:30,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:30,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:30,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:30,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:30,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579164603] [2024-10-11 04:20:30,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579164603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:30,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:30,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:30,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520016304] [2024-10-11 04:20:30,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:30,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:30,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:30,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:30,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:30,876 INFO L87 Difference]: Start difference. First operand 14723 states and 24398 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:34,393 INFO L93 Difference]: Finished difference Result 48260 states and 79600 transitions. [2024-10-11 04:20:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:20:34,394 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:34,522 INFO L225 Difference]: With dead ends: 48260 [2024-10-11 04:20:34,523 INFO L226 Difference]: Without dead ends: 35672 [2024-10-11 04:20:34,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:20:34,575 INFO L432 NwaCegarLoop]: 4258 mSDtfsCounter, 4789 mSDsluCounter, 16811 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4801 SdHoareTripleChecker+Valid, 21069 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:34,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4801 Valid, 21069 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:20:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35672 states. [2024-10-11 04:20:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35672 to 27303. [2024-10-11 04:20:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27303 states, 24732 states have (on average 1.6068655992236778) internal successors, (39741), 24863 states have internal predecessors, (39741), 1673 states have call successors, (1673), 769 states have call predecessors, (1673), 896 states have return successors, (4114), 1798 states have call predecessors, (4114), 1671 states have call successors, (4114) [2024-10-11 04:20:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27303 states to 27303 states and 45528 transitions. [2024-10-11 04:20:36,735 INFO L78 Accepts]: Start accepts. Automaton has 27303 states and 45528 transitions. Word has length 102 [2024-10-11 04:20:36,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:36,736 INFO L471 AbstractCegarLoop]: Abstraction has 27303 states and 45528 transitions. [2024-10-11 04:20:36,736 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 27303 states and 45528 transitions. [2024-10-11 04:20:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:36,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:36,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:36,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:20:36,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:36,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash 92417300, now seen corresponding path program 1 times [2024-10-11 04:20:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:36,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691044107] [2024-10-11 04:20:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:36,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:36,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:36,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:36,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:36,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:36,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691044107] [2024-10-11 04:20:36,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691044107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:36,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:36,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644275386] [2024-10-11 04:20:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:36,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:36,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:36,918 INFO L87 Difference]: Start difference. First operand 27303 states and 45528 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:42,273 INFO L93 Difference]: Finished difference Result 92400 states and 154688 transitions. [2024-10-11 04:20:42,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:20:42,274 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:42,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:42,677 INFO L225 Difference]: With dead ends: 92400 [2024-10-11 04:20:42,677 INFO L226 Difference]: Without dead ends: 67232 [2024-10-11 04:20:42,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:20:42,750 INFO L432 NwaCegarLoop]: 4259 mSDtfsCounter, 4819 mSDsluCounter, 16811 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4839 SdHoareTripleChecker+Valid, 21070 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:42,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4839 Valid, 21070 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1980 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:20:42,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67232 states. [2024-10-11 04:20:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67232 to 52463. [2024-10-11 04:20:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52463 states, 47460 states have (on average 1.596228402865571) internal successors, (75757), 47719 states have internal predecessors, (75757), 3209 states have call successors, (3209), 1537 states have call predecessors, (3209), 1792 states have return successors, (10280), 3462 states have call predecessors, (10280), 3207 states have call successors, (10280) [2024-10-11 04:20:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52463 states to 52463 states and 89246 transitions. [2024-10-11 04:20:46,567 INFO L78 Accepts]: Start accepts. Automaton has 52463 states and 89246 transitions. Word has length 102 [2024-10-11 04:20:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:20:46,568 INFO L471 AbstractCegarLoop]: Abstraction has 52463 states and 89246 transitions. [2024-10-11 04:20:46,568 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 52463 states and 89246 transitions. [2024-10-11 04:20:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:20:46,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:20:46,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:20:46,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:20:46,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:20:46,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:20:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1826521750, now seen corresponding path program 1 times [2024-10-11 04:20:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:20:46,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815420784] [2024-10-11 04:20:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:20:46,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:20:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:46,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:20:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:46,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:20:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:46,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:20:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:46,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:20:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:46,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:20:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:20:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:20:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:20:46,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815420784] [2024-10-11 04:20:46,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815420784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:20:46,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:20:46,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:20:46,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281337321] [2024-10-11 04:20:46,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:20:46,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:20:46,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:20:46,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:20:46,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:20:46,773 INFO L87 Difference]: Start difference. First operand 52463 states and 89246 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:20:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:20:56,138 INFO L93 Difference]: Finished difference Result 178760 states and 307368 transitions. [2024-10-11 04:20:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:20:56,139 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:20:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:20:56,898 INFO L225 Difference]: With dead ends: 178760 [2024-10-11 04:20:56,898 INFO L226 Difference]: Without dead ends: 128432 [2024-10-11 04:20:57,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:20:57,061 INFO L432 NwaCegarLoop]: 4257 mSDtfsCounter, 4770 mSDsluCounter, 16811 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4782 SdHoareTripleChecker+Valid, 21068 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:20:57,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4782 Valid, 21068 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:20:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128432 states.