./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/pc_sfifo_1.cil-2+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0f469ae37a514ddca8d0dce53a0af7478c9ef70fff43265912fb6cefbfb3984 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:09:08,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:09:08,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:09:08,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:09:08,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:09:08,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:09:08,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:09:08,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:09:08,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:09:08,236 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:09:08,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:09:08,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:09:08,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:09:08,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:09:08,238 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:09:08,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:09:08,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:09:08,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:09:08,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:09:08,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:09:08,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:09:08,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:09:08,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:09:08,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:09:08,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:09:08,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:09:08,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:09:08,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:09:08,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:09:08,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:09:08,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:09:08,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:09:08,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:09:08,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:09:08,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:09:08,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:09:08,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:09:08,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:09:08,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:09:08,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:09:08,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:09:08,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:09:08,247 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0f469ae37a514ddca8d0dce53a0af7478c9ef70fff43265912fb6cefbfb3984 [2024-10-14 05:09:08,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:09:08,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:09:08,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:09:08,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:09:08,470 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:09:08,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-2.c [2024-10-14 05:09:09,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:09:10,178 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:09:10,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-2.c [2024-10-14 05:09:10,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4a9d716/cbb7205000f14bac837663153b0aa76c/FLAG52a83451b [2024-10-14 05:09:10,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4a9d716/cbb7205000f14bac837663153b0aa76c [2024-10-14 05:09:10,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:09:10,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:09:10,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:09:10,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:09:10,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:09:10,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:10,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430df476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10, skipping insertion in model container [2024-10-14 05:09:10,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:10,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:09:10,759 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/pc_sfifo_1.cil-2+token_ring.03.cil-2.c[913,926] [2024-10-14 05:09:10,795 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/pc_sfifo_1.cil-2+token_ring.03.cil-2.c[5977,5990] [2024-10-14 05:09:10,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:09:10,838 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:09:10,847 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/pc_sfifo_1.cil-2+token_ring.03.cil-2.c[913,926] [2024-10-14 05:09:10,859 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/pc_sfifo_1.cil-2+token_ring.03.cil-2.c[5977,5990] [2024-10-14 05:09:10,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:09:10,900 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:09:10,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10 WrapperNode [2024-10-14 05:09:10,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:09:10,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:09:10,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:09:10,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:09:10,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:10,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:10,945 INFO L138 Inliner]: procedures = 54, calls = 57, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 543 [2024-10-14 05:09:10,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:09:10,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:09:10,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:09:10,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:09:10,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:10,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:11,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:11,047 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-14 05:09:11,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:11,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:11,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:11,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:11,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:11,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:11,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:09:11,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:09:11,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:09:11,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:09:11,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (1/1) ... [2024-10-14 05:09:11,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:09:11,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:11,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:09:11,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:09:11,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:09:11,138 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:09:11,138 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:09:11,138 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-14 05:09:11,139 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-14 05:09:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:09:11,139 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:09:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:09:11,139 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:09:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:09:11,139 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:09:11,139 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:09:11,139 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:09:11,140 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:09:11,140 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:09:11,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:09:11,140 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:09:11,140 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:09:11,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:09:11,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:09:11,141 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:09:11,141 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:09:11,224 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:09:11,226 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:09:11,634 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-14 05:09:11,634 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:09:11,667 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:09:11,668 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-14 05:09:11,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:09:11 BoogieIcfgContainer [2024-10-14 05:09:11,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:09:11,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:09:11,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:09:11,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:09:11,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:09:10" (1/3) ... [2024-10-14 05:09:11,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fb7892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:09:11, skipping insertion in model container [2024-10-14 05:09:11,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:10" (2/3) ... [2024-10-14 05:09:11,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fb7892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:09:11, skipping insertion in model container [2024-10-14 05:09:11,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:09:11" (3/3) ... [2024-10-14 05:09:11,675 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.03.cil-2.c [2024-10-14 05:09:11,687 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:09:11,688 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:09:11,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:09:11,759 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;@463e5e01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:09:11,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:09:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 169 states have (on average 1.668639053254438) internal successors, (282), 174 states have internal predecessors, (282), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 05:09:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 05:09:11,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:11,770 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] [2024-10-14 05:09:11,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:11,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1406468176, now seen corresponding path program 1 times [2024-10-14 05:09:11,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:11,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413574408] [2024-10-14 05:09:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:11,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,020 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-14 05:09:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413574408] [2024-10-14 05:09:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413574408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:12,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:12,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:12,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518240294] [2024-10-14 05:09:12,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:12,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:12,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:12,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:12,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:12,053 INFO L87 Difference]: Start difference. First operand has 204 states, 169 states have (on average 1.668639053254438) internal successors, (282), 174 states have internal predecessors, (282), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:12,427 INFO L93 Difference]: Finished difference Result 458 states and 738 transitions. [2024-10-14 05:09:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:12,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-14 05:09:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:12,456 INFO L225 Difference]: With dead ends: 458 [2024-10-14 05:09:12,456 INFO L226 Difference]: Without dead ends: 262 [2024-10-14 05:09:12,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:12,470 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 373 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:12,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 400 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 05:09:12,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-14 05:09:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2024-10-14 05:09:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 216 states have (on average 1.5046296296296295) internal successors, (325), 220 states have internal predecessors, (325), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) [2024-10-14 05:09:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2024-10-14 05:09:12,537 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 37 [2024-10-14 05:09:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:12,537 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2024-10-14 05:09:12,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2024-10-14 05:09:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 05:09:12,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:12,540 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] [2024-10-14 05:09:12,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:09:12,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:12,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:12,541 INFO L85 PathProgramCache]: Analyzing trace with hash 554812386, now seen corresponding path program 1 times [2024-10-14 05:09:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:12,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823928117] [2024-10-14 05:09:12,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:12,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:09:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:09:12,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823928117] [2024-10-14 05:09:12,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823928117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:12,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:12,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135893860] [2024-10-14 05:09:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:12,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:12,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:12,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:12,635 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:12,873 INFO L93 Difference]: Finished difference Result 490 states and 727 transitions. [2024-10-14 05:09:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:12,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-14 05:09:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:12,877 INFO L225 Difference]: With dead ends: 490 [2024-10-14 05:09:12,877 INFO L226 Difference]: Without dead ends: 379 [2024-10-14 05:09:12,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:12,883 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 386 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:12,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 391 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-14 05:09:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 356. [2024-10-14 05:09:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 303 states have (on average 1.462046204620462) internal successors, (443), 308 states have internal predecessors, (443), 35 states have call successors, (35), 15 states have call predecessors, (35), 16 states have return successors, (45), 33 states have call predecessors, (45), 33 states have call successors, (45) [2024-10-14 05:09:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 523 transitions. [2024-10-14 05:09:12,934 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 523 transitions. Word has length 38 [2024-10-14 05:09:12,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:12,935 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 523 transitions. [2024-10-14 05:09:12,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:12,939 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 523 transitions. [2024-10-14 05:09:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 05:09:12,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:12,941 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] [2024-10-14 05:09:12,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:09:12,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:12,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1211272443, now seen corresponding path program 1 times [2024-10-14 05:09:12,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:12,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802250856] [2024-10-14 05:09:12,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:12,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,032 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-14 05:09:13,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:13,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802250856] [2024-10-14 05:09:13,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802250856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:13,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:13,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:13,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312528772] [2024-10-14 05:09:13,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:13,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:13,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:13,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:13,038 INFO L87 Difference]: Start difference. First operand 356 states and 523 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:13,367 INFO L93 Difference]: Finished difference Result 776 states and 1104 transitions. [2024-10-14 05:09:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:13,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-14 05:09:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:13,370 INFO L225 Difference]: With dead ends: 776 [2024-10-14 05:09:13,370 INFO L226 Difference]: Without dead ends: 565 [2024-10-14 05:09:13,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:13,372 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 175 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:13,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 528 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 05:09:13,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-14 05:09:13,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 461. [2024-10-14 05:09:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 396 states have (on average 1.4444444444444444) internal successors, (572), 403 states have internal predecessors, (572), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) [2024-10-14 05:09:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 664 transitions. [2024-10-14 05:09:13,394 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 664 transitions. Word has length 39 [2024-10-14 05:09:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:13,394 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 664 transitions. [2024-10-14 05:09:13,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 664 transitions. [2024-10-14 05:09:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 05:09:13,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:13,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:13,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:09:13,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:13,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:13,397 INFO L85 PathProgramCache]: Analyzing trace with hash -627017791, now seen corresponding path program 1 times [2024-10-14 05:09:13,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:13,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845590136] [2024-10-14 05:09:13,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:13,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 05:09:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:09:13,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:13,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845590136] [2024-10-14 05:09:13,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845590136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:13,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:13,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:13,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56473340] [2024-10-14 05:09:13,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:13,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:13,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:13,475 INFO L87 Difference]: Start difference. First operand 461 states and 664 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:09:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:13,745 INFO L93 Difference]: Finished difference Result 977 states and 1381 transitions. [2024-10-14 05:09:13,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:13,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-14 05:09:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:13,749 INFO L225 Difference]: With dead ends: 977 [2024-10-14 05:09:13,749 INFO L226 Difference]: Without dead ends: 661 [2024-10-14 05:09:13,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:13,750 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 160 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:13,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 575 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-14 05:09:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 627. [2024-10-14 05:09:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 538 states have (on average 1.3903345724907064) internal successors, (748), 547 states have internal predecessors, (748), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) [2024-10-14 05:09:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 878 transitions. [2024-10-14 05:09:13,779 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 878 transitions. Word has length 54 [2024-10-14 05:09:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:13,780 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 878 transitions. [2024-10-14 05:09:13,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:09:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 878 transitions. [2024-10-14 05:09:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:09:13,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:13,783 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:13,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:09:13,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:13,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:13,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2134171021, now seen corresponding path program 1 times [2024-10-14 05:09:13,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:13,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726808876] [2024-10-14 05:09:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:13,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:09:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 05:09:13,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:13,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726808876] [2024-10-14 05:09:13,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726808876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:13,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:13,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:13,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613981654] [2024-10-14 05:09:13,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:13,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:13,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:13,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:13,895 INFO L87 Difference]: Start difference. First operand 627 states and 878 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:14,147 INFO L93 Difference]: Finished difference Result 1206 states and 1657 transitions. [2024-10-14 05:09:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:14,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-14 05:09:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:14,151 INFO L225 Difference]: With dead ends: 1206 [2024-10-14 05:09:14,151 INFO L226 Difference]: Without dead ends: 804 [2024-10-14 05:09:14,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:14,153 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 372 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:14,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 403 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-10-14 05:09:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 755. [2024-10-14 05:09:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 650 states have (on average 1.3584615384615384) internal successors, (883), 661 states have internal predecessors, (883), 63 states have call successors, (63), 35 states have call predecessors, (63), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2024-10-14 05:09:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1035 transitions. [2024-10-14 05:09:14,195 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1035 transitions. Word has length 59 [2024-10-14 05:09:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:14,195 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1035 transitions. [2024-10-14 05:09:14,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1035 transitions. [2024-10-14 05:09:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:09:14,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:14,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:14,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:09:14,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:14,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1511810339, now seen corresponding path program 1 times [2024-10-14 05:09:14,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:14,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623331383] [2024-10-14 05:09:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:14,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:09:14,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:14,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623331383] [2024-10-14 05:09:14,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623331383] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:14,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46987970] [2024-10-14 05:09:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:14,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:14,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:14,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:14,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 05:09:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:09:14,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 05:09:14,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:14,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46987970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:14,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:14,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:09:14,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231870446] [2024-10-14 05:09:14,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:14,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:14,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:14,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:14,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:14,395 INFO L87 Difference]: Start difference. First operand 755 states and 1035 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:14,516 INFO L93 Difference]: Finished difference Result 1243 states and 1709 transitions. [2024-10-14 05:09:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:09:14,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-14 05:09:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:14,520 INFO L225 Difference]: With dead ends: 1243 [2024-10-14 05:09:14,523 INFO L226 Difference]: Without dead ends: 760 [2024-10-14 05:09:14,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:14,529 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:14,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 817 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:09:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-10-14 05:09:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2024-10-14 05:09:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 655 states have (on average 1.3435114503816794) internal successors, (880), 666 states have internal predecessors, (880), 63 states have call successors, (63), 35 states have call predecessors, (63), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2024-10-14 05:09:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1032 transitions. [2024-10-14 05:09:14,591 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1032 transitions. Word has length 60 [2024-10-14 05:09:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:14,591 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1032 transitions. [2024-10-14 05:09:14,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1032 transitions. [2024-10-14 05:09:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:09:14,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:14,593 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:14,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 05:09:14,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 05:09:14,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:14,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1939151455, now seen corresponding path program 1 times [2024-10-14 05:09:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:14,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493856511] [2024-10-14 05:09:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 05:09:14,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:14,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493856511] [2024-10-14 05:09:14,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493856511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:14,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561266515] [2024-10-14 05:09:14,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:14,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:14,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:14,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:14,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 05:09:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:09:15,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:09:15,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:15,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561266515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:15,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:09:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607036971] [2024-10-14 05:09:15,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:15,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:15,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:15,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:15,034 INFO L87 Difference]: Start difference. First operand 760 states and 1032 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:15,106 INFO L93 Difference]: Finished difference Result 1186 states and 1611 transitions. [2024-10-14 05:09:15,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:09:15,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-14 05:09:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:15,110 INFO L225 Difference]: With dead ends: 1186 [2024-10-14 05:09:15,110 INFO L226 Difference]: Without dead ends: 657 [2024-10-14 05:09:15,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:15,112 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:15,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 817 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-14 05:09:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 650. [2024-10-14 05:09:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 563 states have (on average 1.344582593250444) internal successors, (757), 572 states have internal predecessors, (757), 53 states have call successors, (53), 29 states have call predecessors, (53), 32 states have return successors, (70), 49 states have call predecessors, (70), 51 states have call successors, (70) [2024-10-14 05:09:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 880 transitions. [2024-10-14 05:09:15,141 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 880 transitions. Word has length 60 [2024-10-14 05:09:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:15,141 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 880 transitions. [2024-10-14 05:09:15,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 880 transitions. [2024-10-14 05:09:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:09:15,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:15,143 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:15,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 05:09:15,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 05:09:15,344 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:15,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash -558176225, now seen corresponding path program 1 times [2024-10-14 05:09:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88721906] [2024-10-14 05:09:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:09:15,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:15,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88721906] [2024-10-14 05:09:15,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88721906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:15,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:15,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:09:15,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96089155] [2024-10-14 05:09:15,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:15,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:09:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:15,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:09:15,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:15,440 INFO L87 Difference]: Start difference. First operand 650 states and 880 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:09:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:15,679 INFO L93 Difference]: Finished difference Result 735 states and 983 transitions. [2024-10-14 05:09:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:09:15,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-14 05:09:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:15,683 INFO L225 Difference]: With dead ends: 735 [2024-10-14 05:09:15,683 INFO L226 Difference]: Without dead ends: 732 [2024-10-14 05:09:15,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:09:15,683 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 644 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:15,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 400 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-14 05:09:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 649. [2024-10-14 05:09:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 563 states have (on average 1.3410301953818828) internal successors, (755), 571 states have internal predecessors, (755), 52 states have call successors, (52), 29 states have call predecessors, (52), 32 states have return successors, (70), 49 states have call predecessors, (70), 51 states have call successors, (70) [2024-10-14 05:09:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 877 transitions. [2024-10-14 05:09:15,709 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 877 transitions. Word has length 60 [2024-10-14 05:09:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:15,709 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 877 transitions. [2024-10-14 05:09:15,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:09:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 877 transitions. [2024-10-14 05:09:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:09:15,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:15,711 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:15,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:09:15,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:15,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash -124330418, now seen corresponding path program 1 times [2024-10-14 05:09:15,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:15,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311518516] [2024-10-14 05:09:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:15,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:09:15,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:15,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311518516] [2024-10-14 05:09:15,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311518516] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:15,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220917253] [2024-10-14 05:09:15,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:15,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:15,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:15,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:15,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 05:09:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:09:15,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:09:16,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:09:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:09:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220917253] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:09:16,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:09:16,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-14 05:09:16,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519122902] [2024-10-14 05:09:16,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:09:16,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:09:16,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:16,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:09:16,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:09:16,234 INFO L87 Difference]: Start difference. First operand 649 states and 877 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 05:09:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:16,746 INFO L93 Difference]: Finished difference Result 1452 states and 1912 transitions. [2024-10-14 05:09:16,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 05:09:16,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-14 05:09:16,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:16,753 INFO L225 Difference]: With dead ends: 1452 [2024-10-14 05:09:16,753 INFO L226 Difference]: Without dead ends: 1449 [2024-10-14 05:09:16,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 05:09:16,757 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 531 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:16,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1245 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:09:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2024-10-14 05:09:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 952. [2024-10-14 05:09:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 830 states have (on average 1.3265060240963855) internal successors, (1101), 844 states have internal predecessors, (1101), 71 states have call successors, (71), 42 states have call predecessors, (71), 49 states have return successors, (100), 66 states have call predecessors, (100), 70 states have call successors, (100) [2024-10-14 05:09:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1272 transitions. [2024-10-14 05:09:16,844 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1272 transitions. Word has length 61 [2024-10-14 05:09:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:16,844 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1272 transitions. [2024-10-14 05:09:16,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 05:09:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1272 transitions. [2024-10-14 05:09:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:09:16,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:16,847 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] [2024-10-14 05:09:16,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 05:09:17,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:17,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:17,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash -680097912, now seen corresponding path program 1 times [2024-10-14 05:09:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034757306] [2024-10-14 05:09:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:17,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:17,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:17,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:17,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:17,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:17,153 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-14 05:09:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:17,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034757306] [2024-10-14 05:09:17,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034757306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:17,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:17,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:09:17,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381352025] [2024-10-14 05:09:17,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:17,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:09:17,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:17,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:09:17,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:17,155 INFO L87 Difference]: Start difference. First operand 952 states and 1272 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:17,962 INFO L93 Difference]: Finished difference Result 1293 states and 1812 transitions. [2024-10-14 05:09:17,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:09:17,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:09:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:17,967 INFO L225 Difference]: With dead ends: 1293 [2024-10-14 05:09:17,967 INFO L226 Difference]: Without dead ends: 1163 [2024-10-14 05:09:17,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:09:17,969 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 627 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:17,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 601 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:09:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-10-14 05:09:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1084. [2024-10-14 05:09:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 943 states have (on average 1.3552492046659597) internal successors, (1278), 958 states have internal predecessors, (1278), 83 states have call successors, (83), 48 states have call predecessors, (83), 56 states have return successors, (115), 78 states have call predecessors, (115), 82 states have call successors, (115) [2024-10-14 05:09:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1476 transitions. [2024-10-14 05:09:18,048 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1476 transitions. Word has length 71 [2024-10-14 05:09:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:18,048 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1476 transitions. [2024-10-14 05:09:18,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1476 transitions. [2024-10-14 05:09:18,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:09:18,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:18,050 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] [2024-10-14 05:09:18,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:09:18,050 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:18,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:18,051 INFO L85 PathProgramCache]: Analyzing trace with hash 21150476, now seen corresponding path program 1 times [2024-10-14 05:09:18,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:18,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595138228] [2024-10-14 05:09:18,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:18,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,142 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-14 05:09:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595138228] [2024-10-14 05:09:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595138228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:18,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:18,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:18,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357699860] [2024-10-14 05:09:18,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:18,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:18,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:18,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:18,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:18,144 INFO L87 Difference]: Start difference. First operand 1084 states and 1476 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:19,180 INFO L93 Difference]: Finished difference Result 1598 states and 2282 transitions. [2024-10-14 05:09:19,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:09:19,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:09:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:19,185 INFO L225 Difference]: With dead ends: 1598 [2024-10-14 05:09:19,185 INFO L226 Difference]: Without dead ends: 1336 [2024-10-14 05:09:19,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:09:19,187 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 636 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:19,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1005 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:09:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-10-14 05:09:19,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1207. [2024-10-14 05:09:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1047 states have (on average 1.3724928366762177) internal successors, (1437), 1063 states have internal predecessors, (1437), 95 states have call successors, (95), 54 states have call predecessors, (95), 63 states have return successors, (129), 91 states have call predecessors, (129), 94 states have call successors, (129) [2024-10-14 05:09:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1661 transitions. [2024-10-14 05:09:19,301 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1661 transitions. Word has length 71 [2024-10-14 05:09:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:19,301 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1661 transitions. [2024-10-14 05:09:19,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1661 transitions. [2024-10-14 05:09:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:09:19,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:19,304 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] [2024-10-14 05:09:19,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 05:09:19,307 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:19,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash 454879562, now seen corresponding path program 1 times [2024-10-14 05:09:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:19,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249689353] [2024-10-14 05:09:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:19,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,422 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-14 05:09:19,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:19,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249689353] [2024-10-14 05:09:19,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249689353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:19,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:19,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:19,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71740413] [2024-10-14 05:09:19,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:19,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:19,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:19,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:19,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:19,424 INFO L87 Difference]: Start difference. First operand 1207 states and 1661 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:19,940 INFO L93 Difference]: Finished difference Result 1721 states and 2473 transitions. [2024-10-14 05:09:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:09:19,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:09:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:19,945 INFO L225 Difference]: With dead ends: 1721 [2024-10-14 05:09:19,946 INFO L226 Difference]: Without dead ends: 1336 [2024-10-14 05:09:19,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:09:19,947 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 589 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:19,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 505 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:09:19,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-10-14 05:09:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1207. [2024-10-14 05:09:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1047 states have (on average 1.3696275071633237) internal successors, (1434), 1063 states have internal predecessors, (1434), 95 states have call successors, (95), 54 states have call predecessors, (95), 63 states have return successors, (129), 91 states have call predecessors, (129), 94 states have call successors, (129) [2024-10-14 05:09:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1658 transitions. [2024-10-14 05:09:20,045 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1658 transitions. Word has length 71 [2024-10-14 05:09:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:20,045 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1658 transitions. [2024-10-14 05:09:20,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1658 transitions. [2024-10-14 05:09:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:09:20,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:20,046 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] [2024-10-14 05:09:20,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:09:20,047 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:20,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 495554312, now seen corresponding path program 1 times [2024-10-14 05:09:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:20,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964905138] [2024-10-14 05:09:20,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,146 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-14 05:09:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964905138] [2024-10-14 05:09:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964905138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:20,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:20,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:20,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123306200] [2024-10-14 05:09:20,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:20,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:20,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:20,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:20,147 INFO L87 Difference]: Start difference. First operand 1207 states and 1658 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:21,231 INFO L93 Difference]: Finished difference Result 2127 states and 3083 transitions. [2024-10-14 05:09:21,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:09:21,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:09:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:21,238 INFO L225 Difference]: With dead ends: 2127 [2024-10-14 05:09:21,238 INFO L226 Difference]: Without dead ends: 1742 [2024-10-14 05:09:21,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:09:21,240 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 742 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:21,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 996 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:09:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2024-10-14 05:09:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1456. [2024-10-14 05:09:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1260 states have (on average 1.396031746031746) internal successors, (1759), 1278 states have internal predecessors, (1759), 117 states have call successors, (117), 66 states have call predecessors, (117), 77 states have return successors, (159), 115 states have call predecessors, (159), 116 states have call successors, (159) [2024-10-14 05:09:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2035 transitions. [2024-10-14 05:09:21,326 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2035 transitions. Word has length 71 [2024-10-14 05:09:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:21,328 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 2035 transitions. [2024-10-14 05:09:21,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2035 transitions. [2024-10-14 05:09:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:09:21,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:21,330 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] [2024-10-14 05:09:21,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:09:21,330 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:21,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:21,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1882339722, now seen corresponding path program 1 times [2024-10-14 05:09:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:21,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314080679] [2024-10-14 05:09:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:21,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:21,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:21,421 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-14 05:09:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:21,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314080679] [2024-10-14 05:09:21,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314080679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:21,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367064032] [2024-10-14 05:09:21,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:21,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:21,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:21,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:21,423 INFO L87 Difference]: Start difference. First operand 1456 states and 2035 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:22,482 INFO L93 Difference]: Finished difference Result 3024 states and 4450 transitions. [2024-10-14 05:09:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:09:22,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:09:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:22,492 INFO L225 Difference]: With dead ends: 3024 [2024-10-14 05:09:22,492 INFO L226 Difference]: Without dead ends: 2390 [2024-10-14 05:09:22,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:09:22,494 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 671 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:22,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 768 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:09:22,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2024-10-14 05:09:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 1929. [2024-10-14 05:09:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1663 states have (on average 1.4257366205652435) internal successors, (2371), 1685 states have internal predecessors, (2371), 159 states have call successors, (159), 90 states have call predecessors, (159), 105 states have return successors, (223), 161 states have call predecessors, (223), 158 states have call successors, (223) [2024-10-14 05:09:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2753 transitions. [2024-10-14 05:09:22,634 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2753 transitions. Word has length 71 [2024-10-14 05:09:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:22,634 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 2753 transitions. [2024-10-14 05:09:22,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2753 transitions. [2024-10-14 05:09:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:09:22,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:22,637 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] [2024-10-14 05:09:22,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:09:22,637 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:22,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:22,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1536608568, now seen corresponding path program 1 times [2024-10-14 05:09:22,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:22,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334266002] [2024-10-14 05:09:22,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,709 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-14 05:09:22,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:22,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334266002] [2024-10-14 05:09:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334266002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:22,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:22,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548452958] [2024-10-14 05:09:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:22,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:22,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:22,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:22,710 INFO L87 Difference]: Start difference. First operand 1929 states and 2753 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:23,299 INFO L93 Difference]: Finished difference Result 3329 states and 4926 transitions. [2024-10-14 05:09:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:09:23,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:09:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:23,307 INFO L225 Difference]: With dead ends: 3329 [2024-10-14 05:09:23,308 INFO L226 Difference]: Without dead ends: 2222 [2024-10-14 05:09:23,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:09:23,311 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 508 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:23,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 612 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:09:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2024-10-14 05:09:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1929. [2024-10-14 05:09:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1663 states have (on average 1.4203247143716176) internal successors, (2362), 1685 states have internal predecessors, (2362), 159 states have call successors, (159), 90 states have call predecessors, (159), 105 states have return successors, (223), 161 states have call predecessors, (223), 158 states have call successors, (223) [2024-10-14 05:09:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2744 transitions. [2024-10-14 05:09:23,483 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2744 transitions. Word has length 71 [2024-10-14 05:09:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:23,486 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 2744 transitions. [2024-10-14 05:09:23,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2744 transitions. [2024-10-14 05:09:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:09:23,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:23,493 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] [2024-10-14 05:09:23,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:09:23,494 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:23,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1092707894, now seen corresponding path program 1 times [2024-10-14 05:09:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831985152] [2024-10-14 05:09:23,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:23,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:23,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:23,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:23,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:23,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:23,665 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-14 05:09:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:23,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831985152] [2024-10-14 05:09:23,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831985152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:23,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61266271] [2024-10-14 05:09:23,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:23,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:23,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:23,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:23,669 INFO L87 Difference]: Start difference. First operand 1929 states and 2744 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:24,932 INFO L93 Difference]: Finished difference Result 4593 states and 6794 transitions. [2024-10-14 05:09:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:09:24,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:09:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:24,946 INFO L225 Difference]: With dead ends: 4593 [2024-10-14 05:09:24,947 INFO L226 Difference]: Without dead ends: 3486 [2024-10-14 05:09:24,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:09:24,950 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 613 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:24,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 996 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:09:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2024-10-14 05:09:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 2903. [2024-10-14 05:09:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2501 states have (on average 1.4498200719712115) internal successors, (3626), 2531 states have internal predecessors, (3626), 239 states have call successors, (239), 138 states have call predecessors, (239), 161 states have return successors, (365), 249 states have call predecessors, (365), 238 states have call successors, (365) [2024-10-14 05:09:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 4230 transitions. [2024-10-14 05:09:25,152 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 4230 transitions. Word has length 71 [2024-10-14 05:09:25,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:25,153 INFO L471 AbstractCegarLoop]: Abstraction has 2903 states and 4230 transitions. [2024-10-14 05:09:25,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 4230 transitions. [2024-10-14 05:09:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:09:25,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:25,156 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] [2024-10-14 05:09:25,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:09:25,156 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:25,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash 445632136, now seen corresponding path program 1 times [2024-10-14 05:09:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:25,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949549502] [2024-10-14 05:09:25,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:25,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:25,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:25,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:25,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:25,232 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-14 05:09:25,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:25,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949549502] [2024-10-14 05:09:25,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949549502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:25,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:25,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:09:25,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614276346] [2024-10-14 05:09:25,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:25,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:09:25,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:25,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:09:25,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:25,235 INFO L87 Difference]: Start difference. First operand 2903 states and 4230 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:26,333 INFO L93 Difference]: Finished difference Result 6782 states and 10170 transitions. [2024-10-14 05:09:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:09:26,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:09:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:26,350 INFO L225 Difference]: With dead ends: 6782 [2024-10-14 05:09:26,350 INFO L226 Difference]: Without dead ends: 4702 [2024-10-14 05:09:26,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:09:26,356 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 775 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:26,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 770 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:09:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4702 states. [2024-10-14 05:09:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4702 to 3983. [2024-10-14 05:09:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 3418 states have (on average 1.456699824458748) internal successors, (4979), 3465 states have internal predecessors, (4979), 340 states have call successors, (340), 192 states have call predecessors, (340), 223 states have return successors, (494), 341 states have call predecessors, (494), 339 states have call successors, (494) [2024-10-14 05:09:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 5813 transitions. [2024-10-14 05:09:26,768 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 5813 transitions. Word has length 71 [2024-10-14 05:09:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:26,768 INFO L471 AbstractCegarLoop]: Abstraction has 3983 states and 5813 transitions. [2024-10-14 05:09:26,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 5813 transitions. [2024-10-14 05:09:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:09:26,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:26,772 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:26,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:09:26,772 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:26,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2128868807, now seen corresponding path program 2 times [2024-10-14 05:09:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:26,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889584519] [2024-10-14 05:09:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:26,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 05:09:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 05:09:26,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:26,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889584519] [2024-10-14 05:09:26,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889584519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:26,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:26,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:26,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683729270] [2024-10-14 05:09:26,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:26,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:26,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:26,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:26,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:26,803 INFO L87 Difference]: Start difference. First operand 3983 states and 5813 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 05:09:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:27,189 INFO L93 Difference]: Finished difference Result 4611 states and 6630 transitions. [2024-10-14 05:09:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:27,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-14 05:09:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:27,213 INFO L225 Difference]: With dead ends: 4611 [2024-10-14 05:09:27,214 INFO L226 Difference]: Without dead ends: 3952 [2024-10-14 05:09:27,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:27,218 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 381 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:27,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 419 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2024-10-14 05:09:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3875. [2024-10-14 05:09:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3875 states, 3323 states have (on average 1.4598254589226602) internal successors, (4851), 3370 states have internal predecessors, (4851), 333 states have call successors, (333), 187 states have call predecessors, (333), 217 states have return successors, (483), 333 states have call predecessors, (483), 332 states have call successors, (483) [2024-10-14 05:09:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3875 states to 3875 states and 5667 transitions. [2024-10-14 05:09:27,507 INFO L78 Accepts]: Start accepts. Automaton has 3875 states and 5667 transitions. Word has length 78 [2024-10-14 05:09:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:27,508 INFO L471 AbstractCegarLoop]: Abstraction has 3875 states and 5667 transitions. [2024-10-14 05:09:27,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 05:09:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3875 states and 5667 transitions. [2024-10-14 05:09:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 05:09:27,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:27,512 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:27,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:09:27,512 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:27,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:27,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2130319401, now seen corresponding path program 1 times [2024-10-14 05:09:27,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:27,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033599868] [2024-10-14 05:09:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:27,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:27,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 05:09:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 05:09:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:27,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 05:09:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 05:09:27,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:27,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033599868] [2024-10-14 05:09:27,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033599868] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:27,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793794307] [2024-10-14 05:09:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:27,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:27,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:27,561 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:27,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 05:09:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:27,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:27,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 05:09:27,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:27,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793794307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:27,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:27,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 05:09:27,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64020286] [2024-10-14 05:09:27,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:27,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:27,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:27,648 INFO L87 Difference]: Start difference. First operand 3875 states and 5667 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 05:09:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:27,865 INFO L93 Difference]: Finished difference Result 4158 states and 6023 transitions. [2024-10-14 05:09:27,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:27,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-14 05:09:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:27,891 INFO L225 Difference]: With dead ends: 4158 [2024-10-14 05:09:27,891 INFO L226 Difference]: Without dead ends: 3171 [2024-10-14 05:09:27,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:27,895 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 55 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:27,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 556 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2024-10-14 05:09:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3171. [2024-10-14 05:09:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 2704 states have (on average 1.5007396449704142) internal successors, (4058), 2738 states have internal predecessors, (4058), 286 states have call successors, (286), 156 states have call predecessors, (286), 180 states have return successors, (411), 292 states have call predecessors, (411), 286 states have call successors, (411) [2024-10-14 05:09:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4755 transitions. [2024-10-14 05:09:28,120 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4755 transitions. Word has length 92 [2024-10-14 05:09:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:28,121 INFO L471 AbstractCegarLoop]: Abstraction has 3171 states and 4755 transitions. [2024-10-14 05:09:28,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 05:09:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4755 transitions. [2024-10-14 05:09:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 05:09:28,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:28,127 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:28,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 05:09:28,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:28,328 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:28,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:28,328 INFO L85 PathProgramCache]: Analyzing trace with hash -936981602, now seen corresponding path program 1 times [2024-10-14 05:09:28,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:28,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312093778] [2024-10-14 05:09:28,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:28,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:28,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:28,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:28,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 05:09:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:28,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:28,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 05:09:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 05:09:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312093778] [2024-10-14 05:09:28,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312093778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713890844] [2024-10-14 05:09:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:28,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:28,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:28,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:28,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 05:09:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:28,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:28,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 05:09:28,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:28,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713890844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:28,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:28,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 05:09:28,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647308282] [2024-10-14 05:09:28,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:28,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:28,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:28,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:28,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:28,534 INFO L87 Difference]: Start difference. First operand 3171 states and 4755 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:09:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:29,124 INFO L93 Difference]: Finished difference Result 9410 states and 14205 transitions. [2024-10-14 05:09:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:29,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2024-10-14 05:09:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:29,160 INFO L225 Difference]: With dead ends: 9410 [2024-10-14 05:09:29,160 INFO L226 Difference]: Without dead ends: 6250 [2024-10-14 05:09:29,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:29,175 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 169 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:29,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 363 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6250 states. [2024-10-14 05:09:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6250 to 6222. [2024-10-14 05:09:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6222 states, 5307 states have (on average 1.4948181646881478) internal successors, (7933), 5374 states have internal predecessors, (7933), 554 states have call successors, (554), 312 states have call predecessors, (554), 360 states have return successors, (789), 551 states have call predecessors, (789), 554 states have call successors, (789) [2024-10-14 05:09:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 9276 transitions. [2024-10-14 05:09:29,621 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 9276 transitions. Word has length 115 [2024-10-14 05:09:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:29,622 INFO L471 AbstractCegarLoop]: Abstraction has 6222 states and 9276 transitions. [2024-10-14 05:09:29,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:09:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 9276 transitions. [2024-10-14 05:09:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 05:09:29,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:29,632 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:29,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 05:09:29,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:29,832 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:29,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1053545440, now seen corresponding path program 1 times [2024-10-14 05:09:29,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:29,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053199983] [2024-10-14 05:09:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:29,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 05:09:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 05:09:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 05:09:29,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053199983] [2024-10-14 05:09:29,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053199983] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101059650] [2024-10-14 05:09:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:29,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:29,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:29,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:29,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 05:09:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:30,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:30,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 05:09:30,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:30,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101059650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:30,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:30,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:30,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675503416] [2024-10-14 05:09:30,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:30,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:30,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:30,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:30,099 INFO L87 Difference]: Start difference. First operand 6222 states and 9276 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 05:09:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:30,855 INFO L93 Difference]: Finished difference Result 18381 states and 27754 transitions. [2024-10-14 05:09:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:30,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2024-10-14 05:09:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:30,906 INFO L225 Difference]: With dead ends: 18381 [2024-10-14 05:09:30,906 INFO L226 Difference]: Without dead ends: 12171 [2024-10-14 05:09:30,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:30,973 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 181 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:30,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 559 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:09:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2024-10-14 05:09:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 12171. [2024-10-14 05:09:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12171 states, 10379 states have (on average 1.4874265343482032) internal successors, (15438), 10495 states have internal predecessors, (15438), 1071 states have call successors, (1071), 624 states have call predecessors, (1071), 720 states have return successors, (1744), 1083 states have call predecessors, (1744), 1071 states have call successors, (1744) [2024-10-14 05:09:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12171 states to 12171 states and 18253 transitions. [2024-10-14 05:09:32,066 INFO L78 Accepts]: Start accepts. Automaton has 12171 states and 18253 transitions. Word has length 115 [2024-10-14 05:09:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:32,066 INFO L471 AbstractCegarLoop]: Abstraction has 12171 states and 18253 transitions. [2024-10-14 05:09:32,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 05:09:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 12171 states and 18253 transitions. [2024-10-14 05:09:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-14 05:09:32,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:32,098 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:32,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 05:09:32,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:32,300 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:32,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1733248034, now seen corresponding path program 1 times [2024-10-14 05:09:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:32,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524326777] [2024-10-14 05:09:32,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:32,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 05:09:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 05:09:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 05:09:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 05:09:32,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524326777] [2024-10-14 05:09:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524326777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749628951] [2024-10-14 05:09:32,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:32,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:32,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:32,455 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:32,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 05:09:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:32,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 05:09:32,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:32,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749628951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:32,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:32,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 05:09:32,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098397261] [2024-10-14 05:09:32,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:32,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:32,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:32,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:32,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:32,661 INFO L87 Difference]: Start difference. First operand 12171 states and 18253 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 05:09:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:34,172 INFO L93 Difference]: Finished difference Result 36157 states and 54718 transitions. [2024-10-14 05:09:34,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:34,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 148 [2024-10-14 05:09:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:34,273 INFO L225 Difference]: With dead ends: 36157 [2024-10-14 05:09:34,273 INFO L226 Difference]: Without dead ends: 24003 [2024-10-14 05:09:34,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:34,305 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 121 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:34,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 363 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24003 states. [2024-10-14 05:09:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24003 to 23897. [2024-10-14 05:09:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23897 states, 20377 states have (on average 1.4808853118712273) internal successors, (30176), 20607 states have internal predecessors, (30176), 2079 states have call successors, (2079), 1248 states have call predecessors, (2079), 1440 states have return successors, (3366), 2073 states have call predecessors, (3366), 2079 states have call successors, (3366) [2024-10-14 05:09:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23897 states to 23897 states and 35621 transitions. [2024-10-14 05:09:36,530 INFO L78 Accepts]: Start accepts. Automaton has 23897 states and 35621 transitions. Word has length 148 [2024-10-14 05:09:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:36,530 INFO L471 AbstractCegarLoop]: Abstraction has 23897 states and 35621 transitions. [2024-10-14 05:09:36,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 05:09:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 23897 states and 35621 transitions. [2024-10-14 05:09:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-14 05:09:36,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:36,587 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:36,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 05:09:36,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:36,789 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:36,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:36,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1812538152, now seen corresponding path program 1 times [2024-10-14 05:09:36,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:36,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638923092] [2024-10-14 05:09:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:36,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 05:09:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 05:09:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 05:09:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 05:09:36,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:36,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638923092] [2024-10-14 05:09:36,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638923092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461041679] [2024-10-14 05:09:36,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:36,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:36,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:36,906 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:36,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 05:09:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:37,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:37,103 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 05:09:37,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:37,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461041679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:37,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:37,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 05:09:37,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516523623] [2024-10-14 05:09:37,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:37,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:37,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:37,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:37,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:37,107 INFO L87 Difference]: Start difference. First operand 23897 states and 35621 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 05:09:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:41,041 INFO L93 Difference]: Finished difference Result 70601 states and 105900 transitions. [2024-10-14 05:09:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:41,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 148 [2024-10-14 05:09:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:41,202 INFO L225 Difference]: With dead ends: 70601 [2024-10-14 05:09:41,203 INFO L226 Difference]: Without dead ends: 46721 [2024-10-14 05:09:41,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:41,259 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 123 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:41,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 372 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46721 states. [2024-10-14 05:09:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46721 to 46511. [2024-10-14 05:09:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46511 states, 39835 states have (on average 1.4761390736789255) internal successors, (58802), 40293 states have internal predecessors, (58802), 3869 states have call successors, (3869), 2422 states have call predecessors, (3869), 2806 states have return successors, (6252), 3827 states have call predecessors, (6252), 3869 states have call successors, (6252) [2024-10-14 05:09:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46511 states to 46511 states and 68923 transitions. [2024-10-14 05:09:45,139 INFO L78 Accepts]: Start accepts. Automaton has 46511 states and 68923 transitions. Word has length 148 [2024-10-14 05:09:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:45,140 INFO L471 AbstractCegarLoop]: Abstraction has 46511 states and 68923 transitions. [2024-10-14 05:09:45,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 05:09:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 46511 states and 68923 transitions. [2024-10-14 05:09:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 05:09:45,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:45,220 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:45,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 05:09:45,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-14 05:09:45,425 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:45,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:45,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2020365725, now seen corresponding path program 1 times [2024-10-14 05:09:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:45,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146691456] [2024-10-14 05:09:45,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:45,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 05:09:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 05:09:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 05:09:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 05:09:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 05:09:45,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:45,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146691456] [2024-10-14 05:09:45,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146691456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:45,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277519754] [2024-10-14 05:09:45,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:45,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:45,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:45,521 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:45,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 05:09:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:45,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:45,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 05:09:45,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277519754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:45,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:45,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874658678] [2024-10-14 05:09:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:45,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:45,684 INFO L87 Difference]: Start difference. First operand 46511 states and 68923 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 05:09:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:49,019 INFO L93 Difference]: Finished difference Result 73463 states and 109492 transitions. [2024-10-14 05:09:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:49,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 165 [2024-10-14 05:09:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:49,159 INFO L225 Difference]: With dead ends: 73463 [2024-10-14 05:09:49,160 INFO L226 Difference]: Without dead ends: 40767 [2024-10-14 05:09:49,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:49,223 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 143 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:49,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 224 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40767 states. [2024-10-14 05:09:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40767 to 29719. [2024-10-14 05:09:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29719 states, 25507 states have (on average 1.4296467636335124) internal successors, (36466), 25745 states have internal predecessors, (36466), 2409 states have call successors, (2409), 1610 states have call predecessors, (2409), 1802 states have return successors, (3422), 2379 states have call predecessors, (3422), 2409 states have call successors, (3422) [2024-10-14 05:09:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29719 states to 29719 states and 42297 transitions. [2024-10-14 05:09:52,115 INFO L78 Accepts]: Start accepts. Automaton has 29719 states and 42297 transitions. Word has length 165 [2024-10-14 05:09:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:52,116 INFO L471 AbstractCegarLoop]: Abstraction has 29719 states and 42297 transitions. [2024-10-14 05:09:52,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 05:09:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 29719 states and 42297 transitions. [2024-10-14 05:09:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 05:09:52,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:52,198 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:52,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 05:09:52,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-14 05:09:52,399 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:52,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1807096806, now seen corresponding path program 1 times [2024-10-14 05:09:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:52,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191317146] [2024-10-14 05:09:52,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:52,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 05:09:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 05:09:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 05:09:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 05:09:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-14 05:09:52,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:52,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191317146] [2024-10-14 05:09:52,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191317146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:52,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871237343] [2024-10-14 05:09:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:52,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:52,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:52,515 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:52,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 05:09:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:52,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 05:09:52,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-14 05:09:52,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:52,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871237343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:52,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:52,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598505084] [2024-10-14 05:09:52,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:52,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:52,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:52,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:52,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:52,665 INFO L87 Difference]: Start difference. First operand 29719 states and 42297 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 05:09:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:55,260 INFO L93 Difference]: Finished difference Result 52314 states and 74258 transitions. [2024-10-14 05:09:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:55,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 165 [2024-10-14 05:09:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:55,357 INFO L225 Difference]: With dead ends: 52314 [2024-10-14 05:09:55,357 INFO L226 Difference]: Without dead ends: 31745 [2024-10-14 05:09:55,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:55,394 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 150 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:55,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 409 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31745 states. [2024-10-14 05:09:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31745 to 31641. [2024-10-14 05:09:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31641 states, 27225 states have (on average 1.4044444444444444) internal successors, (38236), 27463 states have internal predecessors, (38236), 2467 states have call successors, (2467), 1756 states have call predecessors, (2467), 1948 states have return successors, (3626), 2437 states have call predecessors, (3626), 2467 states have call successors, (3626) [2024-10-14 05:09:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31641 states to 31641 states and 44329 transitions. [2024-10-14 05:09:57,986 INFO L78 Accepts]: Start accepts. Automaton has 31641 states and 44329 transitions. Word has length 165 [2024-10-14 05:09:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:57,986 INFO L471 AbstractCegarLoop]: Abstraction has 31641 states and 44329 transitions. [2024-10-14 05:09:57,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 05:09:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 31641 states and 44329 transitions. [2024-10-14 05:09:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 05:09:58,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:58,032 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:58,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 05:09:58,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-14 05:09:58,233 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:58,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash 887933412, now seen corresponding path program 1 times [2024-10-14 05:09:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:58,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448289906] [2024-10-14 05:09:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:09:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:09:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:09:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 05:09:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 05:09:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 05:09:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 05:09:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-14 05:09:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448289906] [2024-10-14 05:09:58,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448289906] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:58,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942708798] [2024-10-14 05:09:58,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:58,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:58,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:58,336 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:58,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 05:09:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:58,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-14 05:09:58,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:58,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942708798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:58,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:58,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445404235] [2024-10-14 05:09:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:58,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:58,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:58,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:58,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:58,457 INFO L87 Difference]: Start difference. First operand 31641 states and 44329 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)