./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU --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 64bit --witnessprinter.graph.data.programhash a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:08:38,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:08:38,941 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-31 22:08:38,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:08:38,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:08:38,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:08:38,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:08:38,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:08:38,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:08:38,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:08:38,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:08:38,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:08:38,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:08:38,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:08:38,989 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:08:38,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:08:38,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:08:38,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:08:38,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:08:38,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:08:38,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:08:38,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:08:38,996 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:08:38,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:08:38,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:08:38,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:08:38,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:08:38,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:08:38,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:08:38,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:08:38,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:08:38,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:08:38,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:08:38,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:08:38,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:08:39,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:08:39,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:08:39,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:08:39,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:08:39,002 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 [2024-10-31 22:08:39,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:08:39,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:08:39,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:08:39,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:08:39,373 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:08:39,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c Unable to find full path for "g++" [2024-10-31 22:08:41,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:08:41,642 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:08:41,643 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-10-31 22:08:41,661 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/data/c7d260d76/0794dc591d354d149bd8e1c048468f6a/FLAG238905f1a [2024-10-31 22:08:41,955 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/data/c7d260d76/0794dc591d354d149bd8e1c048468f6a [2024-10-31 22:08:41,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:08:41,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:08:41,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:08:41,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:08:41,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:08:41,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:08:41" (1/1) ... [2024-10-31 22:08:41,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d09b0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:41, skipping insertion in model container [2024-10-31 22:08:41,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:08:41" (1/1) ... [2024-10-31 22:08:42,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:08:42,365 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c[1245,1258] [2024-10-31 22:08:42,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:08:42,674 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:08:42,692 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c[1245,1258] [2024-10-31 22:08:42,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:08:42,877 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:08:42,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42 WrapperNode [2024-10-31 22:08:42,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:08:42,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:08:42,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:08:42,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:08:42,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:42,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:43,168 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1909 [2024-10-31 22:08:43,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:08:43,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:08:43,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:08:43,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:08:43,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:43,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:43,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:43,378 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-31 22:08:43,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:43,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:43,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:43,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:43,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:43,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:43,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:08:43,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:08:43,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:08:43,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:08:43,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (1/1) ... [2024-10-31 22:08:43,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:08:43,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:08:43,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:08:43,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:08:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:08:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:08:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:08:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:08:43,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:08:44,259 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:08:44,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:08:46,532 INFO L? ?]: Removed 1250 outVars from TransFormulas that were not future-live. [2024-10-31 22:08:46,532 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:08:46,561 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:08:46,562 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:08:46,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:08:46 BoogieIcfgContainer [2024-10-31 22:08:46,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:08:46,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:08:46,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:08:46,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:08:46,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:08:41" (1/3) ... [2024-10-31 22:08:46,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a1ad39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:08:46, skipping insertion in model container [2024-10-31 22:08:46,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:42" (2/3) ... [2024-10-31 22:08:46,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a1ad39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:08:46, skipping insertion in model container [2024-10-31 22:08:46,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:08:46" (3/3) ... [2024-10-31 22:08:46,577 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b03.c [2024-10-31 22:08:46,605 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:08:46,605 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:08:46,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:08:46,716 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;@5770fc99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:08:46,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:08:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 184 states have (on average 1.4945652173913044) internal successors, (275), 185 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-31 22:08:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-31 22:08:46,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:46,738 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] [2024-10-31 22:08:46,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:46,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:46,749 INFO L85 PathProgramCache]: Analyzing trace with hash 109545984, now seen corresponding path program 1 times [2024-10-31 22:08:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:46,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014406477] [2024-10-31 22:08:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:47,847 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-31 22:08:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:47,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014406477] [2024-10-31 22:08:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014406477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:47,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:47,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:47,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75423891] [2024-10-31 22:08:47,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:47,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:08:47,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:47,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:08:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:47,892 INFO L87 Difference]: Start difference. First operand has 186 states, 184 states have (on average 1.4945652173913044) internal successors, (275), 185 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) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-31 22:08:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:47,990 INFO L93 Difference]: Finished difference Result 309 states and 459 transitions. [2024-10-31 22:08:47,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:08:47,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2024-10-31 22:08:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:48,012 INFO L225 Difference]: With dead ends: 309 [2024-10-31 22:08:48,012 INFO L226 Difference]: Without dead ends: 185 [2024-10-31 22:08:48,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:48,021 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:48,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 801 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-31 22:08:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-31 22:08:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.483695652173913) internal successors, (273), 184 states have internal predecessors, (273), 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-31 22:08:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 273 transitions. [2024-10-31 22:08:48,098 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 273 transitions. Word has length 57 [2024-10-31 22:08:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:48,099 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 273 transitions. [2024-10-31 22:08:48,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-31 22:08:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 273 transitions. [2024-10-31 22:08:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-31 22:08:48,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:48,104 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] [2024-10-31 22:08:48,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:08:48,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:48,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:48,107 INFO L85 PathProgramCache]: Analyzing trace with hash -897346301, now seen corresponding path program 1 times [2024-10-31 22:08:48,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:48,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097598164] [2024-10-31 22:08:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,605 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-31 22:08:48,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:48,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097598164] [2024-10-31 22:08:48,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097598164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:48,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:48,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518277433] [2024-10-31 22:08:48,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:48,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:08:48,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:48,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:08:48,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:48,616 INFO L87 Difference]: Start difference. First operand 185 states and 273 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-31 22:08:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:48,701 INFO L93 Difference]: Finished difference Result 310 states and 457 transitions. [2024-10-31 22:08:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:08:48,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2024-10-31 22:08:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:48,706 INFO L225 Difference]: With dead ends: 310 [2024-10-31 22:08:48,706 INFO L226 Difference]: Without dead ends: 187 [2024-10-31 22:08:48,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:48,712 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:48,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 797 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-31 22:08:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-10-31 22:08:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.478494623655914) internal successors, (275), 186 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-31 22:08:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 275 transitions. [2024-10-31 22:08:48,732 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 275 transitions. Word has length 58 [2024-10-31 22:08:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:48,733 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 275 transitions. [2024-10-31 22:08:48,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-31 22:08:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 275 transitions. [2024-10-31 22:08:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:08:48,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:48,736 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] [2024-10-31 22:08:48,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:08:48,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:48,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1149070137, now seen corresponding path program 1 times [2024-10-31 22:08:48,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:48,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227250568] [2024-10-31 22:08:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:48,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,138 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-31 22:08:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227250568] [2024-10-31 22:08:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227250568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:08:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667390510] [2024-10-31 22:08:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:50,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:08:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:50,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:08:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:08:50,144 INFO L87 Difference]: Start difference. First operand 187 states and 275 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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-31 22:08:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:50,327 INFO L93 Difference]: Finished difference Result 319 states and 469 transitions. [2024-10-31 22:08:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:08:50,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 59 [2024-10-31 22:08:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:50,333 INFO L225 Difference]: With dead ends: 319 [2024-10-31 22:08:50,335 INFO L226 Difference]: Without dead ends: 194 [2024-10-31 22:08:50,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:08:50,337 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 233 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:50,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1301 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-31 22:08:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2024-10-31 22:08:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.46875) internal successors, (282), 192 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-31 22:08:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 282 transitions. [2024-10-31 22:08:50,362 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 282 transitions. Word has length 59 [2024-10-31 22:08:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:50,363 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 282 transitions. [2024-10-31 22:08:50,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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-31 22:08:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 282 transitions. [2024-10-31 22:08:50,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-31 22:08:50,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:50,364 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] [2024-10-31 22:08:50,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:08:50,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:50,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1468985978, now seen corresponding path program 1 times [2024-10-31 22:08:50,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:50,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781854054] [2024-10-31 22:08:50,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:50,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,327 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-31 22:08:52,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:52,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781854054] [2024-10-31 22:08:52,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781854054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:52,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:52,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-31 22:08:52,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852707024] [2024-10-31 22:08:52,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:52,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-31 22:08:52,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:52,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-31 22:08:52,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:08:52,332 INFO L87 Difference]: Start difference. First operand 193 states and 282 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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-31 22:08:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:53,052 INFO L93 Difference]: Finished difference Result 354 states and 516 transitions. [2024-10-31 22:08:53,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 22:08:53,053 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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 60 [2024-10-31 22:08:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:53,054 INFO L225 Difference]: With dead ends: 354 [2024-10-31 22:08:53,055 INFO L226 Difference]: Without dead ends: 223 [2024-10-31 22:08:53,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2024-10-31 22:08:53,057 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 303 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:53,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 3455 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:08:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-31 22:08:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2024-10-31 22:08:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4722222222222223) internal successors, (318), 216 states have internal predecessors, (318), 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-31 22:08:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 318 transitions. [2024-10-31 22:08:53,072 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 318 transitions. Word has length 60 [2024-10-31 22:08:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:53,073 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 318 transitions. [2024-10-31 22:08:53,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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-31 22:08:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 318 transitions. [2024-10-31 22:08:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-31 22:08:53,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:53,083 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] [2024-10-31 22:08:53,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:08:53,084 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:53,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:53,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2124644278, now seen corresponding path program 1 times [2024-10-31 22:08:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:53,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834661927] [2024-10-31 22:08:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:53,895 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-31 22:08:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:53,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834661927] [2024-10-31 22:08:53,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834661927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:53,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:53,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:08:53,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361907600] [2024-10-31 22:08:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:53,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:08:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:53,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:08:53,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:08:53,899 INFO L87 Difference]: Start difference. First operand 217 states and 318 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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-31 22:08:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:54,088 INFO L93 Difference]: Finished difference Result 391 states and 571 transitions. [2024-10-31 22:08:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:08:54,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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 60 [2024-10-31 22:08:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:54,091 INFO L225 Difference]: With dead ends: 391 [2024-10-31 22:08:54,091 INFO L226 Difference]: Without dead ends: 236 [2024-10-31 22:08:54,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:08:54,093 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 243 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:54,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1777 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-31 22:08:54,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 231. [2024-10-31 22:08:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4695652173913043) internal successors, (338), 230 states have internal predecessors, (338), 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-31 22:08:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 338 transitions. [2024-10-31 22:08:54,111 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 338 transitions. Word has length 60 [2024-10-31 22:08:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:54,112 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 338 transitions. [2024-10-31 22:08:54,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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-31 22:08:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 338 transitions. [2024-10-31 22:08:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-31 22:08:54,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:54,117 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] [2024-10-31 22:08:54,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:08:54,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:54,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:54,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1979474159, now seen corresponding path program 1 times [2024-10-31 22:08:54,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:54,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983015310] [2024-10-31 22:08:54,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:54,369 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-31 22:08:54,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:54,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983015310] [2024-10-31 22:08:54,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983015310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:54,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:54,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:54,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730309728] [2024-10-31 22:08:54,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:54,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:54,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:54,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:54,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:54,372 INFO L87 Difference]: Start difference. First operand 231 states and 338 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-31 22:08:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:54,459 INFO L93 Difference]: Finished difference Result 486 states and 705 transitions. [2024-10-31 22:08:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:08:54,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 60 [2024-10-31 22:08:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:54,462 INFO L225 Difference]: With dead ends: 486 [2024-10-31 22:08:54,462 INFO L226 Difference]: Without dead ends: 317 [2024-10-31 22:08:54,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-31 22:08:54,464 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 355 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:54,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 780 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-31 22:08:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 287. [2024-10-31 22:08:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.465034965034965) internal successors, (419), 286 states have internal predecessors, (419), 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-31 22:08:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 419 transitions. [2024-10-31 22:08:54,474 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 419 transitions. Word has length 60 [2024-10-31 22:08:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:54,474 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 419 transitions. [2024-10-31 22:08:54,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-31 22:08:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 419 transitions. [2024-10-31 22:08:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-31 22:08:54,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:54,477 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] [2024-10-31 22:08:54,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:08:54,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:54,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:54,478 INFO L85 PathProgramCache]: Analyzing trace with hash 125082261, now seen corresponding path program 1 times [2024-10-31 22:08:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517401140] [2024-10-31 22:08:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,107 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-31 22:08:55,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:55,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517401140] [2024-10-31 22:08:55,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517401140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:55,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:55,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:08:55,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542007068] [2024-10-31 22:08:55,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:55,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:08:55,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:55,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:08:55,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:08:55,112 INFO L87 Difference]: Start difference. First operand 287 states and 419 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-31 22:08:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:55,258 INFO L93 Difference]: Finished difference Result 487 states and 709 transitions. [2024-10-31 22:08:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:08:55,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 61 [2024-10-31 22:08:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:55,261 INFO L225 Difference]: With dead ends: 487 [2024-10-31 22:08:55,261 INFO L226 Difference]: Without dead ends: 311 [2024-10-31 22:08:55,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:08:55,265 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 244 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:55,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1568 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-31 22:08:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-31 22:08:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 1.4451612903225806) internal successors, (448), 310 states have internal predecessors, (448), 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-31 22:08:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 448 transitions. [2024-10-31 22:08:55,279 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 448 transitions. Word has length 61 [2024-10-31 22:08:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:55,279 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 448 transitions. [2024-10-31 22:08:55,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-31 22:08:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 448 transitions. [2024-10-31 22:08:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-31 22:08:55,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:55,281 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] [2024-10-31 22:08:55,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:08:55,281 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:55,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash -594321589, now seen corresponding path program 1 times [2024-10-31 22:08:55,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:55,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198294800] [2024-10-31 22:08:55,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:55,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:55,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:55,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198294800] [2024-10-31 22:08:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198294800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:55,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:55,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:08:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086281151] [2024-10-31 22:08:55,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:55,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:08:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:55,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:08:55,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:08:55,873 INFO L87 Difference]: Start difference. First operand 311 states and 448 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-31 22:08:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:56,001 INFO L93 Difference]: Finished difference Result 560 states and 805 transitions. [2024-10-31 22:08:56,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:08:56,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 61 [2024-10-31 22:08:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:56,030 INFO L225 Difference]: With dead ends: 560 [2024-10-31 22:08:56,031 INFO L226 Difference]: Without dead ends: 351 [2024-10-31 22:08:56,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:08:56,032 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 248 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:56,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1567 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-31 22:08:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-10-31 22:08:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 1.4257142857142857) internal successors, (499), 350 states have internal predecessors, (499), 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-31 22:08:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 499 transitions. [2024-10-31 22:08:56,044 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 499 transitions. Word has length 61 [2024-10-31 22:08:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:56,046 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 499 transitions. [2024-10-31 22:08:56,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-31 22:08:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 499 transitions. [2024-10-31 22:08:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-31 22:08:56,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:56,048 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] [2024-10-31 22:08:56,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:08:56,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:56,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1321086045, now seen corresponding path program 1 times [2024-10-31 22:08:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:56,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780176177] [2024-10-31 22:08:56,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:56,274 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-31 22:08:56,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780176177] [2024-10-31 22:08:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780176177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:56,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:56,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345266371] [2024-10-31 22:08:56,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:56,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:56,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:56,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:56,278 INFO L87 Difference]: Start difference. First operand 351 states and 499 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-31 22:08:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:56,361 INFO L93 Difference]: Finished difference Result 640 states and 897 transitions. [2024-10-31 22:08:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:08:56,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 61 [2024-10-31 22:08:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:56,366 INFO L225 Difference]: With dead ends: 640 [2024-10-31 22:08:56,366 INFO L226 Difference]: Without dead ends: 374 [2024-10-31 22:08:56,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-31 22:08:56,367 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 361 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:56,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 780 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-31 22:08:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 342. [2024-10-31 22:08:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 1.4193548387096775) internal successors, (484), 341 states have internal predecessors, (484), 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-31 22:08:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 484 transitions. [2024-10-31 22:08:56,380 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 484 transitions. Word has length 61 [2024-10-31 22:08:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:56,383 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 484 transitions. [2024-10-31 22:08:56,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-31 22:08:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 484 transitions. [2024-10-31 22:08:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-31 22:08:56,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:56,384 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] [2024-10-31 22:08:56,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:08:56,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:56,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:56,385 INFO L85 PathProgramCache]: Analyzing trace with hash -597014213, now seen corresponding path program 1 times [2024-10-31 22:08:56,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:56,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740392536] [2024-10-31 22:08:56,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:56,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:56,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740392536] [2024-10-31 22:08:56,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740392536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:56,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:56,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:56,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801404282] [2024-10-31 22:08:56,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:56,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:56,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:56,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:56,601 INFO L87 Difference]: Start difference. First operand 342 states and 484 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-31 22:08:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:56,687 INFO L93 Difference]: Finished difference Result 579 states and 813 transitions. [2024-10-31 22:08:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:08:56,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2024-10-31 22:08:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:56,689 INFO L225 Difference]: With dead ends: 579 [2024-10-31 22:08:56,689 INFO L226 Difference]: Without dead ends: 344 [2024-10-31 22:08:56,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-31 22:08:56,691 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 339 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:56,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 780 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-31 22:08:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 317. [2024-10-31 22:08:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.4145569620253164) internal successors, (447), 316 states have internal predecessors, (447), 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-31 22:08:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 447 transitions. [2024-10-31 22:08:56,701 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 447 transitions. Word has length 62 [2024-10-31 22:08:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:56,701 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 447 transitions. [2024-10-31 22:08:56,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-31 22:08:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 447 transitions. [2024-10-31 22:08:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-31 22:08:56,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:56,703 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] [2024-10-31 22:08:56,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:08:56,703 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:56,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1768191416, now seen corresponding path program 1 times [2024-10-31 22:08:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:56,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962752792] [2024-10-31 22:08:56,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:56,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:57,392 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-31 22:08:57,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:57,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962752792] [2024-10-31 22:08:57,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962752792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:57,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:57,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:08:57,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623550749] [2024-10-31 22:08:57,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:57,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:08:57,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:57,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:08:57,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:08:57,395 INFO L87 Difference]: Start difference. First operand 317 states and 447 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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-31 22:08:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:57,557 INFO L93 Difference]: Finished difference Result 588 states and 828 transitions. [2024-10-31 22:08:57,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:08:57,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 62 [2024-10-31 22:08:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:57,560 INFO L225 Difference]: With dead ends: 588 [2024-10-31 22:08:57,560 INFO L226 Difference]: Without dead ends: 348 [2024-10-31 22:08:57,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:08:57,561 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 252 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:57,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1567 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:57,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-31 22:08:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-10-31 22:08:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.4005763688760806) internal successors, (486), 347 states have internal predecessors, (486), 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-31 22:08:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 486 transitions. [2024-10-31 22:08:57,571 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 486 transitions. Word has length 62 [2024-10-31 22:08:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:57,571 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 486 transitions. [2024-10-31 22:08:57,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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-31 22:08:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 486 transitions. [2024-10-31 22:08:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-31 22:08:57,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:57,572 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] [2024-10-31 22:08:57,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:08:57,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:57,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:57,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1744500801, now seen corresponding path program 1 times [2024-10-31 22:08:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:57,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932481113] [2024-10-31 22:08:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:57,794 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-31 22:08:57,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:57,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932481113] [2024-10-31 22:08:57,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932481113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:57,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:57,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:57,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350246858] [2024-10-31 22:08:57,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:57,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:57,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:57,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:57,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:57,796 INFO L87 Difference]: Start difference. First operand 348 states and 486 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-31 22:08:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:57,886 INFO L93 Difference]: Finished difference Result 610 states and 845 transitions. [2024-10-31 22:08:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:08:57,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2024-10-31 22:08:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:57,888 INFO L225 Difference]: With dead ends: 610 [2024-10-31 22:08:57,888 INFO L226 Difference]: Without dead ends: 350 [2024-10-31 22:08:57,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-31 22:08:57,889 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 331 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:57,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 780 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-31 22:08:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 325. [2024-10-31 22:08:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.3981481481481481) internal successors, (453), 324 states have internal predecessors, (453), 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-31 22:08:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 453 transitions. [2024-10-31 22:08:57,900 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 453 transitions. Word has length 62 [2024-10-31 22:08:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:57,900 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 453 transitions. [2024-10-31 22:08:57,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-31 22:08:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 453 transitions. [2024-10-31 22:08:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-31 22:08:57,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:57,902 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] [2024-10-31 22:08:57,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:08:57,902 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:57,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash 736704605, now seen corresponding path program 1 times [2024-10-31 22:08:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:57,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072248111] [2024-10-31 22:08:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,098 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-31 22:08:59,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:59,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072248111] [2024-10-31 22:08:59,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072248111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:59,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:59,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-31 22:08:59,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787192786] [2024-10-31 22:08:59,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:59,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-31 22:08:59,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:59,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-31 22:08:59,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:08:59,102 INFO L87 Difference]: Start difference. First operand 325 states and 453 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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-31 22:08:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:59,588 INFO L93 Difference]: Finished difference Result 610 states and 851 transitions. [2024-10-31 22:08:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 22:08:59,589 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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 63 [2024-10-31 22:08:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:59,590 INFO L225 Difference]: With dead ends: 610 [2024-10-31 22:08:59,590 INFO L226 Difference]: Without dead ends: 382 [2024-10-31 22:08:59,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:08:59,592 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 249 mSDsluCounter, 3401 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 3667 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:59,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 3667 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:08:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-10-31 22:08:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 365. [2024-10-31 22:08:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.3928571428571428) internal successors, (507), 364 states have internal predecessors, (507), 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-31 22:08:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 507 transitions. [2024-10-31 22:08:59,603 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 507 transitions. Word has length 63 [2024-10-31 22:08:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:59,603 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 507 transitions. [2024-10-31 22:08:59,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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-31 22:08:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 507 transitions. [2024-10-31 22:08:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-31 22:08:59,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:59,605 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] [2024-10-31 22:08:59,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:08:59,605 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:59,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:59,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1355141814, now seen corresponding path program 1 times [2024-10-31 22:08:59,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:59,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383829696] [2024-10-31 22:08:59,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:59,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,830 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-31 22:08:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383829696] [2024-10-31 22:08:59,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383829696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:59,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:59,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:59,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786377124] [2024-10-31 22:08:59,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:59,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:59,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:59,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:59,832 INFO L87 Difference]: Start difference. First operand 365 states and 507 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-31 22:08:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:59,911 INFO L93 Difference]: Finished difference Result 651 states and 902 transitions. [2024-10-31 22:08:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:08:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2024-10-31 22:08:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:59,913 INFO L225 Difference]: With dead ends: 651 [2024-10-31 22:08:59,913 INFO L226 Difference]: Without dead ends: 355 [2024-10-31 22:08:59,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-31 22:08:59,915 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 311 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:59,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 780 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:08:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-31 22:08:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 337. [2024-10-31 22:08:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.4107142857142858) internal successors, (474), 336 states have internal predecessors, (474), 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-31 22:08:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 474 transitions. [2024-10-31 22:08:59,924 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 474 transitions. Word has length 63 [2024-10-31 22:08:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:59,925 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 474 transitions. [2024-10-31 22:08:59,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-31 22:08:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 474 transitions. [2024-10-31 22:08:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-31 22:08:59,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:59,926 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] [2024-10-31 22:08:59,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:08:59,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:59,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1367415582, now seen corresponding path program 1 times [2024-10-31 22:08:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:59,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789498394] [2024-10-31 22:08:59,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:09:00,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:09:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:09:00,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:09:00,146 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:09:00,147 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:09:00,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:09:00,154 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:00,259 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:09:00,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:09:00 BoogieIcfgContainer [2024-10-31 22:09:00,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:09:00,263 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:09:00,265 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:09:00,265 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:09:00,266 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:08:46" (3/4) ... [2024-10-31 22:09:00,269 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:09:00,270 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:09:00,271 INFO L158 Benchmark]: Toolchain (without parser) took 18311.91ms. Allocated memory was 167.8MB in the beginning and 576.7MB in the end (delta: 408.9MB). Free memory was 129.8MB in the beginning and 196.8MB in the end (delta: -67.1MB). Peak memory consumption was 341.9MB. Max. memory is 16.1GB. [2024-10-31 22:09:00,271 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:09:00,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 918.44ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 97.4MB in the end (delta: 31.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-31 22:09:00,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 289.56ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 68.0MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-31 22:09:00,272 INFO L158 Benchmark]: Boogie Preprocessor took 371.95ms. Allocated memory is still 167.8MB. Free memory was 68.0MB in the beginning and 43.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-31 22:09:00,272 INFO L158 Benchmark]: RCFGBuilder took 3020.93ms. Allocated memory was 167.8MB in the beginning and 281.0MB in the end (delta: 113.2MB). Free memory was 43.8MB in the beginning and 173.7MB in the end (delta: -129.9MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-10-31 22:09:00,273 INFO L158 Benchmark]: TraceAbstraction took 13695.84ms. Allocated memory was 281.0MB in the beginning and 576.7MB in the end (delta: 295.7MB). Free memory was 173.7MB in the beginning and 196.8MB in the end (delta: -23.2MB). Peak memory consumption was 272.5MB. Max. memory is 16.1GB. [2024-10-31 22:09:00,274 INFO L158 Benchmark]: Witness Printer took 7.01ms. Allocated memory is still 576.7MB. Free memory is still 196.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:09:00,276 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 918.44ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 97.4MB in the end (delta: 31.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 289.56ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 68.0MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 371.95ms. Allocated memory is still 167.8MB. Free memory was 68.0MB in the beginning and 43.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 3020.93ms. Allocated memory was 167.8MB in the beginning and 281.0MB in the end (delta: 113.2MB). Free memory was 43.8MB in the beginning and 173.7MB in the end (delta: -129.9MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13695.84ms. Allocated memory was 281.0MB in the beginning and 576.7MB in the end (delta: 295.7MB). Free memory was 173.7MB in the beginning and 196.8MB in the end (delta: -23.2MB). Peak memory consumption was 272.5MB. Max. memory is 16.1GB. * Witness Printer took 7.01ms. Allocated memory is still 576.7MB. Free memory is still 196.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 375. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 4); [L30] const SORT_7 msb_SORT_7 = (SORT_7)1 << (4 - 1); [L32] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 32); [L33] const SORT_11 msb_SORT_11 = (SORT_11)1 << (32 - 1); [L35] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 3); [L36] const SORT_37 msb_SORT_37 = (SORT_37)1 << (3 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 2); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (2 - 1); [L41] const SORT_7 var_8 = 0; [L42] const SORT_11 var_13 = 0; [L43] const SORT_11 var_16 = 8; [L44] const SORT_11 var_20 = 4; [L45] const SORT_11 var_24 = 2; [L46] const SORT_11 var_28 = 1; [L47] const SORT_1 var_33 = 1; [L48] const SORT_37 var_38 = 0; [L49] const SORT_1 var_47 = 0; [L50] const SORT_67 var_68 = 0; [L51] const SORT_67 var_71 = 1; [L52] const SORT_37 var_81 = 7; [L53] const SORT_37 var_104 = 1; [L54] const SORT_37 var_123 = 2; [L55] const SORT_37 var_138 = 4; [L56] const SORT_67 var_154 = 2; [L57] const SORT_7 var_394 = 8; [L58] const SORT_7 var_397 = 4; [L59] const SORT_7 var_400 = 2; [L60] const SORT_7 var_401 = 1; [L62] SORT_1 input_2; [L63] SORT_1 input_3; [L64] SORT_1 input_4; [L65] SORT_1 input_5; [L66] SORT_1 input_6; [L67] SORT_37 input_75; [L68] SORT_37 input_76; [L69] SORT_37 input_77; [L70] SORT_37 input_78; [L71] SORT_37 input_79; [L72] SORT_37 input_80; [L73] SORT_37 input_85; [L74] SORT_37 input_87; [L75] SORT_37 input_89; [L76] SORT_37 input_94; [L77] SORT_37 input_96; [L78] SORT_37 input_98; [L79] SORT_37 input_102; [L80] SORT_37 input_103; [L81] SORT_37 input_108; [L82] SORT_37 input_110; [L83] SORT_37 input_115; [L84] SORT_37 input_117; [L85] SORT_37 input_121; [L86] SORT_37 input_122; [L87] SORT_37 input_127; [L88] SORT_37 input_132; [L89] SORT_37 input_136; [L90] SORT_37 input_137; [L91] SORT_37 input_149; [L92] SORT_37 input_160; [L93] SORT_37 input_161; [L94] SORT_37 input_162; [L95] SORT_37 input_163; [L96] SORT_37 input_164; [L97] SORT_37 input_165; [L98] SORT_37 input_168; [L99] SORT_37 input_170; [L100] SORT_37 input_172; [L101] SORT_37 input_177; [L102] SORT_37 input_179; [L103] SORT_37 input_181; [L104] SORT_37 input_185; [L105] SORT_37 input_186; [L106] SORT_37 input_189; [L107] SORT_37 input_191; [L108] SORT_37 input_196; [L109] SORT_37 input_198; [L110] SORT_37 input_202; [L111] SORT_37 input_203; [L112] SORT_37 input_206; [L113] SORT_37 input_211; [L114] SORT_37 input_215; [L115] SORT_37 input_216; [L116] SORT_37 input_226; [L117] SORT_37 input_233; [L118] SORT_37 input_234; [L119] SORT_37 input_235; [L120] SORT_37 input_236; [L121] SORT_37 input_237; [L122] SORT_37 input_238; [L123] SORT_37 input_241; [L124] SORT_37 input_243; [L125] SORT_37 input_245; [L126] SORT_37 input_250; [L127] SORT_37 input_252; [L128] SORT_37 input_254; [L129] SORT_37 input_258; [L130] SORT_37 input_259; [L131] SORT_37 input_262; [L132] SORT_37 input_264; [L133] SORT_37 input_269; [L134] SORT_37 input_271; [L135] SORT_37 input_275; [L136] SORT_37 input_276; [L137] SORT_37 input_279; [L138] SORT_37 input_284; [L139] SORT_37 input_288; [L140] SORT_37 input_289; [L141] SORT_37 input_299; [L142] SORT_37 input_306; [L143] SORT_37 input_307; [L144] SORT_37 input_308; [L145] SORT_37 input_309; [L146] SORT_37 input_310; [L147] SORT_37 input_311; [L148] SORT_37 input_314; [L149] SORT_37 input_316; [L150] SORT_37 input_318; [L151] SORT_37 input_323; [L152] SORT_37 input_325; [L153] SORT_37 input_327; [L154] SORT_37 input_331; [L155] SORT_37 input_332; [L156] SORT_37 input_335; [L157] SORT_37 input_337; [L158] SORT_37 input_342; [L159] SORT_37 input_344; [L160] SORT_37 input_348; [L161] SORT_37 input_349; [L162] SORT_37 input_352; [L163] SORT_37 input_357; [L164] SORT_37 input_361; [L165] SORT_37 input_362; [L166] SORT_37 input_372; [L167] SORT_7 input_391; [L168] SORT_7 input_392; [L169] SORT_7 input_393; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L171] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L172] SORT_37 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L173] SORT_37 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L174] SORT_37 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L175] SORT_37 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L176] SORT_1 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L177] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L178] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L179] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L179] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L180] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L180] SORT_7 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L181] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L181] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L182] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L182] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L183] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L183] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L184] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L184] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L185] EXPR __VERIFIER_nondet_uchar() & mask_SORT_67 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_47=0, var_68=0, var_71=1, var_81=7, var_8=0] [L185] SORT_67 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_67; [L187] SORT_7 init_10_arg_1 = var_8; [L188] state_9 = init_10_arg_1 [L189] SORT_37 init_40_arg_1 = var_38; [L190] state_39 = init_40_arg_1 [L191] SORT_37 init_42_arg_1 = var_38; [L192] state_41 = init_42_arg_1 [L193] SORT_37 init_44_arg_1 = var_38; [L194] state_43 = init_44_arg_1 [L195] SORT_37 init_46_arg_1 = var_38; [L196] state_45 = init_46_arg_1 [L197] SORT_1 init_49_arg_1 = var_47; [L198] state_48 = init_49_arg_1 [L199] SORT_1 init_51_arg_1 = var_47; [L200] state_50 = init_51_arg_1 [L201] SORT_1 init_53_arg_1 = var_47; [L202] state_52 = init_53_arg_1 [L203] SORT_1 init_55_arg_1 = var_47; [L204] state_54 = init_55_arg_1 [L205] SORT_7 init_57_arg_1 = var_8; [L206] state_56 = init_57_arg_1 [L207] SORT_1 init_60_arg_1 = var_47; [L208] state_59 = init_60_arg_1 [L209] SORT_1 init_62_arg_1 = var_47; [L210] state_61 = init_62_arg_1 [L211] SORT_1 init_64_arg_1 = var_47; [L212] state_63 = init_64_arg_1 [L213] SORT_1 init_66_arg_1 = var_47; [L214] state_65 = init_66_arg_1 [L215] SORT_67 init_70_arg_1 = var_68; [L216] state_69 = init_70_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L219] input_2 = __VERIFIER_nondet_uchar() [L220] input_3 = __VERIFIER_nondet_uchar() [L221] input_4 = __VERIFIER_nondet_uchar() [L222] input_5 = __VERIFIER_nondet_uchar() [L223] input_6 = __VERIFIER_nondet_uchar() [L224] input_75 = __VERIFIER_nondet_uchar() [L225] input_76 = __VERIFIER_nondet_uchar() [L226] input_77 = __VERIFIER_nondet_uchar() [L227] input_78 = __VERIFIER_nondet_uchar() [L228] input_79 = __VERIFIER_nondet_uchar() [L229] input_80 = __VERIFIER_nondet_uchar() [L230] input_85 = __VERIFIER_nondet_uchar() [L231] input_87 = __VERIFIER_nondet_uchar() [L232] input_89 = __VERIFIER_nondet_uchar() [L233] input_94 = __VERIFIER_nondet_uchar() [L234] input_96 = __VERIFIER_nondet_uchar() [L235] input_98 = __VERIFIER_nondet_uchar() [L236] input_102 = __VERIFIER_nondet_uchar() [L237] input_103 = __VERIFIER_nondet_uchar() [L238] input_108 = __VERIFIER_nondet_uchar() [L239] input_110 = __VERIFIER_nondet_uchar() [L240] input_115 = __VERIFIER_nondet_uchar() [L241] input_117 = __VERIFIER_nondet_uchar() [L242] input_121 = __VERIFIER_nondet_uchar() [L243] input_122 = __VERIFIER_nondet_uchar() [L244] input_127 = __VERIFIER_nondet_uchar() [L245] input_132 = __VERIFIER_nondet_uchar() [L246] input_136 = __VERIFIER_nondet_uchar() [L247] input_137 = __VERIFIER_nondet_uchar() [L248] input_149 = __VERIFIER_nondet_uchar() [L249] input_160 = __VERIFIER_nondet_uchar() [L250] input_161 = __VERIFIER_nondet_uchar() [L251] input_162 = __VERIFIER_nondet_uchar() [L252] input_163 = __VERIFIER_nondet_uchar() [L253] input_164 = __VERIFIER_nondet_uchar() [L254] input_165 = __VERIFIER_nondet_uchar() [L255] input_168 = __VERIFIER_nondet_uchar() [L256] input_170 = __VERIFIER_nondet_uchar() [L257] input_172 = __VERIFIER_nondet_uchar() [L258] input_177 = __VERIFIER_nondet_uchar() [L259] input_179 = __VERIFIER_nondet_uchar() [L260] input_181 = __VERIFIER_nondet_uchar() [L261] input_185 = __VERIFIER_nondet_uchar() [L262] input_186 = __VERIFIER_nondet_uchar() [L263] input_189 = __VERIFIER_nondet_uchar() [L264] input_191 = __VERIFIER_nondet_uchar() [L265] input_196 = __VERIFIER_nondet_uchar() [L266] input_198 = __VERIFIER_nondet_uchar() [L267] input_202 = __VERIFIER_nondet_uchar() [L268] input_203 = __VERIFIER_nondet_uchar() [L269] input_206 = __VERIFIER_nondet_uchar() [L270] input_211 = __VERIFIER_nondet_uchar() [L271] input_215 = __VERIFIER_nondet_uchar() [L272] input_216 = __VERIFIER_nondet_uchar() [L273] input_226 = __VERIFIER_nondet_uchar() [L274] input_233 = __VERIFIER_nondet_uchar() [L275] input_234 = __VERIFIER_nondet_uchar() [L276] input_235 = __VERIFIER_nondet_uchar() [L277] input_236 = __VERIFIER_nondet_uchar() [L278] input_237 = __VERIFIER_nondet_uchar() [L279] input_238 = __VERIFIER_nondet_uchar() [L280] input_241 = __VERIFIER_nondet_uchar() [L281] input_243 = __VERIFIER_nondet_uchar() [L282] input_245 = __VERIFIER_nondet_uchar() [L283] input_250 = __VERIFIER_nondet_uchar() [L284] input_252 = __VERIFIER_nondet_uchar() [L285] input_254 = __VERIFIER_nondet_uchar() [L286] input_258 = __VERIFIER_nondet_uchar() [L287] input_259 = __VERIFIER_nondet_uchar() [L288] input_262 = __VERIFIER_nondet_uchar() [L289] input_264 = __VERIFIER_nondet_uchar() [L290] input_269 = __VERIFIER_nondet_uchar() [L291] input_271 = __VERIFIER_nondet_uchar() [L292] input_275 = __VERIFIER_nondet_uchar() [L293] input_276 = __VERIFIER_nondet_uchar() [L294] input_279 = __VERIFIER_nondet_uchar() [L295] input_284 = __VERIFIER_nondet_uchar() [L296] input_288 = __VERIFIER_nondet_uchar() [L297] input_289 = __VERIFIER_nondet_uchar() [L298] input_299 = __VERIFIER_nondet_uchar() [L299] input_306 = __VERIFIER_nondet_uchar() [L300] input_307 = __VERIFIER_nondet_uchar() [L301] input_308 = __VERIFIER_nondet_uchar() [L302] input_309 = __VERIFIER_nondet_uchar() [L303] input_310 = __VERIFIER_nondet_uchar() [L304] input_311 = __VERIFIER_nondet_uchar() [L305] input_314 = __VERIFIER_nondet_uchar() [L306] input_316 = __VERIFIER_nondet_uchar() [L307] input_318 = __VERIFIER_nondet_uchar() [L308] input_323 = __VERIFIER_nondet_uchar() [L309] input_325 = __VERIFIER_nondet_uchar() [L310] input_327 = __VERIFIER_nondet_uchar() [L311] input_331 = __VERIFIER_nondet_uchar() [L312] input_332 = __VERIFIER_nondet_uchar() [L313] input_335 = __VERIFIER_nondet_uchar() [L314] input_337 = __VERIFIER_nondet_uchar() [L315] input_342 = __VERIFIER_nondet_uchar() [L316] input_344 = __VERIFIER_nondet_uchar() [L317] input_348 = __VERIFIER_nondet_uchar() [L318] input_349 = __VERIFIER_nondet_uchar() [L319] input_352 = __VERIFIER_nondet_uchar() [L320] input_357 = __VERIFIER_nondet_uchar() [L321] input_361 = __VERIFIER_nondet_uchar() [L322] input_362 = __VERIFIER_nondet_uchar() [L323] input_372 = __VERIFIER_nondet_uchar() [L324] input_391 = __VERIFIER_nondet_uchar() [L325] input_392 = __VERIFIER_nondet_uchar() [L326] input_393 = __VERIFIER_nondet_uchar() [L329] SORT_7 var_12_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_12_arg_0=0, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L330] EXPR var_12_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L330] var_12_arg_0 = var_12_arg_0 & mask_SORT_7 [L331] SORT_11 var_12 = var_12_arg_0; [L332] SORT_11 var_14_arg_0 = var_12; [L333] SORT_11 var_14_arg_1 = var_13; [L334] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L335] SORT_7 var_15_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_14=1, var_154=2, var_15_arg_0=0, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L336] EXPR var_15_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_14=1, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L336] var_15_arg_0 = var_15_arg_0 & mask_SORT_7 [L337] SORT_11 var_15 = var_15_arg_0; [L338] SORT_11 var_17_arg_0 = var_15; [L339] SORT_11 var_17_arg_1 = var_16; [L340] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L341] SORT_1 var_18_arg_0 = var_14; [L342] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18_arg_0=1, var_18_arg_1=0, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L343] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L343] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L344] SORT_7 var_19_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18=1, var_19_arg_0=0, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L345] EXPR var_19_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_18=1, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L345] var_19_arg_0 = var_19_arg_0 & mask_SORT_7 [L346] SORT_11 var_19 = var_19_arg_0; [L347] SORT_11 var_21_arg_0 = var_19; [L348] SORT_11 var_21_arg_1 = var_20; [L349] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L350] SORT_1 var_22_arg_0 = var_18; [L351] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22_arg_0=1, var_22_arg_1=0, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L352] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L352] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L353] SORT_7 var_23_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22=1, var_23_arg_0=0, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L354] EXPR var_23_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_22=1, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L354] var_23_arg_0 = var_23_arg_0 & mask_SORT_7 [L355] SORT_11 var_23 = var_23_arg_0; [L356] SORT_11 var_25_arg_0 = var_23; [L357] SORT_11 var_25_arg_1 = var_24; [L358] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L359] SORT_1 var_26_arg_0 = var_22; [L360] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26_arg_0=1, var_26_arg_1=0, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L361] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L361] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L362] SORT_7 var_27_arg_0 = state_9; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26=1, var_27_arg_0=0, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L363] EXPR var_27_arg_0 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_26=1, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L363] var_27_arg_0 = var_27_arg_0 & mask_SORT_7 [L364] SORT_11 var_27 = var_27_arg_0; [L365] SORT_11 var_29_arg_0 = var_27; [L366] SORT_11 var_29_arg_1 = var_28; [L367] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L368] SORT_1 var_30_arg_0 = var_26; [L369] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_30_arg_0=1, var_30_arg_1=0, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L370] EXPR var_30_arg_0 | var_30_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L370] SORT_1 var_30 = var_30_arg_0 | var_30_arg_1; [L371] SORT_1 var_34_arg_0 = var_30; [L372] SORT_1 var_34 = ~var_34_arg_0; [L373] SORT_1 var_35_arg_0 = var_33; [L374] SORT_1 var_35_arg_1 = var_34; VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_35_arg_0=1, var_35_arg_1=-2, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L375] EXPR var_35_arg_0 & var_35_arg_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L375] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L376] EXPR var_35 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_37=7, mask_SORT_67=3, mask_SORT_7=15, state_39=0, state_41=0, state_43=0, state_45=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_9=0, var_104=1, var_123=2, var_138=4, var_13=0, var_154=2, var_16=8, var_20=4, var_24=2, var_28=1, var_33=1, var_38=0, var_394=8, var_397=4, var_400=2, var_401=1, var_68=0, var_71=1, var_81=7, var_8=0] [L376] var_35 = var_35 & mask_SORT_1 [L377] SORT_1 bad_36_arg_0 = var_35; [L378] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 186 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3469 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3469 mSDsluCounter, 20400 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16726 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1291 IncrementalHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 3674 mSDtfsCounter, 1291 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=13, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 161 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 835 ConstructedInterpolants, 0 QuantifiedInterpolants, 2682 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:09:00,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU --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 64bit --witnessprinter.graph.data.programhash a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:09:02,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:09:02,992 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-31 22:09:03,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:09:03,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:09:03,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:09:03,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:09:03,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:09:03,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:09:03,043 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:09:03,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:09:03,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:09:03,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:09:03,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:09:03,046 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:09:03,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:09:03,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:09:03,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:09:03,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:09:03,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:09:03,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:09:03,049 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:09:03,050 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:09:03,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:09:03,054 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:09:03,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:09:03,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:09:03,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:09:03,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:09:03,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:09:03,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:09:03,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:09:03,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:09:03,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:09:03,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:09:03,058 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:09:03,058 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:09:03,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:09:03,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:09:03,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:09:03,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:09:03,062 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:09:03,062 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9990c01c9a1f9597f7bc9fb384dfed8f76d280524d4aa5e1bce8b343e8f7c08 [2024-10-31 22:09:03,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:09:03,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:09:03,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:09:03,614 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:09:03,615 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:09:03,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c Unable to find full path for "g++" [2024-10-31 22:09:05,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:09:06,460 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:09:06,465 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c [2024-10-31 22:09:06,484 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/data/d51687e96/1f2417e3a3b14335936c296a9d11ea72/FLAG053217ab6 [2024-10-31 22:09:06,505 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/bin/uautomizer-verify-4GaUIPS5ZU/data/d51687e96/1f2417e3a3b14335936c296a9d11ea72 [2024-10-31 22:09:06,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:09:06,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:09:06,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:09:06,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:09:06,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:09:06,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:09:06" (1/1) ... [2024-10-31 22:09:06,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8a18ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:06, skipping insertion in model container [2024-10-31 22:09:06,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:09:06" (1/1) ... [2024-10-31 22:09:06,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:09:06,916 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c[1245,1258] [2024-10-31 22:09:07,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:09:07,389 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:09:07,400 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_406c1411-f762-4d4d-bc43-e5adf723cd66/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b03.c[1245,1258] [2024-10-31 22:09:07,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:09:07,560 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:09:07,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:07 WrapperNode [2024-10-31 22:09:07,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:09:07,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:09:07,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:09:07,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:09:07,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:07" (1/1) ... [2024-10-31 22:09:07,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:07" (1/1) ... [2024-10-31 22:09:07,703 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1557 [2024-10-31 22:09:07,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:09:07,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:09:07,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:09:07,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:09:07,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:07" (1/1) ... [2024-10-31 22:09:07,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:07" (1/1) ... [2024-10-31 22:09:07,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:07" (1/1) ... [2024-10-31 22:09:07,819 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-31 22:09:07,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:07" (1/1) ... [2024-10-31 22:09:07,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:07" (1/1) ... [2024-10-31 22:09:07,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:07" (1/1) ... [2024-10-31 22:09:07,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:07" (1/1) ... [2024-10-31 22:09:07,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:07" (1/1) ...