./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c6d968f3bfd626cfd1fff51fa64657ab37ae457da61332877d0ea5ab7fc90f2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:17:04,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:17:05,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:17:05,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:17:05,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:17:05,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:17:05,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:17:05,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:17:05,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:17:05,080 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:17:05,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:17:05,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:17:05,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:17:05,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:17:05,087 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:17:05,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:17:05,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:17:05,089 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:17:05,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:17:05,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:17:05,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:17:05,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:17:05,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:17:05,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:17:05,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:17:05,092 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:17:05,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:17:05,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:17:05,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:17:05,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:17:05,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:17:05,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:17:05,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:17:05,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:17:05,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:17:05,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:17:05,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:17:05,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:17:05,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:17:05,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:17:05,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:17:05,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:17:05,101 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5c6d968f3bfd626cfd1fff51fa64657ab37ae457da61332877d0ea5ab7fc90f2 [2024-10-11 03:17:05,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:17:05,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:17:05,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:17:05,391 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:17:05,392 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:17:05,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c [2024-10-11 03:17:06,963 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:17:07,195 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:17:07,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c [2024-10-11 03:17:07,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/772ae94f1/7bcc89aec92046d889432b1e1c761a5c/FLAGb268b4188 [2024-10-11 03:17:07,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/772ae94f1/7bcc89aec92046d889432b1e1c761a5c [2024-10-11 03:17:07,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:17:07,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:17:07,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:17:07,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:17:07,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:17:07,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:17:07" (1/1) ... [2024-10-11 03:17:07,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@afd0da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:07, skipping insertion in model container [2024-10-11 03:17:07,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:17:07" (1/1) ... [2024-10-11 03:17:07,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:17:07,943 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c[14698,14711] [2024-10-11 03:17:07,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:17:07,961 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:17:08,013 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c[14698,14711] [2024-10-11 03:17:08,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:17:08,041 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:17:08,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08 WrapperNode [2024-10-11 03:17:08,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:17:08,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:17:08,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:17:08,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:17:08,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,106 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 510 [2024-10-11 03:17:08,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:17:08,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:17:08,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:17:08,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:17:08,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,148 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:17:08,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:17:08,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:17:08,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:17:08,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:17:08,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (1/1) ... [2024-10-11 03:17:08,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:17:08,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:08,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:17:08,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:17:08,281 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-11 03:17:08,281 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-11 03:17:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:17:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-11 03:17:08,282 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-11 03:17:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-11 03:17:08,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-11 03:17:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-11 03:17:08,283 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-11 03:17:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 03:17:08,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 03:17:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:17:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-11 03:17:08,283 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-11 03:17:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:17:08,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:17:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-11 03:17:08,284 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-11 03:17:08,406 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:17:08,408 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:17:09,089 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-11 03:17:09,090 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:17:09,160 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:17:09,160 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:17:09,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:17:09 BoogieIcfgContainer [2024-10-11 03:17:09,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:17:09,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:17:09,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:17:09,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:17:09,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:17:07" (1/3) ... [2024-10-11 03:17:09,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6551810a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:17:09, skipping insertion in model container [2024-10-11 03:17:09,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:08" (2/3) ... [2024-10-11 03:17:09,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6551810a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:17:09, skipping insertion in model container [2024-10-11 03:17:09,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:17:09" (3/3) ... [2024-10-11 03:17:09,173 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.ufo.BOUNDED-10.pals.c [2024-10-11 03:17:09,191 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:17:09,191 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:17:09,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:17:09,296 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;@f95bbfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:17:09,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:17:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 131 states have (on average 1.5954198473282444) internal successors, (209), 132 states have internal predecessors, (209), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:17:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:17:09,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:09,323 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] [2024-10-11 03:17:09,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:09,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:09,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1288314428, now seen corresponding path program 1 times [2024-10-11 03:17:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:09,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632667428] [2024-10-11 03:17:09,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:09,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:09,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:09,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632667428] [2024-10-11 03:17:09,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632667428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:09,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:09,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:17:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946623669] [2024-10-11 03:17:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:09,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:17:09,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:09,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:17:09,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:17:09,725 INFO L87 Difference]: Start difference. First operand has 171 states, 131 states have (on average 1.5954198473282444) internal successors, (209), 132 states have internal predecessors, (209), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:09,806 INFO L93 Difference]: Finished difference Result 327 states and 543 transitions. [2024-10-11 03:17:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:17:09,809 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 03:17:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:09,819 INFO L225 Difference]: With dead ends: 327 [2024-10-11 03:17:09,820 INFO L226 Difference]: Without dead ends: 169 [2024-10-11 03:17:09,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:17:09,831 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:09,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-11 03:17:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-10-11 03:17:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 130 states have (on average 1.5692307692307692) internal successors, (204), 130 states have internal predecessors, (204), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:17:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 266 transitions. [2024-10-11 03:17:09,895 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 266 transitions. Word has length 23 [2024-10-11 03:17:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:09,897 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 266 transitions. [2024-10-11 03:17:09,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 266 transitions. [2024-10-11 03:17:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:17:09,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:09,900 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] [2024-10-11 03:17:09,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:17:09,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:09,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:09,901 INFO L85 PathProgramCache]: Analyzing trace with hash -705830278, now seen corresponding path program 1 times [2024-10-11 03:17:09,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:09,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201949596] [2024-10-11 03:17:09,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:10,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:10,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201949596] [2024-10-11 03:17:10,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201949596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:10,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:10,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:17:10,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725428606] [2024-10-11 03:17:10,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:10,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:17:10,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:10,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:17:10,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:17:10,227 INFO L87 Difference]: Start difference. First operand 169 states and 266 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:10,375 INFO L93 Difference]: Finished difference Result 432 states and 688 transitions. [2024-10-11 03:17:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:17:10,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 03:17:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:10,381 INFO L225 Difference]: With dead ends: 432 [2024-10-11 03:17:10,382 INFO L226 Difference]: Without dead ends: 276 [2024-10-11 03:17:10,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:17:10,384 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 128 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:10,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1259 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-11 03:17:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 169. [2024-10-11 03:17:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 130 states have (on average 1.476923076923077) internal successors, (192), 130 states have internal predecessors, (192), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:17:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 254 transitions. [2024-10-11 03:17:10,405 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 254 transitions. Word has length 23 [2024-10-11 03:17:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:10,406 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 254 transitions. [2024-10-11 03:17:10,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 254 transitions. [2024-10-11 03:17:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:17:10,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:10,408 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] [2024-10-11 03:17:10,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:17:10,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:10,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash 120145863, now seen corresponding path program 1 times [2024-10-11 03:17:10,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:10,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992089442] [2024-10-11 03:17:10,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:10,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:17:10,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:10,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992089442] [2024-10-11 03:17:10,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992089442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:10,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:10,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267072380] [2024-10-11 03:17:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:10,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:10,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:10,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:10,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:10,725 INFO L87 Difference]: Start difference. First operand 169 states and 254 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:10,829 INFO L93 Difference]: Finished difference Result 326 states and 499 transitions. [2024-10-11 03:17:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-10-11 03:17:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:10,831 INFO L225 Difference]: With dead ends: 326 [2024-10-11 03:17:10,831 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 03:17:10,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-11 03:17:10,835 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 3 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:10,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 719 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 03:17:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-10-11 03:17:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.4661654135338347) internal successors, (195), 133 states have internal predecessors, (195), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 03:17:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 257 transitions. [2024-10-11 03:17:10,850 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 257 transitions. Word has length 34 [2024-10-11 03:17:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:10,850 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 257 transitions. [2024-10-11 03:17:10,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:17:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 257 transitions. [2024-10-11 03:17:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:17:10,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:10,853 INFO L215 NwaCegarLoop]: trace histogram [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-11 03:17:10,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:17:10,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:10,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1571991065, now seen corresponding path program 1 times [2024-10-11 03:17:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475970996] [2024-10-11 03:17:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:10,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:10,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475970996] [2024-10-11 03:17:10,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475970996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:10,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:10,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885979358] [2024-10-11 03:17:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:10,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:10,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:10,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:10,979 INFO L87 Difference]: Start difference. First operand 173 states and 257 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:11,050 INFO L93 Difference]: Finished difference Result 476 states and 717 transitions. [2024-10-11 03:17:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:11,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2024-10-11 03:17:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:11,055 INFO L225 Difference]: With dead ends: 476 [2024-10-11 03:17:11,056 INFO L226 Difference]: Without dead ends: 319 [2024-10-11 03:17:11,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:11,059 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 210 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:11,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 497 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-11 03:17:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2024-10-11 03:17:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 238 states have (on average 1.4831932773109244) internal successors, (353), 239 states have internal predecessors, (353), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 03:17:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 473 transitions. [2024-10-11 03:17:11,118 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 473 transitions. Word has length 48 [2024-10-11 03:17:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:11,119 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 473 transitions. [2024-10-11 03:17:11,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 473 transitions. [2024-10-11 03:17:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:17:11,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:11,122 INFO L215 NwaCegarLoop]: trace histogram [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-11 03:17:11,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:17:11,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:11,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:11,123 INFO L85 PathProgramCache]: Analyzing trace with hash 403632391, now seen corresponding path program 1 times [2024-10-11 03:17:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:11,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668160782] [2024-10-11 03:17:11,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:11,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:11,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:11,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668160782] [2024-10-11 03:17:11,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668160782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:11,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:11,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:11,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168406940] [2024-10-11 03:17:11,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:11,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:11,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:11,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:11,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:11,226 INFO L87 Difference]: Start difference. First operand 315 states and 473 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:11,343 INFO L93 Difference]: Finished difference Result 889 states and 1345 transitions. [2024-10-11 03:17:11,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:11,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-11 03:17:11,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:11,350 INFO L225 Difference]: With dead ends: 889 [2024-10-11 03:17:11,352 INFO L226 Difference]: Without dead ends: 590 [2024-10-11 03:17:11,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:11,355 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 211 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:11,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 517 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-10-11 03:17:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 584. [2024-10-11 03:17:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 435 states have (on average 1.4919540229885058) internal successors, (649), 438 states have internal predecessors, (649), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-11 03:17:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 883 transitions. [2024-10-11 03:17:11,422 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 883 transitions. Word has length 49 [2024-10-11 03:17:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:11,424 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 883 transitions. [2024-10-11 03:17:11,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 883 transitions. [2024-10-11 03:17:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:17:11,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:11,427 INFO L215 NwaCegarLoop]: trace histogram [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-11 03:17:11,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:17:11,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:11,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash -876231287, now seen corresponding path program 1 times [2024-10-11 03:17:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:11,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142950098] [2024-10-11 03:17:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:11,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:11,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142950098] [2024-10-11 03:17:11,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142950098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:11,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:11,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:17:11,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276958346] [2024-10-11 03:17:11,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:11,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:11,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:11,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:11,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:11,612 INFO L87 Difference]: Start difference. First operand 584 states and 883 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:11,817 INFO L93 Difference]: Finished difference Result 1241 states and 1878 transitions. [2024-10-11 03:17:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:11,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-11 03:17:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:11,826 INFO L225 Difference]: With dead ends: 1241 [2024-10-11 03:17:11,827 INFO L226 Difference]: Without dead ends: 673 [2024-10-11 03:17:11,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:11,830 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 348 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:11,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 648 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-11 03:17:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 665. [2024-10-11 03:17:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 503 states have (on average 1.4791252485089463) internal successors, (744), 506 states have internal predecessors, (744), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 992 transitions. [2024-10-11 03:17:11,916 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 992 transitions. Word has length 49 [2024-10-11 03:17:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:11,917 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 992 transitions. [2024-10-11 03:17:11,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 992 transitions. [2024-10-11 03:17:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:17:11,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:11,924 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:11,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:17:11,924 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:11,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:11,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1026743594, now seen corresponding path program 1 times [2024-10-11 03:17:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:11,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049338862] [2024-10-11 03:17:11,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:11,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:17:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:12,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:12,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049338862] [2024-10-11 03:17:12,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049338862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:12,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:12,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:17:12,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540718513] [2024-10-11 03:17:12,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:12,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:12,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:12,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:12,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:12,094 INFO L87 Difference]: Start difference. First operand 665 states and 992 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:12,315 INFO L93 Difference]: Finished difference Result 1245 states and 1878 transitions. [2024-10-11 03:17:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:12,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-10-11 03:17:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:12,325 INFO L225 Difference]: With dead ends: 1245 [2024-10-11 03:17:12,325 INFO L226 Difference]: Without dead ends: 677 [2024-10-11 03:17:12,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:12,328 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 348 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:12,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 648 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-10-11 03:17:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 673. [2024-10-11 03:17:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 511 states have (on average 1.471624266144814) internal successors, (752), 514 states have internal predecessors, (752), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1000 transitions. [2024-10-11 03:17:12,391 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1000 transitions. Word has length 50 [2024-10-11 03:17:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:12,391 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1000 transitions. [2024-10-11 03:17:12,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1000 transitions. [2024-10-11 03:17:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:17:12,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:12,393 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:17:12,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:17:12,393 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:12,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:12,395 INFO L85 PathProgramCache]: Analyzing trace with hash -864045732, now seen corresponding path program 1 times [2024-10-11 03:17:12,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:12,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752558700] [2024-10-11 03:17:12,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:17:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:12,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752558700] [2024-10-11 03:17:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752558700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:12,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:12,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187869167] [2024-10-11 03:17:12,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:12,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:12,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:12,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:12,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:12,610 INFO L87 Difference]: Start difference. First operand 673 states and 1000 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:12,782 INFO L93 Difference]: Finished difference Result 1241 states and 1866 transitions. [2024-10-11 03:17:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:12,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2024-10-11 03:17:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:12,788 INFO L225 Difference]: With dead ends: 1241 [2024-10-11 03:17:12,788 INFO L226 Difference]: Without dead ends: 673 [2024-10-11 03:17:12,791 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-11 03:17:12,792 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 58 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:12,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 643 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-11 03:17:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2024-10-11 03:17:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 511 states have (on average 1.4637964774951076) internal successors, (748), 514 states have internal predecessors, (748), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 996 transitions. [2024-10-11 03:17:12,865 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 996 transitions. Word has length 52 [2024-10-11 03:17:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:12,865 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 996 transitions. [2024-10-11 03:17:12,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:17:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 996 transitions. [2024-10-11 03:17:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:17:12,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:12,867 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:17:12,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:17:12,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:12,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:12,868 INFO L85 PathProgramCache]: Analyzing trace with hash 798524631, now seen corresponding path program 1 times [2024-10-11 03:17:12,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:12,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116774025] [2024-10-11 03:17:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:12,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116774025] [2024-10-11 03:17:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116774025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:13,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:13,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107195183] [2024-10-11 03:17:13,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:13,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:13,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:13,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:13,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:13,122 INFO L87 Difference]: Start difference. First operand 673 states and 996 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 03:17:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:13,225 INFO L93 Difference]: Finished difference Result 1261 states and 1890 transitions. [2024-10-11 03:17:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:13,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-10-11 03:17:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:13,230 INFO L225 Difference]: With dead ends: 1261 [2024-10-11 03:17:13,231 INFO L226 Difference]: Without dead ends: 693 [2024-10-11 03:17:13,233 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-11 03:17:13,234 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 4 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:13,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 731 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-11 03:17:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-10-11 03:17:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 527 states have (on average 1.4497153700189753) internal successors, (764), 530 states have internal predecessors, (764), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1012 transitions. [2024-10-11 03:17:13,284 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1012 transitions. Word has length 53 [2024-10-11 03:17:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:13,284 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1012 transitions. [2024-10-11 03:17:13,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 03:17:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1012 transitions. [2024-10-11 03:17:13,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:17:13,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:13,286 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:17:13,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:17:13,286 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:13,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1770618019, now seen corresponding path program 1 times [2024-10-11 03:17:13,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:13,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380362306] [2024-10-11 03:17:13,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:13,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:13,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:13,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380362306] [2024-10-11 03:17:13,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380362306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:13,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:13,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:13,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929621291] [2024-10-11 03:17:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:13,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:13,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:13,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:13,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:13,471 INFO L87 Difference]: Start difference. First operand 693 states and 1012 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 03:17:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:13,592 INFO L93 Difference]: Finished difference Result 1301 states and 1934 transitions. [2024-10-11 03:17:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:13,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2024-10-11 03:17:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:13,598 INFO L225 Difference]: With dead ends: 1301 [2024-10-11 03:17:13,599 INFO L226 Difference]: Without dead ends: 713 [2024-10-11 03:17:13,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-11 03:17:13,602 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 4 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:13,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 717 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-10-11 03:17:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2024-10-11 03:17:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 543 states have (on average 1.4364640883977902) internal successors, (780), 546 states have internal predecessors, (780), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1028 transitions. [2024-10-11 03:17:13,689 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1028 transitions. Word has length 61 [2024-10-11 03:17:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:13,689 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1028 transitions. [2024-10-11 03:17:13,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 03:17:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1028 transitions. [2024-10-11 03:17:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:17:13,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:13,692 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:17:13,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:17:13,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:13,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash 424993415, now seen corresponding path program 1 times [2024-10-11 03:17:13,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:13,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371312722] [2024-10-11 03:17:13,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:13,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:13,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:13,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371312722] [2024-10-11 03:17:13,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371312722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:13,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:13,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:13,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112630699] [2024-10-11 03:17:13,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:13,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:13,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:13,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:13,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:13,858 INFO L87 Difference]: Start difference. First operand 713 states and 1028 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:17:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:13,949 INFO L93 Difference]: Finished difference Result 1337 states and 1950 transitions. [2024-10-11 03:17:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-11 03:17:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:13,956 INFO L225 Difference]: With dead ends: 1337 [2024-10-11 03:17:13,957 INFO L226 Difference]: Without dead ends: 729 [2024-10-11 03:17:13,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-11 03:17:13,960 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 3 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:13,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 727 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:13,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-10-11 03:17:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2024-10-11 03:17:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 555 states have (on average 1.427027027027027) internal successors, (792), 558 states have internal predecessors, (792), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1040 transitions. [2024-10-11 03:17:14,014 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1040 transitions. Word has length 69 [2024-10-11 03:17:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:14,015 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1040 transitions. [2024-10-11 03:17:14,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:17:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1040 transitions. [2024-10-11 03:17:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:17:14,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:14,017 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-10-11 03:17:14,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:17:14,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:14,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:14,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1473514578, now seen corresponding path program 1 times [2024-10-11 03:17:14,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:14,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762099169] [2024-10-11 03:17:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:17:14,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:14,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762099169] [2024-10-11 03:17:14,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762099169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:14,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:14,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:14,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761535340] [2024-10-11 03:17:14,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:14,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:14,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:14,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:14,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:14,224 INFO L87 Difference]: Start difference. First operand 729 states and 1040 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:17:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:14,329 INFO L93 Difference]: Finished difference Result 1373 states and 1990 transitions. [2024-10-11 03:17:14,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:14,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-11 03:17:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:14,336 INFO L225 Difference]: With dead ends: 1373 [2024-10-11 03:17:14,337 INFO L226 Difference]: Without dead ends: 749 [2024-10-11 03:17:14,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-11 03:17:14,340 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 4 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:14,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 717 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:14,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-10-11 03:17:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2024-10-11 03:17:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 571 states have (on average 1.415061295971979) internal successors, (808), 574 states have internal predecessors, (808), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1056 transitions. [2024-10-11 03:17:14,397 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1056 transitions. Word has length 69 [2024-10-11 03:17:14,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:14,398 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1056 transitions. [2024-10-11 03:17:14,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 03:17:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1056 transitions. [2024-10-11 03:17:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:17:14,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:14,400 INFO L215 NwaCegarLoop]: trace histogram [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-11 03:17:14,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:17:14,401 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:14,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:14,401 INFO L85 PathProgramCache]: Analyzing trace with hash -625847890, now seen corresponding path program 1 times [2024-10-11 03:17:14,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:14,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156975796] [2024-10-11 03:17:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:14,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:14,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:14,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156975796] [2024-10-11 03:17:14,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156975796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:14,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:14,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:14,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433477552] [2024-10-11 03:17:14,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:14,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:14,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:14,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:14,609 INFO L87 Difference]: Start difference. First operand 749 states and 1056 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 03:17:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:14,710 INFO L93 Difference]: Finished difference Result 1417 states and 2018 transitions. [2024-10-11 03:17:14,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:14,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2024-10-11 03:17:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:14,716 INFO L225 Difference]: With dead ends: 1417 [2024-10-11 03:17:14,716 INFO L226 Difference]: Without dead ends: 773 [2024-10-11 03:17:14,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-11 03:17:14,720 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 5 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:14,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 729 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-11 03:17:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2024-10-11 03:17:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 591 states have (on average 1.401015228426396) internal successors, (828), 594 states have internal predecessors, (828), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-11 03:17:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1076 transitions. [2024-10-11 03:17:14,780 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1076 transitions. Word has length 77 [2024-10-11 03:17:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:14,780 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1076 transitions. [2024-10-11 03:17:14,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 03:17:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1076 transitions. [2024-10-11 03:17:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:17:14,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:14,782 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:14,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:17:14,782 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:14,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1657714599, now seen corresponding path program 1 times [2024-10-11 03:17:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:14,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597085711] [2024-10-11 03:17:14,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:14,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:17:15,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597085711] [2024-10-11 03:17:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597085711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:15,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:15,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586131340] [2024-10-11 03:17:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:15,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:15,401 INFO L87 Difference]: Start difference. First operand 773 states and 1076 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:17:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:15,756 INFO L93 Difference]: Finished difference Result 2001 states and 2771 transitions. [2024-10-11 03:17:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:15,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-11 03:17:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:15,765 INFO L225 Difference]: With dead ends: 2001 [2024-10-11 03:17:15,765 INFO L226 Difference]: Without dead ends: 1333 [2024-10-11 03:17:15,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:17:15,768 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 194 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:15,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1410 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:17:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-10-11 03:17:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1049. [2024-10-11 03:17:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 794 states have (on average 1.3879093198992443) internal successors, (1102), 799 states have internal predecessors, (1102), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-11 03:17:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1446 transitions. [2024-10-11 03:17:15,855 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1446 transitions. Word has length 80 [2024-10-11 03:17:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:15,855 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1446 transitions. [2024-10-11 03:17:15,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:17:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1446 transitions. [2024-10-11 03:17:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 03:17:15,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:15,857 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:15,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:17:15,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:15,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:15,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1049989745, now seen corresponding path program 1 times [2024-10-11 03:17:15,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:15,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235257588] [2024-10-11 03:17:15,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:15,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:17:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:17:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:16,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235257588] [2024-10-11 03:17:16,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235257588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:16,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:16,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:16,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269034473] [2024-10-11 03:17:16,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:16,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:16,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:16,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:16,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:16,052 INFO L87 Difference]: Start difference. First operand 1049 states and 1446 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 03:17:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:16,193 INFO L93 Difference]: Finished difference Result 1957 states and 2718 transitions. [2024-10-11 03:17:16,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:16,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-11 03:17:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:16,201 INFO L225 Difference]: With dead ends: 1957 [2024-10-11 03:17:16,201 INFO L226 Difference]: Without dead ends: 1073 [2024-10-11 03:17:16,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-11 03:17:16,204 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 3 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:16,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 727 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-10-11 03:17:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2024-10-11 03:17:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 812 states have (on average 1.3793103448275863) internal successors, (1120), 817 states have internal predecessors, (1120), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-11 03:17:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1464 transitions. [2024-10-11 03:17:16,304 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1464 transitions. Word has length 84 [2024-10-11 03:17:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:16,305 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1464 transitions. [2024-10-11 03:17:16,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 03:17:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1464 transitions. [2024-10-11 03:17:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 03:17:16,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:16,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:16,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:17:16,308 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:16,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash 880976071, now seen corresponding path program 1 times [2024-10-11 03:17:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:16,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838853030] [2024-10-11 03:17:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 03:17:16,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:16,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838853030] [2024-10-11 03:17:16,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838853030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:16,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:16,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:17:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799837839] [2024-10-11 03:17:16,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:17:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:17:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:17:16,633 INFO L87 Difference]: Start difference. First operand 1073 states and 1464 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:17:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:16,856 INFO L93 Difference]: Finished difference Result 1489 states and 2140 transitions. [2024-10-11 03:17:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:16,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2024-10-11 03:17:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:16,868 INFO L225 Difference]: With dead ends: 1489 [2024-10-11 03:17:16,868 INFO L226 Difference]: Without dead ends: 1487 [2024-10-11 03:17:16,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:17:16,871 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 131 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:16,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 2794 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2024-10-11 03:17:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1081. [2024-10-11 03:17:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 816 states have (on average 1.3774509803921569) internal successors, (1124), 823 states have internal predecessors, (1124), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-11 03:17:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1472 transitions. [2024-10-11 03:17:16,984 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1472 transitions. Word has length 83 [2024-10-11 03:17:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:16,985 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1472 transitions. [2024-10-11 03:17:16,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:17:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1472 transitions. [2024-10-11 03:17:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 03:17:16,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:16,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:16,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:17:16,988 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:16,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash 600868425, now seen corresponding path program 1 times [2024-10-11 03:17:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661173597] [2024-10-11 03:17:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:17:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661173597] [2024-10-11 03:17:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661173597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:17,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:17,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243138374] [2024-10-11 03:17:17,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:17,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:17,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:17,173 INFO L87 Difference]: Start difference. First operand 1081 states and 1472 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:17:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:17,411 INFO L93 Difference]: Finished difference Result 1951 states and 2667 transitions. [2024-10-11 03:17:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:17,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2024-10-11 03:17:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:17,419 INFO L225 Difference]: With dead ends: 1951 [2024-10-11 03:17:17,420 INFO L226 Difference]: Without dead ends: 1117 [2024-10-11 03:17:17,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:17:17,424 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 245 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:17,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1427 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-10-11 03:17:17,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1075. [2024-10-11 03:17:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 821 states have (on average 1.371498172959805) internal successors, (1126), 833 states have internal predecessors, (1126), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2024-10-11 03:17:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1450 transitions. [2024-10-11 03:17:17,519 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1450 transitions. Word has length 86 [2024-10-11 03:17:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:17,520 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1450 transitions. [2024-10-11 03:17:17,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:17:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1450 transitions. [2024-10-11 03:17:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 03:17:17,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:17,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:17,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:17:17,522 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:17,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1743472577, now seen corresponding path program 1 times [2024-10-11 03:17:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:17,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675556809] [2024-10-11 03:17:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:17,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 03:17:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 03:17:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675556809] [2024-10-11 03:17:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675556809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:18,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:18,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:18,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961616108] [2024-10-11 03:17:18,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:18,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:18,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:18,091 INFO L87 Difference]: Start difference. First operand 1075 states and 1450 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:17:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:18,397 INFO L93 Difference]: Finished difference Result 1919 states and 2599 transitions. [2024-10-11 03:17:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:18,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 88 [2024-10-11 03:17:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:18,405 INFO L225 Difference]: With dead ends: 1919 [2024-10-11 03:17:18,406 INFO L226 Difference]: Without dead ends: 1071 [2024-10-11 03:17:18,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:17:18,410 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 146 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:18,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1519 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-11 03:17:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 967. [2024-10-11 03:17:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 740 states have (on average 1.3756756756756756) internal successors, (1018), 750 states have internal predecessors, (1018), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-11 03:17:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1308 transitions. [2024-10-11 03:17:18,523 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1308 transitions. Word has length 88 [2024-10-11 03:17:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:18,524 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1308 transitions. [2024-10-11 03:17:18,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:17:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1308 transitions. [2024-10-11 03:17:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:17:18,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:18,526 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:18,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:17:18,526 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:18,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:18,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1697658043, now seen corresponding path program 1 times [2024-10-11 03:17:18,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:18,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196777848] [2024-10-11 03:17:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:17:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:17:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 03:17:19,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:19,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196777848] [2024-10-11 03:17:19,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196777848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:19,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:19,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:17:19,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554108455] [2024-10-11 03:17:19,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:19,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:17:19,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:19,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:17:19,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:17:19,115 INFO L87 Difference]: Start difference. First operand 967 states and 1308 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 03:17:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:19,617 INFO L93 Difference]: Finished difference Result 1852 states and 2488 transitions. [2024-10-11 03:17:19,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:19,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 89 [2024-10-11 03:17:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:19,624 INFO L225 Difference]: With dead ends: 1852 [2024-10-11 03:17:19,625 INFO L226 Difference]: Without dead ends: 1031 [2024-10-11 03:17:19,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:17:19,628 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 535 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:19,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1182 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:17:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-10-11 03:17:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 983. [2024-10-11 03:17:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 748 states have (on average 1.3516042780748663) internal successors, (1011), 759 states have internal predecessors, (1011), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-11 03:17:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1307 transitions. [2024-10-11 03:17:19,729 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1307 transitions. Word has length 89 [2024-10-11 03:17:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:19,730 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1307 transitions. [2024-10-11 03:17:19,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 03:17:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1307 transitions. [2024-10-11 03:17:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:17:19,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:19,732 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:19,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:17:19,732 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:19,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:19,732 INFO L85 PathProgramCache]: Analyzing trace with hash -934830644, now seen corresponding path program 1 times [2024-10-11 03:17:19,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:19,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406274473] [2024-10-11 03:17:19,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:19,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 03:17:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 03:17:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 03:17:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 03:17:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:19,866 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-11 03:17:19,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:19,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406274473] [2024-10-11 03:17:19,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406274473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:19,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:19,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:19,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572428895] [2024-10-11 03:17:19,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:19,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:19,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:19,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:19,869 INFO L87 Difference]: Start difference. First operand 983 states and 1307 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:20,108 INFO L93 Difference]: Finished difference Result 2606 states and 3483 transitions. [2024-10-11 03:17:20,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:20,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2024-10-11 03:17:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:20,120 INFO L225 Difference]: With dead ends: 2606 [2024-10-11 03:17:20,120 INFO L226 Difference]: Without dead ends: 1820 [2024-10-11 03:17:20,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-11 03:17:20,124 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 198 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:20,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1099 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2024-10-11 03:17:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1711. [2024-10-11 03:17:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1286 states have (on average 1.3413685847589425) internal successors, (1725), 1305 states have internal predecessors, (1725), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2024-10-11 03:17:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2269 transitions. [2024-10-11 03:17:20,325 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2269 transitions. Word has length 90 [2024-10-11 03:17:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:20,326 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2269 transitions. [2024-10-11 03:17:20,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2269 transitions. [2024-10-11 03:17:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:17:20,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:20,328 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:20,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:17:20,328 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:20,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:20,328 INFO L85 PathProgramCache]: Analyzing trace with hash -102190207, now seen corresponding path program 1 times [2024-10-11 03:17:20,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:20,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502291445] [2024-10-11 03:17:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:20,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 03:17:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 03:17:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 03:17:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 03:17:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 03:17:20,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:20,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502291445] [2024-10-11 03:17:20,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502291445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:20,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:20,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:20,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104953609] [2024-10-11 03:17:20,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:20,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:20,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:20,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:20,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:20,793 INFO L87 Difference]: Start difference. First operand 1711 states and 2269 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:21,549 INFO L93 Difference]: Finished difference Result 3342 states and 4426 transitions. [2024-10-11 03:17:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:21,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2024-10-11 03:17:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:21,561 INFO L225 Difference]: With dead ends: 3342 [2024-10-11 03:17:21,562 INFO L226 Difference]: Without dead ends: 1904 [2024-10-11 03:17:21,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:17:21,566 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 481 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:21,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1360 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:17:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2024-10-11 03:17:21,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1738. [2024-10-11 03:17:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1300 states have (on average 1.3346153846153845) internal successors, (1735), 1320 states have internal predecessors, (1735), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2024-10-11 03:17:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2295 transitions. [2024-10-11 03:17:21,800 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2295 transitions. Word has length 92 [2024-10-11 03:17:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:21,801 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2295 transitions. [2024-10-11 03:17:21,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2295 transitions. [2024-10-11 03:17:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:17:21,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:21,803 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:21,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:17:21,803 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:21,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash -499793690, now seen corresponding path program 1 times [2024-10-11 03:17:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:21,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057072448] [2024-10-11 03:17:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:21,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:17:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:21,925 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-11 03:17:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057072448] [2024-10-11 03:17:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057072448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:21,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:21,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530124442] [2024-10-11 03:17:21,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:21,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:21,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:21,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:21,928 INFO L87 Difference]: Start difference. First operand 1738 states and 2295 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:22,336 INFO L93 Difference]: Finished difference Result 4424 states and 5873 transitions. [2024-10-11 03:17:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:22,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-11 03:17:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:22,355 INFO L225 Difference]: With dead ends: 4424 [2024-10-11 03:17:22,356 INFO L226 Difference]: Without dead ends: 3002 [2024-10-11 03:17:22,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-11 03:17:22,361 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 203 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:22,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1135 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2024-10-11 03:17:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 2749. [2024-10-11 03:17:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2749 states, 2036 states have (on average 1.3222003929273085) internal successors, (2692), 2067 states have internal predecessors, (2692), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2024-10-11 03:17:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 3612 transitions. [2024-10-11 03:17:22,700 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 3612 transitions. Word has length 94 [2024-10-11 03:17:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:22,700 INFO L471 AbstractCegarLoop]: Abstraction has 2749 states and 3612 transitions. [2024-10-11 03:17:22,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 3612 transitions. [2024-10-11 03:17:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:17:22,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:22,703 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:22,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:17:22,703 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:22,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1287109644, now seen corresponding path program 1 times [2024-10-11 03:17:22,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119247468] [2024-10-11 03:17:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:17:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 03:17:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:17:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 03:17:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 03:17:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 03:17:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,866 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-11 03:17:22,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:22,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119247468] [2024-10-11 03:17:22,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119247468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:22,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:22,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:22,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169554283] [2024-10-11 03:17:22,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:22,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:22,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:22,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:22,869 INFO L87 Difference]: Start difference. First operand 2749 states and 3612 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:23,464 INFO L93 Difference]: Finished difference Result 6439 states and 8497 transitions. [2024-10-11 03:17:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:23,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-11 03:17:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:23,493 INFO L225 Difference]: With dead ends: 6439 [2024-10-11 03:17:23,494 INFO L226 Difference]: Without dead ends: 4122 [2024-10-11 03:17:23,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-11 03:17:23,504 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 197 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:23,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1151 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4122 states. [2024-10-11 03:17:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4122 to 3947. [2024-10-11 03:17:24,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 2910 states have (on average 1.3175257731958763) internal successors, (3834), 2954 states have internal predecessors, (3834), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-11 03:17:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 5178 transitions. [2024-10-11 03:17:24,132 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 5178 transitions. Word has length 94 [2024-10-11 03:17:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:24,132 INFO L471 AbstractCegarLoop]: Abstraction has 3947 states and 5178 transitions. [2024-10-11 03:17:24,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 5178 transitions. [2024-10-11 03:17:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:17:24,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:24,136 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:24,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:17:24,136 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:24,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:24,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1710634141, now seen corresponding path program 1 times [2024-10-11 03:17:24,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:24,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819049986] [2024-10-11 03:17:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:24,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:24,212 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-11 03:17:24,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:24,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819049986] [2024-10-11 03:17:24,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819049986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:24,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:24,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798175739] [2024-10-11 03:17:24,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:24,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:24,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:24,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:24,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:24,215 INFO L87 Difference]: Start difference. First operand 3947 states and 5178 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:24,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:24,673 INFO L93 Difference]: Finished difference Result 7595 states and 10009 transitions. [2024-10-11 03:17:24,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:24,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2024-10-11 03:17:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:24,714 INFO L225 Difference]: With dead ends: 7595 [2024-10-11 03:17:24,715 INFO L226 Difference]: Without dead ends: 3980 [2024-10-11 03:17:24,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:24,729 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 6 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:24,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 466 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2024-10-11 03:17:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3953. [2024-10-11 03:17:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3953 states, 2916 states have (on average 1.316872427983539) internal successors, (3840), 2960 states have internal predecessors, (3840), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-11 03:17:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5184 transitions. [2024-10-11 03:17:25,215 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5184 transitions. Word has length 95 [2024-10-11 03:17:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:25,215 INFO L471 AbstractCegarLoop]: Abstraction has 3953 states and 5184 transitions. [2024-10-11 03:17:25,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5184 transitions. [2024-10-11 03:17:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:17:25,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:25,218 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:25,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:17:25,219 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:25,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:25,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1976702663, now seen corresponding path program 1 times [2024-10-11 03:17:25,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907133942] [2024-10-11 03:17:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:25,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:17:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 03:17:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:17:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 03:17:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 03:17:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 03:17:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:25,387 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-11 03:17:25,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907133942] [2024-10-11 03:17:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907133942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:25,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:25,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013833906] [2024-10-11 03:17:25,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:25,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:25,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:25,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:25,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:25,390 INFO L87 Difference]: Start difference. First operand 3953 states and 5184 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:25,827 INFO L93 Difference]: Finished difference Result 7561 states and 9937 transitions. [2024-10-11 03:17:25,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:25,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2024-10-11 03:17:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:25,862 INFO L225 Difference]: With dead ends: 7561 [2024-10-11 03:17:25,863 INFO L226 Difference]: Without dead ends: 3674 [2024-10-11 03:17:25,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-11 03:17:25,876 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 78 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:25,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 714 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2024-10-11 03:17:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3611. [2024-10-11 03:17:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 2657 states have (on average 1.3266842303349642) internal successors, (3525), 2691 states have internal predecessors, (3525), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-11 03:17:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 4765 transitions. [2024-10-11 03:17:26,362 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 4765 transitions. Word has length 96 [2024-10-11 03:17:26,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:26,363 INFO L471 AbstractCegarLoop]: Abstraction has 3611 states and 4765 transitions. [2024-10-11 03:17:26,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 4765 transitions. [2024-10-11 03:17:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:17:26,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:26,365 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:26,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:17:26,366 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:26,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:26,366 INFO L85 PathProgramCache]: Analyzing trace with hash 378932519, now seen corresponding path program 1 times [2024-10-11 03:17:26,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:26,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174946692] [2024-10-11 03:17:26,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:26,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,469 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-11 03:17:26,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:26,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174946692] [2024-10-11 03:17:26,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174946692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:26,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:26,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218662818] [2024-10-11 03:17:26,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:26,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:26,472 INFO L87 Difference]: Start difference. First operand 3611 states and 4765 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:27,111 INFO L93 Difference]: Finished difference Result 7104 states and 9412 transitions. [2024-10-11 03:17:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:27,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-10-11 03:17:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:27,136 INFO L225 Difference]: With dead ends: 7104 [2024-10-11 03:17:27,136 INFO L226 Difference]: Without dead ends: 3662 [2024-10-11 03:17:27,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:27,150 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 6 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:27,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 468 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2024-10-11 03:17:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3621. [2024-10-11 03:17:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 2667 states have (on average 1.3254593175853018) internal successors, (3535), 2701 states have internal predecessors, (3535), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-11 03:17:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4775 transitions. [2024-10-11 03:17:27,654 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4775 transitions. Word has length 97 [2024-10-11 03:17:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:27,654 INFO L471 AbstractCegarLoop]: Abstraction has 3621 states and 4775 transitions. [2024-10-11 03:17:27,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4775 transitions. [2024-10-11 03:17:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:17:27,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:27,657 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:27,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:17:27,657 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:27,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:27,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1703690164, now seen corresponding path program 1 times [2024-10-11 03:17:27,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:27,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101916972] [2024-10-11 03:17:27,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:27,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:27,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:27,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:27,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:27,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:27,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:27,792 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-11 03:17:27,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:27,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101916972] [2024-10-11 03:17:27,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101916972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:27,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:27,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:27,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112122038] [2024-10-11 03:17:27,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:27,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:27,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:27,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:27,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:27,795 INFO L87 Difference]: Start difference. First operand 3621 states and 4775 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:28,149 INFO L93 Difference]: Finished difference Result 7054 states and 9322 transitions. [2024-10-11 03:17:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:28,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-10-11 03:17:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:28,167 INFO L225 Difference]: With dead ends: 7054 [2024-10-11 03:17:28,167 INFO L226 Difference]: Without dead ends: 3542 [2024-10-11 03:17:28,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-11 03:17:28,178 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 60 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:28,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 719 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3542 states. [2024-10-11 03:17:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3542 to 2731. [2024-10-11 03:17:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 2011 states have (on average 1.3197414221780208) internal successors, (2654), 2030 states have internal predecessors, (2654), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2024-10-11 03:17:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 3592 transitions. [2024-10-11 03:17:28,489 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 3592 transitions. Word has length 97 [2024-10-11 03:17:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:28,489 INFO L471 AbstractCegarLoop]: Abstraction has 2731 states and 3592 transitions. [2024-10-11 03:17:28,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:17:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3592 transitions. [2024-10-11 03:17:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 03:17:28,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:28,494 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2024-10-11 03:17:28,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:17:28,495 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:28,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1951005918, now seen corresponding path program 1 times [2024-10-11 03:17:28,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:28,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327987991] [2024-10-11 03:17:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 03:17:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 03:17:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 03:17:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:17:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 03:17:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 03:17:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 03:17:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:28,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:28,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327987991] [2024-10-11 03:17:28,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327987991] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:28,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079533345] [2024-10-11 03:17:28,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:28,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:28,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:28,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:28,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:17:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:29,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 03:17:29,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:29,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079533345] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:29,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:29,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2024-10-11 03:17:29,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556161072] [2024-10-11 03:17:29,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:29,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 03:17:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 03:17:29,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:17:29,818 INFO L87 Difference]: Start difference. First operand 2731 states and 3592 transitions. Second operand has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 20 states have internal predecessors, (224), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-11 03:17:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:34,903 INFO L93 Difference]: Finished difference Result 11347 states and 14844 transitions. [2024-10-11 03:17:34,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-11 03:17:34,903 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 20 states have internal predecessors, (224), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 141 [2024-10-11 03:17:34,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:34,942 INFO L225 Difference]: With dead ends: 11347 [2024-10-11 03:17:34,942 INFO L226 Difference]: Without dead ends: 8827 [2024-10-11 03:17:34,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1180, Invalid=5300, Unknown=0, NotChecked=0, Total=6480 [2024-10-11 03:17:34,955 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 4528 mSDsluCounter, 3185 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 1747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4528 SdHoareTripleChecker+Valid, 3529 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1747 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:34,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4528 Valid, 3529 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1747 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 03:17:34,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8827 states. [2024-10-11 03:17:36,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8827 to 7351. [2024-10-11 03:17:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7351 states, 5394 states have (on average 1.307378568780126) internal successors, (7052), 5446 states have internal predecessors, (7052), 1259 states have call successors, (1259), 697 states have call predecessors, (1259), 697 states have return successors, (1259), 1207 states have call predecessors, (1259), 1259 states have call successors, (1259) [2024-10-11 03:17:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7351 states to 7351 states and 9570 transitions. [2024-10-11 03:17:36,261 INFO L78 Accepts]: Start accepts. Automaton has 7351 states and 9570 transitions. Word has length 141 [2024-10-11 03:17:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:36,262 INFO L471 AbstractCegarLoop]: Abstraction has 7351 states and 9570 transitions. [2024-10-11 03:17:36,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 20 states have internal predecessors, (224), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-11 03:17:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 7351 states and 9570 transitions. [2024-10-11 03:17:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 03:17:36,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:36,275 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2024-10-11 03:17:36,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:17:36,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 03:17:36,481 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:36,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:36,482 INFO L85 PathProgramCache]: Analyzing trace with hash 842191154, now seen corresponding path program 1 times [2024-10-11 03:17:36,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:36,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297003944] [2024-10-11 03:17:36,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:36,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:17:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 03:17:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:17:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:17:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 03:17:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 03:17:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-11 03:17:36,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297003944] [2024-10-11 03:17:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297003944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:36,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:36,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:36,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536357978] [2024-10-11 03:17:36,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:36,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:36,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:36,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:36,711 INFO L87 Difference]: Start difference. First operand 7351 states and 9570 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 03:17:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:38,375 INFO L93 Difference]: Finished difference Result 21341 states and 27894 transitions. [2024-10-11 03:17:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:38,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 144 [2024-10-11 03:17:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:38,488 INFO L225 Difference]: With dead ends: 21341 [2024-10-11 03:17:38,488 INFO L226 Difference]: Without dead ends: 14462 [2024-10-11 03:17:38,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:17:38,517 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 220 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:38,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 2085 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14462 states. [2024-10-11 03:17:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14462 to 12182. [2024-10-11 03:17:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12182 states, 8861 states have (on average 1.3053831396004965) internal successors, (11567), 8951 states have internal predecessors, (11567), 2161 states have call successors, (2161), 1159 states have call predecessors, (2161), 1159 states have return successors, (2161), 2071 states have call predecessors, (2161), 2161 states have call successors, (2161) [2024-10-11 03:17:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12182 states to 12182 states and 15889 transitions. [2024-10-11 03:17:40,320 INFO L78 Accepts]: Start accepts. Automaton has 12182 states and 15889 transitions. Word has length 144 [2024-10-11 03:17:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:40,321 INFO L471 AbstractCegarLoop]: Abstraction has 12182 states and 15889 transitions. [2024-10-11 03:17:40,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 03:17:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 12182 states and 15889 transitions. [2024-10-11 03:17:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 03:17:40,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:40,343 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 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, 1, 1, 1, 1, 1] [2024-10-11 03:17:40,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:17:40,343 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:40,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:40,344 INFO L85 PathProgramCache]: Analyzing trace with hash -324076978, now seen corresponding path program 1 times [2024-10-11 03:17:40,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:40,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191323702] [2024-10-11 03:17:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 03:17:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:17:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 03:17:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 03:17:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:17:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:17:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 03:17:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 03:17:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 03:17:41,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:41,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191323702] [2024-10-11 03:17:41,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191323702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:41,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911082498] [2024-10-11 03:17:41,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:41,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:41,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:41,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:41,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:17:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 03:17:41,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:41,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 03:17:42,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911082498] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:42,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 03:17:42,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 11] total 25 [2024-10-11 03:17:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301444624] [2024-10-11 03:17:42,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:42,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:17:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:17:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:17:42,053 INFO L87 Difference]: Start difference. First operand 12182 states and 15889 transitions. Second operand has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 03:17:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:43,902 INFO L93 Difference]: Finished difference Result 23958 states and 31274 transitions. [2024-10-11 03:17:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:17:43,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 144 [2024-10-11 03:17:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:43,976 INFO L225 Difference]: With dead ends: 23958 [2024-10-11 03:17:43,977 INFO L226 Difference]: Without dead ends: 12248 [2024-10-11 03:17:44,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:17:44,013 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 375 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:44,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1430 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:17:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12248 states. [2024-10-11 03:17:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12248 to 8292. [2024-10-11 03:17:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8292 states, 6065 states have (on average 1.3103050288540807) internal successors, (7947), 6120 states have internal predecessors, (7947), 1444 states have call successors, (1444), 782 states have call predecessors, (1444), 782 states have return successors, (1444), 1389 states have call predecessors, (1444), 1444 states have call successors, (1444) [2024-10-11 03:17:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8292 states to 8292 states and 10835 transitions. [2024-10-11 03:17:45,097 INFO L78 Accepts]: Start accepts. Automaton has 8292 states and 10835 transitions. Word has length 144 [2024-10-11 03:17:45,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:45,098 INFO L471 AbstractCegarLoop]: Abstraction has 8292 states and 10835 transitions. [2024-10-11 03:17:45,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 03:17:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8292 states and 10835 transitions. [2024-10-11 03:17:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 03:17:45,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:45,113 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2024-10-11 03:17:45,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:17:45,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:45,318 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:45,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1929303907, now seen corresponding path program 1 times [2024-10-11 03:17:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:45,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910981233] [2024-10-11 03:17:45,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:45,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 03:17:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:17:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:17:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 03:17:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 03:17:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:17:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 03:17:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 03:17:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:46,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:46,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910981233] [2024-10-11 03:17:46,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910981233] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:46,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060848763] [2024-10-11 03:17:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:46,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:46,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:46,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:46,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:17:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:46,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 03:17:46,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:46,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 03:17:47,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060848763] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:47,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:47,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 26 [2024-10-11 03:17:47,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025275608] [2024-10-11 03:17:47,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:47,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 03:17:47,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:47,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 03:17:47,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:17:47,434 INFO L87 Difference]: Start difference. First operand 8292 states and 10835 transitions. Second operand has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 24 states have internal predecessors, (254), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-11 03:17:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:53,606 INFO L93 Difference]: Finished difference Result 19471 states and 25488 transitions. [2024-10-11 03:17:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-11 03:17:53,607 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 24 states have internal predecessors, (254), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) Word has length 145 [2024-10-11 03:17:53,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:53,680 INFO L225 Difference]: With dead ends: 19471 [2024-10-11 03:17:53,681 INFO L226 Difference]: Without dead ends: 11391 [2024-10-11 03:17:53,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1058, Invalid=4794, Unknown=0, NotChecked=0, Total=5852 [2024-10-11 03:17:53,708 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 2325 mSDsluCounter, 8744 mSDsCounter, 0 mSdLazyCounter, 4135 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2325 SdHoareTripleChecker+Valid, 9470 SdHoareTripleChecker+Invalid, 4899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 4135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:53,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2325 Valid, 9470 Invalid, 4899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 4135 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 03:17:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11391 states. [2024-10-11 03:17:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11391 to 7638. [2024-10-11 03:17:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7638 states, 5611 states have (on average 1.304936731420424) internal successors, (7322), 5661 states have internal predecessors, (7322), 1315 states have call successors, (1315), 711 states have call predecessors, (1315), 711 states have return successors, (1315), 1265 states have call predecessors, (1315), 1315 states have call successors, (1315) [2024-10-11 03:17:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7638 states to 7638 states and 9952 transitions. [2024-10-11 03:17:54,820 INFO L78 Accepts]: Start accepts. Automaton has 7638 states and 9952 transitions. Word has length 145 [2024-10-11 03:17:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:54,820 INFO L471 AbstractCegarLoop]: Abstraction has 7638 states and 9952 transitions. [2024-10-11 03:17:54,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 24 states have internal predecessors, (254), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-11 03:17:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 7638 states and 9952 transitions. [2024-10-11 03:17:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 03:17:54,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:54,833 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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-11 03:17:54,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:17:55,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:55,034 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:55,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash 167604539, now seen corresponding path program 1 times [2024-10-11 03:17:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:55,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186745903] [2024-10-11 03:17:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:55,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 03:17:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 03:17:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 03:17:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:17:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 03:17:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 03:17:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 03:17:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-11 03:17:55,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186745903] [2024-10-11 03:17:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186745903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114626694] [2024-10-11 03:17:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:55,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:55,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:55,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:55,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:17:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:55,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 03:17:55,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 84 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:17:55,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-11 03:17:55,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114626694] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:55,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:55,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2024-10-11 03:17:55,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058052409] [2024-10-11 03:17:55,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:55,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:17:55,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:17:55,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:17:55,814 INFO L87 Difference]: Start difference. First operand 7638 states and 9952 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 9 states have internal predecessors, (132), 4 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-11 03:17:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:57,766 INFO L93 Difference]: Finished difference Result 20702 states and 26776 transitions. [2024-10-11 03:17:57,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:17:57,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 9 states have internal predecessors, (132), 4 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) Word has length 148 [2024-10-11 03:17:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:57,826 INFO L225 Difference]: With dead ends: 20702 [2024-10-11 03:17:57,826 INFO L226 Difference]: Without dead ends: 13382 [2024-10-11 03:17:57,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 320 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:17:57,846 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 356 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:57,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2055 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:17:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13382 states. [2024-10-11 03:17:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13382 to 11562. [2024-10-11 03:17:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11562 states, 8529 states have (on average 1.2910071520694102) internal successors, (11011), 8625 states have internal predecessors, (11011), 1943 states have call successors, (1943), 1089 states have call predecessors, (1943), 1089 states have return successors, (1943), 1847 states have call predecessors, (1943), 1943 states have call successors, (1943) [2024-10-11 03:17:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11562 states to 11562 states and 14897 transitions. [2024-10-11 03:17:59,543 INFO L78 Accepts]: Start accepts. Automaton has 11562 states and 14897 transitions. Word has length 148 [2024-10-11 03:17:59,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:59,543 INFO L471 AbstractCegarLoop]: Abstraction has 11562 states and 14897 transitions. [2024-10-11 03:17:59,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 9 states have internal predecessors, (132), 4 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-11 03:17:59,543 INFO L276 IsEmpty]: Start isEmpty. Operand 11562 states and 14897 transitions. [2024-10-11 03:17:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 03:17:59,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:59,554 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 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, 1, 1, 1, 1] [2024-10-11 03:17:59,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:17:59,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-11 03:17:59,755 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:59,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:59,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1132952258, now seen corresponding path program 1 times [2024-10-11 03:17:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:59,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662237116] [2024-10-11 03:17:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:18:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:18:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:18:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:18:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:18:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:18:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:18:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 03:18:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:18:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 03:18:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 03:18:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 03:18:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 03:18:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:18:00,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:00,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662237116] [2024-10-11 03:18:00,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662237116] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:00,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918722886] [2024-10-11 03:18:00,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:00,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:00,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:00,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:18:00,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:18:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:00,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 03:18:00,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:18:00,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:18:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:18:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918722886] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:18:01,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:18:01,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2024-10-11 03:18:01,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400595075] [2024-10-11 03:18:01,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:18:01,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:18:01,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:01,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:18:01,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:18:01,041 INFO L87 Difference]: Start difference. First operand 11562 states and 14897 transitions. Second operand has 23 states, 23 states have (on average 10.08695652173913) internal successors, (232), 22 states have internal predecessors, (232), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) [2024-10-11 03:18:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:08,070 INFO L93 Difference]: Finished difference Result 31023 states and 40139 transitions. [2024-10-11 03:18:08,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-10-11 03:18:08,071 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.08695652173913) internal successors, (232), 22 states have internal predecessors, (232), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) Word has length 147 [2024-10-11 03:18:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:08,177 INFO L225 Difference]: With dead ends: 31023 [2024-10-11 03:18:08,177 INFO L226 Difference]: Without dead ends: 20423 [2024-10-11 03:18:08,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8536 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2872, Invalid=20080, Unknown=0, NotChecked=0, Total=22952 [2024-10-11 03:18:08,216 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 2801 mSDsluCounter, 4518 mSDsCounter, 0 mSdLazyCounter, 2803 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2801 SdHoareTripleChecker+Valid, 5006 SdHoareTripleChecker+Invalid, 3712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 2803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:08,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2801 Valid, 5006 Invalid, 3712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 2803 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 03:18:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20423 states. [2024-10-11 03:18:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20423 to 18091. [2024-10-11 03:18:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18091 states, 13474 states have (on average 1.2796496957102568) internal successors, (17242), 13616 states have internal predecessors, (17242), 2925 states have call successors, (2925), 1691 states have call predecessors, (2925), 1691 states have return successors, (2925), 2783 states have call predecessors, (2925), 2925 states have call successors, (2925) [2024-10-11 03:18:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18091 states to 18091 states and 23092 transitions. [2024-10-11 03:18:11,300 INFO L78 Accepts]: Start accepts. Automaton has 18091 states and 23092 transitions. Word has length 147 [2024-10-11 03:18:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:11,300 INFO L471 AbstractCegarLoop]: Abstraction has 18091 states and 23092 transitions. [2024-10-11 03:18:11,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.08695652173913) internal successors, (232), 22 states have internal predecessors, (232), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) [2024-10-11 03:18:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 18091 states and 23092 transitions. [2024-10-11 03:18:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 03:18:11,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:11,321 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 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, 1, 1] [2024-10-11 03:18:11,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 03:18:11,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 03:18:11,522 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:11,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:11,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2093901675, now seen corresponding path program 1 times [2024-10-11 03:18:11,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:11,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494727812] [2024-10-11 03:18:11,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:11,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:18:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:18:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:18:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:18:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:18:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:18:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:18:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 03:18:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:18:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 03:18:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 03:18:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 03:18:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 03:18:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 03:18:12,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:12,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494727812] [2024-10-11 03:18:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494727812] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:12,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266735338] [2024-10-11 03:18:12,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:12,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:12,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:12,428 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:18:12,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:18:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:12,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 03:18:12,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 03:18:12,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:18:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-11 03:18:12,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266735338] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:18:12,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:18:12,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-10-11 03:18:12,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136585880] [2024-10-11 03:18:12,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:18:12,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 03:18:12,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:12,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 03:18:12,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:18:12,842 INFO L87 Difference]: Start difference. First operand 18091 states and 23092 transitions. Second operand has 15 states, 14 states have (on average 11.785714285714286) internal successors, (165), 12 states have internal predecessors, (165), 5 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 7 states have call predecessors, (32), 5 states have call successors, (32)