./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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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 a158f4486af48c98a7df56cba98940178e8617d42ff04ad885cda239ab95e10a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:45:25,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:45:25,399 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:45:25,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:45:25,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:45:25,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:45:25,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:45:25,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:45:25,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:45:25,441 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:45:25,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:45:25,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:45:25,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:45:25,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:45:25,445 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:45:25,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:45:25,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:45:25,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:45:25,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:45:25,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:45:25,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:45:25,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:45:25,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:45:25,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:45:25,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:45:25,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:45:25,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:45:25,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:45:25,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:45:25,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:45:25,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:45:25,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:45:25,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:45:25,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:45:25,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:45:25,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:45:25,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:45:25,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:45:25,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:45:25,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:45:25,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:45:25,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:45:25,456 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 -> a158f4486af48c98a7df56cba98940178e8617d42ff04ad885cda239ab95e10a [2024-10-11 03:45:25,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:45:25,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:45:25,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:45:25,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:45:25,754 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:45:25,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:45:27,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:45:27,349 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:45:27,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:45:27,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/98b1de867/e478eaa4acce47789f27057f0e911b16/FLAGecc8db52e [2024-10-11 03:45:27,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/98b1de867/e478eaa4acce47789f27057f0e911b16 [2024-10-11 03:45:27,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:45:27,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:45:27,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:45:27,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:45:27,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:45:27,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:27,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb638ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27, skipping insertion in model container [2024-10-11 03:45:27,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:27,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:45:27,697 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7119,7132] [2024-10-11 03:45:27,715 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9806,9819] [2024-10-11 03:45:27,721 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10897,10910] [2024-10-11 03:45:27,731 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11503,11516] [2024-10-11 03:45:27,740 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12922,12935] [2024-10-11 03:45:27,744 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13528,13541] [2024-10-11 03:45:27,749 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14457,14470] [2024-10-11 03:45:27,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:45:27,820 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:45:27,874 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7119,7132] [2024-10-11 03:45:27,886 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9806,9819] [2024-10-11 03:45:27,893 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10897,10910] [2024-10-11 03:45:27,897 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11503,11516] [2024-10-11 03:45:27,905 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12922,12935] [2024-10-11 03:45:27,937 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13528,13541] [2024-10-11 03:45:27,940 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-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14457,14470] [2024-10-11 03:45:27,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:45:27,981 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:45:27,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27 WrapperNode [2024-10-11 03:45:27,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:45:27,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:45:27,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:45:27,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:45:27,988 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:45:27" (1/1) ... [2024-10-11 03:45:28,005 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:45:27" (1/1) ... [2024-10-11 03:45:28,045 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1049 [2024-10-11 03:45:28,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:45:28,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:45:28,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:45:28,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:45:28,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:28,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:28,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:28,077 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:45:28,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:28,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:28,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:28,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:28,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:28,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:28,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:45:28,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:45:28,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:45:28,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:45:28,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27" (1/1) ... [2024-10-11 03:45:28,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:45:28,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:45:28,168 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:45:28,172 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:45:28,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:45:28,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:45:28,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:45:28,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:45:28,313 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:45:28,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:45:28,935 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-10-11 03:45:28,935 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:45:28,969 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:45:28,970 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:45:28,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:45:28 BoogieIcfgContainer [2024-10-11 03:45:28,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:45:28,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:45:28,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:45:28,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:45:28,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:45:27" (1/3) ... [2024-10-11 03:45:28,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4db9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:45:28, skipping insertion in model container [2024-10-11 03:45:28,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:45:27" (2/3) ... [2024-10-11 03:45:28,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4db9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:45:28, skipping insertion in model container [2024-10-11 03:45:28,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:45:28" (3/3) ... [2024-10-11 03:45:28,977 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:45:28,991 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:45:28,992 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 03:45:29,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:45:29,047 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;@7f4be8aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:45:29,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 03:45:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 196 states have (on average 1.8316326530612246) internal successors, (359), 203 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:29,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 03:45:29,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:29,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:29,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:29,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash -114756949, now seen corresponding path program 1 times [2024-10-11 03:45:29,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:29,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799413310] [2024-10-11 03:45:29,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:29,530 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:45:29,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:29,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799413310] [2024-10-11 03:45:29,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799413310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:29,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:29,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:45:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790911521] [2024-10-11 03:45:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:29,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:29,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:29,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:29,568 INFO L87 Difference]: Start difference. First operand has 204 states, 196 states have (on average 1.8316326530612246) internal successors, (359), 203 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:29,913 INFO L93 Difference]: Finished difference Result 333 states and 563 transitions. [2024-10-11 03:45:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:29,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-11 03:45:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:29,929 INFO L225 Difference]: With dead ends: 333 [2024-10-11 03:45:29,929 INFO L226 Difference]: Without dead ends: 182 [2024-10-11 03:45:29,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:45:29,937 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 849 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:29,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 238 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:45:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-11 03:45:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-10-11 03:45:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 175 states have (on average 1.28) internal successors, (224), 181 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2024-10-11 03:45:29,995 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 45 [2024-10-11 03:45:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:29,995 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2024-10-11 03:45:29,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2024-10-11 03:45:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 03:45:29,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:29,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:29,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:45:29,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:30,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1679415330, now seen corresponding path program 1 times [2024-10-11 03:45:30,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:30,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597293523] [2024-10-11 03:45:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:30,223 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:45:30,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597293523] [2024-10-11 03:45:30,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597293523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:30,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:30,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:45:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201466836] [2024-10-11 03:45:30,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:30,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:30,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:30,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:30,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:30,227 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:30,359 INFO L93 Difference]: Finished difference Result 305 states and 386 transitions. [2024-10-11 03:45:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:30,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-11 03:45:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:30,361 INFO L225 Difference]: With dead ends: 305 [2024-10-11 03:45:30,361 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 03:45:30,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:45:30,363 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 577 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:30,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 132 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 03:45:30,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-11 03:45:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 165 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 205 transitions. [2024-10-11 03:45:30,372 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 205 transitions. Word has length 46 [2024-10-11 03:45:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:30,373 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 205 transitions. [2024-10-11 03:45:30,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 205 transitions. [2024-10-11 03:45:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 03:45:30,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:30,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:30,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:45:30,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:30,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:30,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1480679436, now seen corresponding path program 1 times [2024-10-11 03:45:30,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:30,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673686648] [2024-10-11 03:45:30,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:30,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:30,576 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:45:30,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:30,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673686648] [2024-10-11 03:45:30,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673686648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:30,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:30,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:45:30,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082585670] [2024-10-11 03:45:30,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:30,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:30,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:30,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:30,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:30,579 INFO L87 Difference]: Start difference. First operand 166 states and 205 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:30,732 INFO L93 Difference]: Finished difference Result 373 states and 478 transitions. [2024-10-11 03:45:30,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:30,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-11 03:45:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:30,734 INFO L225 Difference]: With dead ends: 373 [2024-10-11 03:45:30,737 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 03:45:30,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:45:30,738 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 771 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:30,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 189 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 03:45:30,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2024-10-11 03:45:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 214 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2024-10-11 03:45:30,759 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 47 [2024-10-11 03:45:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:30,760 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2024-10-11 03:45:30,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2024-10-11 03:45:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:45:30,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:30,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:30,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:45:30,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:30,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:30,763 INFO L85 PathProgramCache]: Analyzing trace with hash -990553041, now seen corresponding path program 1 times [2024-10-11 03:45:30,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:30,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951872121] [2024-10-11 03:45:30,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:30,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:31,078 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:45:31,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951872121] [2024-10-11 03:45:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951872121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:31,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:31,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:45:31,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826240379] [2024-10-11 03:45:31,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:31,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:45:31,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:31,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:45:31,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:45:31,084 INFO L87 Difference]: Start difference. First operand 215 states and 281 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:31,421 INFO L93 Difference]: Finished difference Result 358 states and 474 transitions. [2024-10-11 03:45:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:45:31,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-11 03:45:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:31,423 INFO L225 Difference]: With dead ends: 358 [2024-10-11 03:45:31,423 INFO L226 Difference]: Without dead ends: 353 [2024-10-11 03:45:31,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:45:31,426 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 587 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:31,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 618 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-11 03:45:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 215. [2024-10-11 03:45:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3461538461538463) internal successors, (280), 214 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 280 transitions. [2024-10-11 03:45:31,444 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 280 transitions. Word has length 48 [2024-10-11 03:45:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:31,444 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 280 transitions. [2024-10-11 03:45:31,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 280 transitions. [2024-10-11 03:45:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:45:31,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:31,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:31,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:45:31,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:31,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash 921644061, now seen corresponding path program 1 times [2024-10-11 03:45:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:31,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406745721] [2024-10-11 03:45:31,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:31,609 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:45:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406745721] [2024-10-11 03:45:31,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406745721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:31,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:31,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:45:31,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906249732] [2024-10-11 03:45:31,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:31,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:45:31,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:31,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:45:31,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:45:31,613 INFO L87 Difference]: Start difference. First operand 215 states and 280 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:31,843 INFO L93 Difference]: Finished difference Result 403 states and 541 transitions. [2024-10-11 03:45:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:45:31,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-11 03:45:31,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:31,845 INFO L225 Difference]: With dead ends: 403 [2024-10-11 03:45:31,845 INFO L226 Difference]: Without dead ends: 302 [2024-10-11 03:45:31,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:45:31,847 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 553 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:31,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 491 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-11 03:45:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 215. [2024-10-11 03:45:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 214 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2024-10-11 03:45:31,858 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 48 [2024-10-11 03:45:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:31,859 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2024-10-11 03:45:31,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2024-10-11 03:45:31,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:45:31,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:31,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:31,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:45:31,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:31,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash -528561187, now seen corresponding path program 1 times [2024-10-11 03:45:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:31,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937573438] [2024-10-11 03:45:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:32,112 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:45:32,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:32,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937573438] [2024-10-11 03:45:32,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937573438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:32,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:32,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:45:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375739848] [2024-10-11 03:45:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:32,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:45:32,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:45:32,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:45:32,115 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:32,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:32,411 INFO L93 Difference]: Finished difference Result 459 states and 614 transitions. [2024-10-11 03:45:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:45:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-11 03:45:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:32,416 INFO L225 Difference]: With dead ends: 459 [2024-10-11 03:45:32,417 INFO L226 Difference]: Without dead ends: 335 [2024-10-11 03:45:32,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:45:32,418 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 525 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:32,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 515 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:45:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-11 03:45:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2024-10-11 03:45:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 214 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 278 transitions. [2024-10-11 03:45:32,429 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 278 transitions. Word has length 48 [2024-10-11 03:45:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:32,430 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 278 transitions. [2024-10-11 03:45:32,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 278 transitions. [2024-10-11 03:45:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:45:32,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:32,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:32,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:45:32,434 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:32,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1923049146, now seen corresponding path program 1 times [2024-10-11 03:45:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901579737] [2024-10-11 03:45:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:32,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:33,189 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:45:33,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:33,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901579737] [2024-10-11 03:45:33,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901579737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:33,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:33,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:45:33,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139856868] [2024-10-11 03:45:33,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:33,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:45:33,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:33,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:45:33,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:45:33,192 INFO L87 Difference]: Start difference. First operand 215 states and 278 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:33,880 INFO L93 Difference]: Finished difference Result 575 states and 773 transitions. [2024-10-11 03:45:33,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:45:33,881 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 03:45:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:33,883 INFO L225 Difference]: With dead ends: 575 [2024-10-11 03:45:33,883 INFO L226 Difference]: Without dead ends: 571 [2024-10-11 03:45:33,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:45:33,884 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 988 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:33,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 1734 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:45:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-10-11 03:45:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 211. [2024-10-11 03:45:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 205 states have (on average 1.3365853658536586) internal successors, (274), 210 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 274 transitions. [2024-10-11 03:45:33,890 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 274 transitions. Word has length 50 [2024-10-11 03:45:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:33,891 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 274 transitions. [2024-10-11 03:45:33,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 274 transitions. [2024-10-11 03:45:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:45:33,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:33,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:33,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:45:33,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:33,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:33,893 INFO L85 PathProgramCache]: Analyzing trace with hash -297239348, now seen corresponding path program 1 times [2024-10-11 03:45:33,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:33,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179778736] [2024-10-11 03:45:33,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:33,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:34,640 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:45:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:34,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179778736] [2024-10-11 03:45:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179778736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:34,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 03:45:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100630813] [2024-10-11 03:45:34,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:45:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:34,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:45:34,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:45:34,643 INFO L87 Difference]: Start difference. First operand 211 states and 274 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:35,785 INFO L93 Difference]: Finished difference Result 519 states and 711 transitions. [2024-10-11 03:45:35,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:45:35,786 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 03:45:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:35,788 INFO L225 Difference]: With dead ends: 519 [2024-10-11 03:45:35,788 INFO L226 Difference]: Without dead ends: 431 [2024-10-11 03:45:35,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:45:35,790 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1243 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:35,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1874 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:45:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-11 03:45:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 217. [2024-10-11 03:45:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 211 states have (on average 1.3364928909952607) internal successors, (282), 216 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2024-10-11 03:45:35,796 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 50 [2024-10-11 03:45:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:35,797 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2024-10-11 03:45:35,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2024-10-11 03:45:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:45:35,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:35,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:35,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:45:35,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:35,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:35,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2077756496, now seen corresponding path program 1 times [2024-10-11 03:45:35,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:35,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874230593] [2024-10-11 03:45:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:35,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:36,456 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:45:36,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:36,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874230593] [2024-10-11 03:45:36,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874230593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:36,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:36,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:45:36,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170502795] [2024-10-11 03:45:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:36,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:45:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:36,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:45:36,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:45:36,458 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:36,823 INFO L93 Difference]: Finished difference Result 407 states and 559 transitions. [2024-10-11 03:45:36,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:45:36,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 03:45:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:36,826 INFO L225 Difference]: With dead ends: 407 [2024-10-11 03:45:36,827 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 03:45:36,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:45:36,828 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 754 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:36,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 425 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 03:45:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 178. [2024-10-11 03:45:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.3428571428571427) internal successors, (235), 177 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 235 transitions. [2024-10-11 03:45:36,840 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 235 transitions. Word has length 50 [2024-10-11 03:45:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:36,840 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 235 transitions. [2024-10-11 03:45:36,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 235 transitions. [2024-10-11 03:45:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:45:36,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:36,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:36,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:45:36,842 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:36,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash 200492003, now seen corresponding path program 1 times [2024-10-11 03:45:36,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:36,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283542759] [2024-10-11 03:45:36,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:37,034 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:45:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:37,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283542759] [2024-10-11 03:45:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283542759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:37,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:37,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:45:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090115326] [2024-10-11 03:45:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:45:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:45:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:45:37,038 INFO L87 Difference]: Start difference. First operand 178 states and 235 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:37,277 INFO L93 Difference]: Finished difference Result 305 states and 410 transitions. [2024-10-11 03:45:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:45:37,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 03:45:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:37,278 INFO L225 Difference]: With dead ends: 305 [2024-10-11 03:45:37,279 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 03:45:37,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:45:37,280 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 422 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:37,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 371 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 03:45:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 178. [2024-10-11 03:45:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.3371428571428572) internal successors, (234), 177 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 234 transitions. [2024-10-11 03:45:37,286 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 234 transitions. Word has length 51 [2024-10-11 03:45:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:37,286 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 234 transitions. [2024-10-11 03:45:37,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 234 transitions. [2024-10-11 03:45:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:45:37,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:37,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:37,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:45:37,288 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:37,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash -336264989, now seen corresponding path program 1 times [2024-10-11 03:45:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327970473] [2024-10-11 03:45:37,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:37,475 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:45:37,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:37,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327970473] [2024-10-11 03:45:37,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327970473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:37,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:37,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:45:37,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839549878] [2024-10-11 03:45:37,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:37,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:45:37,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:37,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:45:37,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:45:37,479 INFO L87 Difference]: Start difference. First operand 178 states and 234 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:37,722 INFO L93 Difference]: Finished difference Result 295 states and 400 transitions. [2024-10-11 03:45:37,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:45:37,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 03:45:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:37,723 INFO L225 Difference]: With dead ends: 295 [2024-10-11 03:45:37,723 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 03:45:37,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:45:37,724 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 338 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:37,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 367 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 03:45:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-10-11 03:45:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 177 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 232 transitions. [2024-10-11 03:45:37,728 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 232 transitions. Word has length 51 [2024-10-11 03:45:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:37,728 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 232 transitions. [2024-10-11 03:45:37,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 232 transitions. [2024-10-11 03:45:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:45:37,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:37,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:37,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:45:37,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:37,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 815340979, now seen corresponding path program 1 times [2024-10-11 03:45:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:37,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54325452] [2024-10-11 03:45:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:38,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:38,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54325452] [2024-10-11 03:45:38,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54325452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:38,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:38,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:45:38,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153340958] [2024-10-11 03:45:38,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:38,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:45:38,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:38,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:45:38,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:45:38,401 INFO L87 Difference]: Start difference. First operand 178 states and 232 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:39,145 INFO L93 Difference]: Finished difference Result 306 states and 409 transitions. [2024-10-11 03:45:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:45:39,146 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-11 03:45:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:39,147 INFO L225 Difference]: With dead ends: 306 [2024-10-11 03:45:39,147 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 03:45:39,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:45:39,148 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 399 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:39,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1912 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:45:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 03:45:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 181. [2024-10-11 03:45:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 178 states have (on average 1.3202247191011236) internal successors, (235), 180 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 235 transitions. [2024-10-11 03:45:39,153 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 235 transitions. Word has length 53 [2024-10-11 03:45:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:39,153 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 235 transitions. [2024-10-11 03:45:39,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 235 transitions. [2024-10-11 03:45:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:45:39,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:39,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:39,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:45:39,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:39,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1737446413, now seen corresponding path program 1 times [2024-10-11 03:45:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:39,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800840952] [2024-10-11 03:45:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:39,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:39,571 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:45:39,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800840952] [2024-10-11 03:45:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800840952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:39,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:39,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:45:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777896351] [2024-10-11 03:45:39,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:39,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:45:39,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:45:39,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:45:39,574 INFO L87 Difference]: Start difference. First operand 181 states and 235 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:40,204 INFO L93 Difference]: Finished difference Result 495 states and 686 transitions. [2024-10-11 03:45:40,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:45:40,206 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-11 03:45:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:40,208 INFO L225 Difference]: With dead ends: 495 [2024-10-11 03:45:40,208 INFO L226 Difference]: Without dead ends: 489 [2024-10-11 03:45:40,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:45:40,210 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 770 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:40,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1550 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:45:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-11 03:45:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 175. [2024-10-11 03:45:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.3179190751445087) internal successors, (228), 174 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 228 transitions. [2024-10-11 03:45:40,216 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 228 transitions. Word has length 53 [2024-10-11 03:45:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:40,216 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 228 transitions. [2024-10-11 03:45:40,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 228 transitions. [2024-10-11 03:45:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:45:40,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:40,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:40,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:45:40,220 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:40,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash 497385650, now seen corresponding path program 1 times [2024-10-11 03:45:40,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682122673] [2024-10-11 03:45:40,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:41,030 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:45:41,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682122673] [2024-10-11 03:45:41,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682122673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:41,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:41,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:45:41,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352527195] [2024-10-11 03:45:41,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:41,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:45:41,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:41,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:45:41,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:45:41,032 INFO L87 Difference]: Start difference. First operand 175 states and 228 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:42,390 INFO L93 Difference]: Finished difference Result 302 states and 401 transitions. [2024-10-11 03:45:42,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:45:42,391 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 03:45:42,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:42,392 INFO L225 Difference]: With dead ends: 302 [2024-10-11 03:45:42,392 INFO L226 Difference]: Without dead ends: 290 [2024-10-11 03:45:42,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 03:45:42,394 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 388 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:42,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 2097 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:45:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-11 03:45:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 172. [2024-10-11 03:45:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 171 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2024-10-11 03:45:42,399 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 54 [2024-10-11 03:45:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:42,399 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2024-10-11 03:45:42,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2024-10-11 03:45:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 03:45:42,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:42,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:42,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:45:42,401 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:42,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:42,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1925891666, now seen corresponding path program 1 times [2024-10-11 03:45:42,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:42,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117566385] [2024-10-11 03:45:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:42,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:42,780 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:45:42,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:42,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117566385] [2024-10-11 03:45:42,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117566385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:42,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:42,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:45:42,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275168243] [2024-10-11 03:45:42,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:42,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:45:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:42,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:45:42,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:45:42,784 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:43,033 INFO L93 Difference]: Finished difference Result 172 states and 224 transitions. [2024-10-11 03:45:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:45:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 03:45:43,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:43,034 INFO L225 Difference]: With dead ends: 172 [2024-10-11 03:45:43,034 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 03:45:43,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:45:43,035 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 244 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:43,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 622 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:45:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 03:45:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-10-11 03:45:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.3270440251572326) internal successors, (211), 159 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2024-10-11 03:45:43,045 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 54 [2024-10-11 03:45:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:43,046 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2024-10-11 03:45:43,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2024-10-11 03:45:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:45:43,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:43,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:43,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:45:43,047 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:43,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:43,047 INFO L85 PathProgramCache]: Analyzing trace with hash -546984540, now seen corresponding path program 1 times [2024-10-11 03:45:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:43,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439131306] [2024-10-11 03:45:43,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:43,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:43,119 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:45:43,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:43,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439131306] [2024-10-11 03:45:43,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439131306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:43,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:43,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17875409] [2024-10-11 03:45:43,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:43,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:43,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:43,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:43,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:43,124 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:43,188 INFO L93 Difference]: Finished difference Result 664 states and 979 transitions. [2024-10-11 03:45:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:45:43,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-11 03:45:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:43,191 INFO L225 Difference]: With dead ends: 664 [2024-10-11 03:45:43,191 INFO L226 Difference]: Without dead ends: 580 [2024-10-11 03:45:43,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:45:43,192 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 538 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:43,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 463 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-11 03:45:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 242. [2024-10-11 03:45:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.3858921161825726) internal successors, (334), 241 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 334 transitions. [2024-10-11 03:45:43,200 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 334 transitions. Word has length 71 [2024-10-11 03:45:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:43,201 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 334 transitions. [2024-10-11 03:45:43,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 334 transitions. [2024-10-11 03:45:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:45:43,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:43,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:43,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:45:43,202 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:43,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2078520713, now seen corresponding path program 1 times [2024-10-11 03:45:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:43,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980162471] [2024-10-11 03:45:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:43,297 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:45:43,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:43,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980162471] [2024-10-11 03:45:43,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980162471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:43,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:43,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179885418] [2024-10-11 03:45:43,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:43,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:43,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:43,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:43,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:43,298 INFO L87 Difference]: Start difference. First operand 242 states and 334 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:43,348 INFO L93 Difference]: Finished difference Result 824 states and 1211 transitions. [2024-10-11 03:45:43,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:43,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 03:45:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:43,350 INFO L225 Difference]: With dead ends: 824 [2024-10-11 03:45:43,350 INFO L226 Difference]: Without dead ends: 658 [2024-10-11 03:45:43,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:45:43,351 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 296 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:43,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 419 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:43,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-10-11 03:45:43,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 406. [2024-10-11 03:45:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.4370370370370371) internal successors, (582), 405 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 582 transitions. [2024-10-11 03:45:43,360 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 582 transitions. Word has length 73 [2024-10-11 03:45:43,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:43,360 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 582 transitions. [2024-10-11 03:45:43,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 582 transitions. [2024-10-11 03:45:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:45:43,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:43,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:43,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:45:43,362 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:43,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2099864602, now seen corresponding path program 1 times [2024-10-11 03:45:43,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:43,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936910149] [2024-10-11 03:45:43,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:43,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:43,497 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:45:43,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:43,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936910149] [2024-10-11 03:45:43,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936910149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:43,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:43,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:43,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259114241] [2024-10-11 03:45:43,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:43,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:43,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:43,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:43,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:43,500 INFO L87 Difference]: Start difference. First operand 406 states and 582 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:43,544 INFO L93 Difference]: Finished difference Result 738 states and 1082 transitions. [2024-10-11 03:45:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:43,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 03:45:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:43,546 INFO L225 Difference]: With dead ends: 738 [2024-10-11 03:45:43,546 INFO L226 Difference]: Without dead ends: 408 [2024-10-11 03:45:43,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:45:43,547 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 160 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:43,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 238 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-11 03:45:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 406. [2024-10-11 03:45:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.4271604938271605) internal successors, (578), 405 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 578 transitions. [2024-10-11 03:45:43,554 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 578 transitions. Word has length 73 [2024-10-11 03:45:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:43,555 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 578 transitions. [2024-10-11 03:45:43,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 578 transitions. [2024-10-11 03:45:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:45:43,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:43,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:43,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:45:43,556 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:43,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1455362373, now seen corresponding path program 1 times [2024-10-11 03:45:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:43,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636704105] [2024-10-11 03:45:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:43,604 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:45:43,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:43,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636704105] [2024-10-11 03:45:43,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636704105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:43,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:43,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373205626] [2024-10-11 03:45:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:43,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:43,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:43,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:43,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:43,607 INFO L87 Difference]: Start difference. First operand 406 states and 578 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:43,628 INFO L93 Difference]: Finished difference Result 1014 states and 1480 transitions. [2024-10-11 03:45:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:43,629 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 03:45:43,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:43,630 INFO L225 Difference]: With dead ends: 1014 [2024-10-11 03:45:43,631 INFO L226 Difference]: Without dead ends: 684 [2024-10-11 03:45:43,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:45:43,631 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 69 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:43,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 195 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-10-11 03:45:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 674. [2024-10-11 03:45:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 1.4205052005943537) internal successors, (956), 673 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 956 transitions. [2024-10-11 03:45:43,640 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 956 transitions. Word has length 73 [2024-10-11 03:45:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:43,640 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 956 transitions. [2024-10-11 03:45:43,641 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 956 transitions. [2024-10-11 03:45:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:45:43,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:43,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:43,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:45:43,642 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:43,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1485181309, now seen corresponding path program 1 times [2024-10-11 03:45:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:43,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623194293] [2024-10-11 03:45:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:43,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:43,727 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:45:43,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:43,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623194293] [2024-10-11 03:45:43,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623194293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:43,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:43,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:43,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944850111] [2024-10-11 03:45:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:43,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:43,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:43,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:43,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:43,729 INFO L87 Difference]: Start difference. First operand 674 states and 956 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:43,784 INFO L93 Difference]: Finished difference Result 1726 states and 2490 transitions. [2024-10-11 03:45:43,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:43,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 03:45:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:43,789 INFO L225 Difference]: With dead ends: 1726 [2024-10-11 03:45:43,789 INFO L226 Difference]: Without dead ends: 1426 [2024-10-11 03:45:43,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:45:43,791 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 291 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:43,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 457 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-10-11 03:45:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1122. [2024-10-11 03:45:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4326494201605708) internal successors, (1606), 1121 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1606 transitions. [2024-10-11 03:45:43,808 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1606 transitions. Word has length 73 [2024-10-11 03:45:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:43,809 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1606 transitions. [2024-10-11 03:45:43,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1606 transitions. [2024-10-11 03:45:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:45:43,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:43,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:43,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:45:43,810 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:43,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash -730460828, now seen corresponding path program 1 times [2024-10-11 03:45:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:43,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856943902] [2024-10-11 03:45:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:43,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:43,884 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:45:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:43,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856943902] [2024-10-11 03:45:43,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856943902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:43,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:43,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056418174] [2024-10-11 03:45:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:43,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:43,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:43,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:43,886 INFO L87 Difference]: Start difference. First operand 1122 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:43,909 INFO L93 Difference]: Finished difference Result 3102 states and 4456 transitions. [2024-10-11 03:45:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:43,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:45:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:43,914 INFO L225 Difference]: With dead ends: 3102 [2024-10-11 03:45:43,915 INFO L226 Difference]: Without dead ends: 2056 [2024-10-11 03:45:43,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:45:43,917 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 55 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:43,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2024-10-11 03:45:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 1942. [2024-10-11 03:45:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1941 states have (on average 1.4240082431736218) internal successors, (2764), 1941 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2764 transitions. [2024-10-11 03:45:43,952 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2764 transitions. Word has length 74 [2024-10-11 03:45:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:43,952 INFO L471 AbstractCegarLoop]: Abstraction has 1942 states and 2764 transitions. [2024-10-11 03:45:43,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2764 transitions. [2024-10-11 03:45:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:45:43,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:43,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:43,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:45:43,954 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:43,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1645152135, now seen corresponding path program 1 times [2024-10-11 03:45:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:43,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958567086] [2024-10-11 03:45:43,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:44,051 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:45:44,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:44,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958567086] [2024-10-11 03:45:44,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958567086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:44,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:44,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:44,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113100101] [2024-10-11 03:45:44,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:44,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:44,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:44,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:44,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:44,054 INFO L87 Difference]: Start difference. First operand 1942 states and 2764 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:44,082 INFO L93 Difference]: Finished difference Result 5450 states and 7734 transitions. [2024-10-11 03:45:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:44,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-11 03:45:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:44,095 INFO L225 Difference]: With dead ends: 5450 [2024-10-11 03:45:44,095 INFO L226 Difference]: Without dead ends: 3584 [2024-10-11 03:45:44,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:45:44,099 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 45 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:44,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 258 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2024-10-11 03:45:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3358. [2024-10-11 03:45:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 3357 states have (on average 1.4048257372654156) internal successors, (4716), 3357 states have internal predecessors, (4716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4716 transitions. [2024-10-11 03:45:44,161 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4716 transitions. Word has length 75 [2024-10-11 03:45:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:44,162 INFO L471 AbstractCegarLoop]: Abstraction has 3358 states and 4716 transitions. [2024-10-11 03:45:44,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4716 transitions. [2024-10-11 03:45:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:45:44,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:44,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:44,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:45:44,163 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:44,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash -92740011, now seen corresponding path program 1 times [2024-10-11 03:45:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:44,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260101413] [2024-10-11 03:45:44,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:44,335 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:45:44,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:44,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260101413] [2024-10-11 03:45:44,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260101413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:44,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:44,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:45:44,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919119115] [2024-10-11 03:45:44,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:44,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:45:44,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:44,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:45:44,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:45:44,336 INFO L87 Difference]: Start difference. First operand 3358 states and 4716 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:44,363 INFO L93 Difference]: Finished difference Result 3504 states and 4909 transitions. [2024-10-11 03:45:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:45:44,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-11 03:45:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:44,371 INFO L225 Difference]: With dead ends: 3504 [2024-10-11 03:45:44,371 INFO L226 Difference]: Without dead ends: 3502 [2024-10-11 03:45:44,371 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:45:44,372 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 597 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:45:44,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 597 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2024-10-11 03:45:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3502. [2024-10-11 03:45:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3502 states, 3501 states have (on average 1.3790345615538417) internal successors, (4828), 3501 states have internal predecessors, (4828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 4828 transitions. [2024-10-11 03:45:44,418 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 4828 transitions. Word has length 76 [2024-10-11 03:45:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:44,418 INFO L471 AbstractCegarLoop]: Abstraction has 3502 states and 4828 transitions. [2024-10-11 03:45:44,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 4828 transitions. [2024-10-11 03:45:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 03:45:44,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:44,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:44,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:45:44,419 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:44,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1972991000, now seen corresponding path program 1 times [2024-10-11 03:45:44,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:44,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002621202] [2024-10-11 03:45:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:44,520 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:45:44,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:44,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002621202] [2024-10-11 03:45:44,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002621202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:44,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:44,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:45:44,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709631372] [2024-10-11 03:45:44,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:44,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:45:44,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:44,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:45:44,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:45:44,522 INFO L87 Difference]: Start difference. First operand 3502 states and 4828 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:44,584 INFO L93 Difference]: Finished difference Result 6462 states and 8960 transitions. [2024-10-11 03:45:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:45:44,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-11 03:45:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:44,603 INFO L225 Difference]: With dead ends: 6462 [2024-10-11 03:45:44,603 INFO L226 Difference]: Without dead ends: 5476 [2024-10-11 03:45:44,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:45:44,608 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 290 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:44,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 420 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2024-10-11 03:45:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 4486. [2024-10-11 03:45:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4486 states, 4485 states have (on average 1.3797101449275362) internal successors, (6188), 4485 states have internal predecessors, (6188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4486 states to 4486 states and 6188 transitions. [2024-10-11 03:45:44,689 INFO L78 Accepts]: Start accepts. Automaton has 4486 states and 6188 transitions. Word has length 76 [2024-10-11 03:45:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:44,689 INFO L471 AbstractCegarLoop]: Abstraction has 4486 states and 6188 transitions. [2024-10-11 03:45:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4486 states and 6188 transitions. [2024-10-11 03:45:44,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:45:44,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:44,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:44,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:45:44,691 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:44,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1730490915, now seen corresponding path program 1 times [2024-10-11 03:45:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:44,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340591886] [2024-10-11 03:45:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:44,765 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:45:44,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:44,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340591886] [2024-10-11 03:45:44,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340591886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:44,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:44,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:44,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945877818] [2024-10-11 03:45:44,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:44,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:44,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:44,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:44,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:44,767 INFO L87 Difference]: Start difference. First operand 4486 states and 6188 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:44,807 INFO L93 Difference]: Finished difference Result 11722 states and 16158 transitions. [2024-10-11 03:45:44,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:44,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-11 03:45:44,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:44,843 INFO L225 Difference]: With dead ends: 11722 [2024-10-11 03:45:44,844 INFO L226 Difference]: Without dead ends: 7312 [2024-10-11 03:45:44,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:45:44,856 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 59 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:44,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:44,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7312 states. [2024-10-11 03:45:44,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7312 to 6734. [2024-10-11 03:45:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6734 states, 6733 states have (on average 1.3539284122976385) internal successors, (9116), 6733 states have internal predecessors, (9116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6734 states to 6734 states and 9116 transitions. [2024-10-11 03:45:44,985 INFO L78 Accepts]: Start accepts. Automaton has 6734 states and 9116 transitions. Word has length 77 [2024-10-11 03:45:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:44,986 INFO L471 AbstractCegarLoop]: Abstraction has 6734 states and 9116 transitions. [2024-10-11 03:45:44,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6734 states and 9116 transitions. [2024-10-11 03:45:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:45:44,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:44,989 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:44,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:45:44,989 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:44,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:44,990 INFO L85 PathProgramCache]: Analyzing trace with hash 350821364, now seen corresponding path program 1 times [2024-10-11 03:45:44,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:44,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855860460] [2024-10-11 03:45:44,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:45,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:45,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855860460] [2024-10-11 03:45:45,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855860460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:45:45,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:45:45,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:45:45,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032880245] [2024-10-11 03:45:45,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:45:45,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:45:45,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:45,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:45:45,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:45,118 INFO L87 Difference]: Start difference. First operand 6734 states and 9116 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:45,164 INFO L93 Difference]: Finished difference Result 13394 states and 18150 transitions. [2024-10-11 03:45:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:45,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:45:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:45,178 INFO L225 Difference]: With dead ends: 13394 [2024-10-11 03:45:45,179 INFO L226 Difference]: Without dead ends: 6736 [2024-10-11 03:45:45,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:45:45,190 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 56 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:45,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 238 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:45,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6736 states. [2024-10-11 03:45:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6736 to 6734. [2024-10-11 03:45:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6734 states, 6733 states have (on average 1.3325412149116294) internal successors, (8972), 6733 states have internal predecessors, (8972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6734 states to 6734 states and 8972 transitions. [2024-10-11 03:45:45,312 INFO L78 Accepts]: Start accepts. Automaton has 6734 states and 8972 transitions. Word has length 98 [2024-10-11 03:45:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:45,312 INFO L471 AbstractCegarLoop]: Abstraction has 6734 states and 8972 transitions. [2024-10-11 03:45:45,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 6734 states and 8972 transitions. [2024-10-11 03:45:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:45:45,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:45,315 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, 1] [2024-10-11 03:45:45,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:45:45,315 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:45,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash -147664979, now seen corresponding path program 1 times [2024-10-11 03:45:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038526368] [2024-10-11 03:45:45,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:45,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:45,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:45,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038526368] [2024-10-11 03:45:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038526368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:45:45,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812063518] [2024-10-11 03:45:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:45,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:45:45,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:45:45,710 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:45:45,716 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:45:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:45,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 03:45:45,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:45:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:46,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:45:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:47,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812063518] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:45:47,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:45:47,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-10-11 03:45:47,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167489893] [2024-10-11 03:45:47,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:45:47,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 03:45:47,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:47,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 03:45:47,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:45:47,675 INFO L87 Difference]: Start difference. First operand 6734 states and 8972 transitions. Second operand has 28 states, 28 states have (on average 8.428571428571429) internal successors, (236), 27 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:52,205 INFO L93 Difference]: Finished difference Result 55057 states and 72758 transitions. [2024-10-11 03:45:52,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-10-11 03:45:52,206 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.428571428571429) internal successors, (236), 27 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:45:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:52,287 INFO L225 Difference]: With dead ends: 55057 [2024-10-11 03:45:52,288 INFO L226 Difference]: Without dead ends: 48399 [2024-10-11 03:45:52,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2211, Invalid=12795, Unknown=0, NotChecked=0, Total=15006 [2024-10-11 03:45:52,316 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1431 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:52,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 2066 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:45:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48399 states. [2024-10-11 03:45:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48399 to 24557. [2024-10-11 03:45:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24557 states, 24556 states have (on average 1.3195553021664765) internal successors, (32403), 24556 states have internal predecessors, (32403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24557 states to 24557 states and 32403 transitions. [2024-10-11 03:45:52,968 INFO L78 Accepts]: Start accepts. Automaton has 24557 states and 32403 transitions. Word has length 98 [2024-10-11 03:45:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:45:52,968 INFO L471 AbstractCegarLoop]: Abstraction has 24557 states and 32403 transitions. [2024-10-11 03:45:52,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.428571428571429) internal successors, (236), 27 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 24557 states and 32403 transitions. [2024-10-11 03:45:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:45:52,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:45:52,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:45:52,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 03:45:53,177 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,SelfDestructingSolverStorable26 [2024-10-11 03:45:53,178 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:45:53,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:45:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1459589513, now seen corresponding path program 1 times [2024-10-11 03:45:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:45:53,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424239330] [2024-10-11 03:45:53,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:45:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:45:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424239330] [2024-10-11 03:45:53,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424239330] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:45:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944384236] [2024-10-11 03:45:53,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:45:53,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:45:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:45:53,830 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:45:53,831 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:45:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:45:53,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 03:45:53,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:45:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:54,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:45:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:45:55,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944384236] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:45:55,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:45:55,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2024-10-11 03:45:55,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705447494] [2024-10-11 03:45:55,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:45:55,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 03:45:55,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:45:55,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 03:45:55,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:45:55,441 INFO L87 Difference]: Start difference. First operand 24557 states and 32403 transitions. Second operand has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 28 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:02,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:02,012 INFO L93 Difference]: Finished difference Result 111954 states and 146861 transitions. [2024-10-11 03:46:02,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-10-11 03:46:02,013 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 28 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-11 03:46:02,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:02,101 INFO L225 Difference]: With dead ends: 111954 [2024-10-11 03:46:02,101 INFO L226 Difference]: Without dead ends: 87480 [2024-10-11 03:46:02,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5563 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2900, Invalid=15732, Unknown=0, NotChecked=0, Total=18632 [2024-10-11 03:46:02,146 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 2593 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 2924 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2593 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:02,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2593 Valid, 2050 Invalid, 2980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2924 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 03:46:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87480 states. [2024-10-11 03:46:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87480 to 57304. [2024-10-11 03:46:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57304 states, 57303 states have (on average 1.317452838420327) internal successors, (75494), 57303 states have internal predecessors, (75494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57304 states to 57304 states and 75494 transitions. [2024-10-11 03:46:03,142 INFO L78 Accepts]: Start accepts. Automaton has 57304 states and 75494 transitions. Word has length 99 [2024-10-11 03:46:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:03,143 INFO L471 AbstractCegarLoop]: Abstraction has 57304 states and 75494 transitions. [2024-10-11 03:46:03,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 28 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 57304 states and 75494 transitions. [2024-10-11 03:46:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:46:03,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:03,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:46:03,172 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:46:03,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 03:46:03,355 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:03,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:03,357 INFO L85 PathProgramCache]: Analyzing trace with hash 388873768, now seen corresponding path program 1 times [2024-10-11 03:46:03,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:03,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189329085] [2024-10-11 03:46:03,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:46:03,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:03,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189329085] [2024-10-11 03:46:03,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189329085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:03,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:03,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:46:03,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276139773] [2024-10-11 03:46:03,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:03,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:46:03,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:03,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:46:03,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:46:03,579 INFO L87 Difference]: Start difference. First operand 57304 states and 75494 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:04,046 INFO L93 Difference]: Finished difference Result 103820 states and 137205 transitions. [2024-10-11 03:46:04,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:46:04,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-11 03:46:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:04,125 INFO L225 Difference]: With dead ends: 103820 [2024-10-11 03:46:04,126 INFO L226 Difference]: Without dead ends: 46632 [2024-10-11 03:46:04,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:46:04,165 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 84 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:04,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 101 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:46:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46632 states. [2024-10-11 03:46:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46632 to 46272. [2024-10-11 03:46:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46272 states, 46271 states have (on average 1.3088111344038382) internal successors, (60560), 46271 states have internal predecessors, (60560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46272 states to 46272 states and 60560 transitions. [2024-10-11 03:46:05,076 INFO L78 Accepts]: Start accepts. Automaton has 46272 states and 60560 transitions. Word has length 100 [2024-10-11 03:46:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:05,076 INFO L471 AbstractCegarLoop]: Abstraction has 46272 states and 60560 transitions. [2024-10-11 03:46:05,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 46272 states and 60560 transitions. [2024-10-11 03:46:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:46:05,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:05,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:46:05,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:46:05,084 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:05,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash 719622775, now seen corresponding path program 1 times [2024-10-11 03:46:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461045522] [2024-10-11 03:46:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:06,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:06,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461045522] [2024-10-11 03:46:06,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461045522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:46:06,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960791516] [2024-10-11 03:46:06,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:06,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:06,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:46:06,163 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:46:06,165 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:46:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:06,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 03:46:06,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:46:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:46:06,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:46:06,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960791516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:06,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:46:06,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2024-10-11 03:46:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283681992] [2024-10-11 03:46:06,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:06,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:46:06,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:06,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:46:06,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:46:06,743 INFO L87 Difference]: Start difference. First operand 46272 states and 60560 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:07,518 INFO L93 Difference]: Finished difference Result 111307 states and 145786 transitions. [2024-10-11 03:46:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:46:07,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-11 03:46:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:07,613 INFO L225 Difference]: With dead ends: 111307 [2024-10-11 03:46:07,614 INFO L226 Difference]: Without dead ends: 65127 [2024-10-11 03:46:07,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:46:07,649 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 253 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:07,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 458 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:46:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65127 states. [2024-10-11 03:46:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65127 to 46272. [2024-10-11 03:46:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46272 states, 46271 states have (on average 1.3087246871690692) internal successors, (60556), 46271 states have internal predecessors, (60556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46272 states to 46272 states and 60556 transitions. [2024-10-11 03:46:08,793 INFO L78 Accepts]: Start accepts. Automaton has 46272 states and 60556 transitions. Word has length 100 [2024-10-11 03:46:08,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:08,793 INFO L471 AbstractCegarLoop]: Abstraction has 46272 states and 60556 transitions. [2024-10-11 03:46:08,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:08,794 INFO L276 IsEmpty]: Start isEmpty. Operand 46272 states and 60556 transitions. [2024-10-11 03:46:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:46:08,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:08,798 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, 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:46:08,814 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:46:09,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:09,003 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:09,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1598852247, now seen corresponding path program 1 times [2024-10-11 03:46:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:09,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144083016] [2024-10-11 03:46:09,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:09,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:09,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144083016] [2024-10-11 03:46:09,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144083016] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:46:09,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941040083] [2024-10-11 03:46:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:09,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:09,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:46:09,514 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:46:09,516 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:46:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:09,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 03:46:09,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:46:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:10,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:46:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:11,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941040083] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:46:11,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:46:11,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2024-10-11 03:46:11,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997821654] [2024-10-11 03:46:11,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:46:11,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 03:46:11,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:11,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 03:46:11,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:46:11,502 INFO L87 Difference]: Start difference. First operand 46272 states and 60556 transitions. Second operand has 28 states, 28 states have (on average 8.607142857142858) internal successors, (241), 27 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:12,979 INFO L93 Difference]: Finished difference Result 111132 states and 145414 transitions. [2024-10-11 03:46:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:46:12,979 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.607142857142858) internal successors, (241), 27 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-11 03:46:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:13,082 INFO L225 Difference]: With dead ends: 111132 [2024-10-11 03:46:13,082 INFO L226 Difference]: Without dead ends: 84048 [2024-10-11 03:46:13,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 03:46:13,130 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 1136 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:13,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1503 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:46:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84048 states. [2024-10-11 03:46:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84048 to 66906. [2024-10-11 03:46:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66906 states, 66905 states have (on average 1.3086764815783574) internal successors, (87557), 66905 states have internal predecessors, (87557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66906 states to 66906 states and 87557 transitions. [2024-10-11 03:46:14,093 INFO L78 Accepts]: Start accepts. Automaton has 66906 states and 87557 transitions. Word has length 101 [2024-10-11 03:46:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:14,094 INFO L471 AbstractCegarLoop]: Abstraction has 66906 states and 87557 transitions. [2024-10-11 03:46:14,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.607142857142858) internal successors, (241), 27 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 66906 states and 87557 transitions. [2024-10-11 03:46:14,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 03:46:14,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:14,101 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, 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:46:14,119 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:46:14,302 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,SelfDestructingSolverStorable30 [2024-10-11 03:46:14,302 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:14,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:14,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2001808872, now seen corresponding path program 1 times [2024-10-11 03:46:14,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:14,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488280531] [2024-10-11 03:46:14,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:14,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:14,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:14,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488280531] [2024-10-11 03:46:14,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488280531] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:46:14,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243423316] [2024-10-11 03:46:14,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:14,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:14,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:46:14,713 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:46:14,714 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:46:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:14,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 03:46:14,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:46:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:15,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:46:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243423316] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:46:16,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:46:16,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 15] total 35 [2024-10-11 03:46:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793070737] [2024-10-11 03:46:16,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:46:16,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 03:46:16,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:16,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 03:46:16,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1082, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 03:46:16,823 INFO L87 Difference]: Start difference. First operand 66906 states and 87557 transitions. Second operand has 36 states, 36 states have (on average 8.11111111111111) internal successors, (292), 35 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:20,694 INFO L93 Difference]: Finished difference Result 202595 states and 265229 transitions. [2024-10-11 03:46:20,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-11 03:46:20,695 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 8.11111111111111) internal successors, (292), 35 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-10-11 03:46:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:20,893 INFO L225 Difference]: With dead ends: 202595 [2024-10-11 03:46:20,893 INFO L226 Difference]: Without dead ends: 175332 [2024-10-11 03:46:20,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2816 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1934, Invalid=7966, Unknown=0, NotChecked=0, Total=9900 [2024-10-11 03:46:20,970 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 2167 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2167 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:20,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2167 Valid, 2130 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:46:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175332 states. [2024-10-11 03:46:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175332 to 66799. [2024-10-11 03:46:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66799 states, 66798 states have (on average 1.3090062576723853) internal successors, (87439), 66798 states have internal predecessors, (87439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66799 states to 66799 states and 87439 transitions. [2024-10-11 03:46:22,608 INFO L78 Accepts]: Start accepts. Automaton has 66799 states and 87439 transitions. Word has length 102 [2024-10-11 03:46:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:22,608 INFO L471 AbstractCegarLoop]: Abstraction has 66799 states and 87439 transitions. [2024-10-11 03:46:22,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.11111111111111) internal successors, (292), 35 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 66799 states and 87439 transitions. [2024-10-11 03:46:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 03:46:22,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:22,620 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, 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:46:22,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:46:22,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:22,821 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:22,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:22,825 INFO L85 PathProgramCache]: Analyzing trace with hash -754638916, now seen corresponding path program 1 times [2024-10-11 03:46:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:22,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371644260] [2024-10-11 03:46:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:22,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:24,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371644260] [2024-10-11 03:46:24,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371644260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:46:24,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585864377] [2024-10-11 03:46:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:24,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:24,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:46:24,068 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:46:24,070 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:46:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:24,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 03:46:24,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:46:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:26,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:46:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:28,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585864377] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:46:28,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:46:28,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 46 [2024-10-11 03:46:28,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872189463] [2024-10-11 03:46:28,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:46:28,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-11 03:46:28,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-11 03:46:28,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2022, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 03:46:28,100 INFO L87 Difference]: Start difference. First operand 66799 states and 87439 transitions. Second operand has 47 states, 47 states have (on average 5.851063829787234) internal successors, (275), 46 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:36,581 INFO L93 Difference]: Finished difference Result 144173 states and 188537 transitions. [2024-10-11 03:46:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-10-11 03:46:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 5.851063829787234) internal successors, (275), 46 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-10-11 03:46:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:36,714 INFO L225 Difference]: With dead ends: 144173 [2024-10-11 03:46:36,714 INFO L226 Difference]: Without dead ends: 108993 [2024-10-11 03:46:36,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2744 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2078, Invalid=12202, Unknown=0, NotChecked=0, Total=14280 [2024-10-11 03:46:36,754 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 2474 mSDsluCounter, 5723 mSDsCounter, 0 mSdLazyCounter, 3569 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2474 SdHoareTripleChecker+Valid, 5972 SdHoareTripleChecker+Invalid, 3571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:36,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2474 Valid, 5972 Invalid, 3571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3569 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 03:46:36,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108993 states. [2024-10-11 03:46:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108993 to 59776. [2024-10-11 03:46:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59776 states, 59775 states have (on average 1.311836051861146) internal successors, (78415), 59775 states have internal predecessors, (78415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59776 states to 59776 states and 78415 transitions. [2024-10-11 03:46:37,686 INFO L78 Accepts]: Start accepts. Automaton has 59776 states and 78415 transitions. Word has length 102 [2024-10-11 03:46:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:37,686 INFO L471 AbstractCegarLoop]: Abstraction has 59776 states and 78415 transitions. [2024-10-11 03:46:37,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 5.851063829787234) internal successors, (275), 46 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 59776 states and 78415 transitions. [2024-10-11 03:46:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:46:37,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:37,689 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:46:37,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 03:46:37,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 03:46:37,890 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:37,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash -519674288, now seen corresponding path program 1 times [2024-10-11 03:46:37,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:37,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615594340] [2024-10-11 03:46:37,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:37,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:37,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615594340] [2024-10-11 03:46:37,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615594340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:37,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:37,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:46:37,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497892815] [2024-10-11 03:46:37,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:37,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:46:37,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:37,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:46:37,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:46:37,954 INFO L87 Difference]: Start difference. First operand 59776 states and 78415 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:38,106 INFO L93 Difference]: Finished difference Result 90176 states and 117734 transitions. [2024-10-11 03:46:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:46:38,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-11 03:46:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:38,137 INFO L225 Difference]: With dead ends: 90176 [2024-10-11 03:46:38,138 INFO L226 Difference]: Without dead ends: 30566 [2024-10-11 03:46:38,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:46:38,167 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 50 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:38,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 213 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30566 states. [2024-10-11 03:46:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30566 to 30564. [2024-10-11 03:46:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30564 states, 30563 states have (on average 1.2751038837810424) internal successors, (38971), 30563 states have internal predecessors, (38971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30564 states to 30564 states and 38971 transitions. [2024-10-11 03:46:38,691 INFO L78 Accepts]: Start accepts. Automaton has 30564 states and 38971 transitions. Word has length 103 [2024-10-11 03:46:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:38,691 INFO L471 AbstractCegarLoop]: Abstraction has 30564 states and 38971 transitions. [2024-10-11 03:46:38,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 30564 states and 38971 transitions. [2024-10-11 03:46:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:46:38,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:38,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:46:38,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:46:38,694 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:38,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1604767242, now seen corresponding path program 1 times [2024-10-11 03:46:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:38,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118953354] [2024-10-11 03:46:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:46:38,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:38,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118953354] [2024-10-11 03:46:38,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118953354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:46:38,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:46:38,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:46:38,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098781357] [2024-10-11 03:46:38,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:46:38,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:46:38,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:38,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:46:38,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:46:38,732 INFO L87 Difference]: Start difference. First operand 30564 states and 38971 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:46:38,889 INFO L93 Difference]: Finished difference Result 56682 states and 72417 transitions. [2024-10-11 03:46:38,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:46:38,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-11 03:46:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:46:38,921 INFO L225 Difference]: With dead ends: 56682 [2024-10-11 03:46:38,921 INFO L226 Difference]: Without dead ends: 26284 [2024-10-11 03:46:38,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:46:38,944 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 80 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:46:38,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 125 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:46:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26284 states. [2024-10-11 03:46:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26284 to 26284. [2024-10-11 03:46:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26284 states, 26283 states have (on average 1.2613476391583913) internal successors, (33152), 26283 states have internal predecessors, (33152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26284 states to 26284 states and 33152 transitions. [2024-10-11 03:46:39,215 INFO L78 Accepts]: Start accepts. Automaton has 26284 states and 33152 transitions. Word has length 103 [2024-10-11 03:46:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:46:39,215 INFO L471 AbstractCegarLoop]: Abstraction has 26284 states and 33152 transitions. [2024-10-11 03:46:39,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:46:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 26284 states and 33152 transitions. [2024-10-11 03:46:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:46:39,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:46:39,218 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, 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:46:39,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 03:46:39,219 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-11 03:46:39,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:46:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash 901802335, now seen corresponding path program 1 times [2024-10-11 03:46:39,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:46:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283172694] [2024-10-11 03:46:39,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:39,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:46:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:40,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:46:40,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283172694] [2024-10-11 03:46:40,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283172694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:46:40,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989055745] [2024-10-11 03:46:40,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:46:40,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:46:40,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:46:40,861 INFO L229 MonitoredProcess]: Starting monitored process 8 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:46:40,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:46:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:46:41,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 03:46:41,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:46:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:46,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:46:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:46:48,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989055745] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:46:48,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:46:48,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 21] total 65 [2024-10-11 03:46:48,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201502290] [2024-10-11 03:46:48,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:46:48,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-11 03:46:48,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:46:48,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-11 03:46:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=4020, Unknown=0, NotChecked=0, Total=4290 [2024-10-11 03:46:48,501 INFO L87 Difference]: Start difference. First operand 26284 states and 33152 transitions. Second operand has 66 states, 66 states have (on average 4.378787878787879) internal successors, (289), 65 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)