./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/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_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/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 32bit --witnessprinter.graph.data.programhash dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:19:15,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:19:15,197 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:19:15,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:19:15,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:19:15,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:19:15,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:19:15,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:19:15,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:19:15,226 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:19:15,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:19:15,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:19:15,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:19:15,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:19:15,228 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:19:15,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:19:15,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:19:15,230 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:19:15,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:19:15,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:19:15,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:19:15,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:19:15,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:19:15,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:19:15,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:19:15,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:19:15,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:19:15,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:19:15,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:19:15,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:19:15,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:19:15,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:19:15,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:15,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:19:15,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:19:15,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:19:15,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:19:15,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:19:15,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:19:15,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:19:15,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:19:15,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:19:15,240 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_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/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_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2024-10-31 22:19:15,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:19:15,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:19:15,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:19:15,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:19:15,550 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:19:15,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/locks/test_locks_11.c Unable to find full path for "g++" [2024-10-31 22:19:17,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:19:18,059 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:19:18,060 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/sv-benchmarks/c/locks/test_locks_11.c [2024-10-31 22:19:18,069 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/bin/uautomizer-verify-4GaUIPS5ZU/data/e5d9c8b4a/fe2b451320c243d18fac19349a3ee344/FLAG7f6416686 [2024-10-31 22:19:18,084 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/bin/uautomizer-verify-4GaUIPS5ZU/data/e5d9c8b4a/fe2b451320c243d18fac19349a3ee344 [2024-10-31 22:19:18,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:19:18,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:19:18,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:18,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:19:18,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:19:18,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796f0c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18, skipping insertion in model container [2024-10-31 22:19:18,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:19:18,386 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_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2024-10-31 22:19:18,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:18,407 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:19:18,433 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_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2024-10-31 22:19:18,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:18,452 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:19:18,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18 WrapperNode [2024-10-31 22:19:18,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:18,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:18,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:19:18,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:19:18,462 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:19:18" (1/1) ... [2024-10-31 22:19:18,471 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:19:18" (1/1) ... [2024-10-31 22:19:18,499 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2024-10-31 22:19:18,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:18,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:19:18,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:19:18,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:19:18,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,544 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:19:18,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:19:18,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:19:18,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:19:18,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:19:18,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:18,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:18,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/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:19:18,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/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:19:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:19:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:19:18,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:19:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:19:18,757 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:19:18,759 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:19:19,111 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-31 22:19:19,111 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:19:19,130 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:19:19,130 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:19:19,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:19 BoogieIcfgContainer [2024-10-31 22:19:19,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:19:19,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:19:19,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:19:19,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:19:19,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:19:18" (1/3) ... [2024-10-31 22:19:19,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb268a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:19, skipping insertion in model container [2024-10-31 22:19:19,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18" (2/3) ... [2024-10-31 22:19:19,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb268a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:19, skipping insertion in model container [2024-10-31 22:19:19,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:19" (3/3) ... [2024-10-31 22:19:19,141 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2024-10-31 22:19:19,160 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:19:19,160 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:19:19,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:19:19,240 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;@75462714, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:19:19,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:19:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 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:19:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:19:19,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:19,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:19,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:19,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash 458919617, now seen corresponding path program 1 times [2024-10-31 22:19:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:19,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937074087] [2024-10-31 22:19:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:19,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:19,526 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:19:19,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:19,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937074087] [2024-10-31 22:19:19,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937074087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:19,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:19,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:19,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924541971] [2024-10-31 22:19:19,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:19,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:19,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:19,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:19,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:19,582 INFO L87 Difference]: Start difference. First operand has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 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 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:19:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:19,628 INFO L93 Difference]: Finished difference Result 87 states and 156 transitions. [2024-10-31 22:19:19,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:19,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-10-31 22:19:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:19,640 INFO L225 Difference]: With dead ends: 87 [2024-10-31 22:19:19,640 INFO L226 Difference]: Without dead ends: 75 [2024-10-31 22:19:19,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:19,647 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:19,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-31 22:19:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2024-10-31 22:19:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 94 transitions. [2024-10-31 22:19:19,685 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 94 transitions. Word has length 18 [2024-10-31 22:19:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:19,685 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 94 transitions. [2024-10-31 22:19:19,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:19:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 94 transitions. [2024-10-31 22:19:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:19:19,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:19,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:19,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:19:19,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:19,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash -552197633, now seen corresponding path program 1 times [2024-10-31 22:19:19,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:19,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196200327] [2024-10-31 22:19:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:19,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:19,819 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:19:19,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:19,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196200327] [2024-10-31 22:19:19,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196200327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:19,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:19,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:19,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417532289] [2024-10-31 22:19:19,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:19,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:19,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:19,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:19,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:19,826 INFO L87 Difference]: Start difference. First operand 51 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:19:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:19,853 INFO L93 Difference]: Finished difference Result 124 states and 229 transitions. [2024-10-31 22:19:19,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:19,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-10-31 22:19:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:19,855 INFO L225 Difference]: With dead ends: 124 [2024-10-31 22:19:19,855 INFO L226 Difference]: Without dead ends: 75 [2024-10-31 22:19:19,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:19,857 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:19,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-31 22:19:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-10-31 22:19:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 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:19:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 134 transitions. [2024-10-31 22:19:19,869 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 134 transitions. Word has length 18 [2024-10-31 22:19:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:19,869 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 134 transitions. [2024-10-31 22:19:19,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:19:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 134 transitions. [2024-10-31 22:19:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:19:19,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:19,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:19,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:19:19,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:19,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1341819263, now seen corresponding path program 1 times [2024-10-31 22:19:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:19,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656273171] [2024-10-31 22:19:19,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:19,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:19,976 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:19:19,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:19,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656273171] [2024-10-31 22:19:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656273171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:19,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:19,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550139454] [2024-10-31 22:19:19,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:19,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:19,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:19,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:19,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:19,984 INFO L87 Difference]: Start difference. First operand 73 states and 134 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:19:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:20,017 INFO L93 Difference]: Finished difference Result 114 states and 204 transitions. [2024-10-31 22:19:20,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:20,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-10-31 22:19:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:20,019 INFO L225 Difference]: With dead ends: 114 [2024-10-31 22:19:20,020 INFO L226 Difference]: Without dead ends: 78 [2024-10-31 22:19:20,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,021 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:20,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-31 22:19:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-10-31 22:19:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 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:19:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 136 transitions. [2024-10-31 22:19:20,031 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 136 transitions. Word has length 19 [2024-10-31 22:19:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:20,031 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 136 transitions. [2024-10-31 22:19:20,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:19:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 136 transitions. [2024-10-31 22:19:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:19:20,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:20,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:20,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:19:20,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:20,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash 61955585, now seen corresponding path program 1 times [2024-10-31 22:19:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:20,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683174283] [2024-10-31 22:19:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:20,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,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:19:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683174283] [2024-10-31 22:19:20,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683174283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:20,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547752263] [2024-10-31 22:19:20,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:20,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:20,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:20,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,102 INFO L87 Difference]: Start difference. First operand 76 states and 136 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:19:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:20,123 INFO L93 Difference]: Finished difference Result 145 states and 261 transitions. [2024-10-31 22:19:20,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:20,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-10-31 22:19:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:20,125 INFO L225 Difference]: With dead ends: 145 [2024-10-31 22:19:20,126 INFO L226 Difference]: Without dead ends: 143 [2024-10-31 22:19:20,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,128 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:20,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-31 22:19:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2024-10-31 22:19:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 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:19:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 181 transitions. [2024-10-31 22:19:20,151 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 181 transitions. Word has length 19 [2024-10-31 22:19:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:20,152 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 181 transitions. [2024-10-31 22:19:20,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:19:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 181 transitions. [2024-10-31 22:19:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:19:20,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:20,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:20,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:19:20,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:20,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:20,161 INFO L85 PathProgramCache]: Analyzing trace with hash -949161665, now seen corresponding path program 1 times [2024-10-31 22:19:20,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:20,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888257421] [2024-10-31 22:19:20,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:20,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,224 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:19:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888257421] [2024-10-31 22:19:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888257421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019840501] [2024-10-31 22:19:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:20,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:20,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:20,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,228 INFO L87 Difference]: Start difference. First operand 101 states and 181 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:19:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:20,247 INFO L93 Difference]: Finished difference Result 241 states and 435 transitions. [2024-10-31 22:19:20,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:20,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-10-31 22:19:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:20,249 INFO L225 Difference]: With dead ends: 241 [2024-10-31 22:19:20,249 INFO L226 Difference]: Without dead ends: 145 [2024-10-31 22:19:20,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,251 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:20,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-31 22:19:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2024-10-31 22:19:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 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:19:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 255 transitions. [2024-10-31 22:19:20,262 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 255 transitions. Word has length 19 [2024-10-31 22:19:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:20,263 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 255 transitions. [2024-10-31 22:19:20,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:19:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 255 transitions. [2024-10-31 22:19:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:19:20,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:20,266 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] [2024-10-31 22:19:20,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:19:20,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:20,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1920836500, now seen corresponding path program 1 times [2024-10-31 22:19:20,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:20,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909198973] [2024-10-31 22:19:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,334 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:19:20,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:20,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909198973] [2024-10-31 22:19:20,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909198973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:20,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674966471] [2024-10-31 22:19:20,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:20,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:20,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,342 INFO L87 Difference]: Start difference. First operand 143 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:20,365 INFO L93 Difference]: Finished difference Result 216 states and 382 transitions. [2024-10-31 22:19:20,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:20,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-10-31 22:19:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:20,367 INFO L225 Difference]: With dead ends: 216 [2024-10-31 22:19:20,367 INFO L226 Difference]: Without dead ends: 147 [2024-10-31 22:19:20,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,369 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:20,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-31 22:19:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-10-31 22:19:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 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:19:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 255 transitions. [2024-10-31 22:19:20,379 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 255 transitions. Word has length 20 [2024-10-31 22:19:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:20,379 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 255 transitions. [2024-10-31 22:19:20,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 255 transitions. [2024-10-31 22:19:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:19:20,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:20,381 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] [2024-10-31 22:19:20,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:19:20,381 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:20,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:20,382 INFO L85 PathProgramCache]: Analyzing trace with hash 640972822, now seen corresponding path program 1 times [2024-10-31 22:19:20,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:20,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804043752] [2024-10-31 22:19:20,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:20,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,438 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:19:20,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:20,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804043752] [2024-10-31 22:19:20,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804043752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:20,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410601865] [2024-10-31 22:19:20,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:20,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:20,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:20,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,442 INFO L87 Difference]: Start difference. First operand 145 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:20,498 INFO L93 Difference]: Finished difference Result 417 states and 737 transitions. [2024-10-31 22:19:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:20,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-10-31 22:19:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:20,500 INFO L225 Difference]: With dead ends: 417 [2024-10-31 22:19:20,500 INFO L226 Difference]: Without dead ends: 279 [2024-10-31 22:19:20,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,504 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:20,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 139 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-31 22:19:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2024-10-31 22:19:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 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:19:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 483 transitions. [2024-10-31 22:19:20,525 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 483 transitions. Word has length 20 [2024-10-31 22:19:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:20,525 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 483 transitions. [2024-10-31 22:19:20,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 483 transitions. [2024-10-31 22:19:20,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:19:20,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:20,527 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] [2024-10-31 22:19:20,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:19:20,528 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:20,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1652090072, now seen corresponding path program 1 times [2024-10-31 22:19:20,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:20,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631051184] [2024-10-31 22:19:20,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,565 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:19:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:20,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631051184] [2024-10-31 22:19:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631051184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690310728] [2024-10-31 22:19:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:20,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:20,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:20,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,570 INFO L87 Difference]: Start difference. First operand 277 states and 483 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:20,597 INFO L93 Difference]: Finished difference Result 353 states and 621 transitions. [2024-10-31 22:19:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:20,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-10-31 22:19:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:20,600 INFO L225 Difference]: With dead ends: 353 [2024-10-31 22:19:20,600 INFO L226 Difference]: Without dead ends: 351 [2024-10-31 22:19:20,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,601 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:20,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 188 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:20,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-31 22:19:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 277. [2024-10-31 22:19:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 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:19:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 479 transitions. [2024-10-31 22:19:20,619 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 479 transitions. Word has length 20 [2024-10-31 22:19:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:20,619 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 479 transitions. [2024-10-31 22:19:20,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 479 transitions. [2024-10-31 22:19:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:19:20,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:20,621 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] [2024-10-31 22:19:20,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:19:20,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:20,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1604465292, now seen corresponding path program 1 times [2024-10-31 22:19:20,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:20,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523273695] [2024-10-31 22:19:20,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:20,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:20,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523273695] [2024-10-31 22:19:20,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523273695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:20,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40264899] [2024-10-31 22:19:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:20,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:20,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,670 INFO L87 Difference]: Start difference. First operand 277 states and 479 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:19:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:20,697 INFO L93 Difference]: Finished difference Result 517 states and 905 transitions. [2024-10-31 22:19:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-31 22:19:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:20,700 INFO L225 Difference]: With dead ends: 517 [2024-10-31 22:19:20,704 INFO L226 Difference]: Without dead ends: 515 [2024-10-31 22:19:20,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,706 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:20,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-31 22:19:20,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385. [2024-10-31 22:19:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 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:19:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 655 transitions. [2024-10-31 22:19:20,736 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 655 transitions. Word has length 21 [2024-10-31 22:19:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:20,737 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 655 transitions. [2024-10-31 22:19:20,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:19:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 655 transitions. [2024-10-31 22:19:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:19:20,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:20,741 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] [2024-10-31 22:19:20,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:19:20,743 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:20,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:20,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1679384754, now seen corresponding path program 1 times [2024-10-31 22:19:20,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:20,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44084061] [2024-10-31 22:19:20,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:20,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,800 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:19:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44084061] [2024-10-31 22:19:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44084061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:20,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846397402] [2024-10-31 22:19:20,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:20,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:20,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,802 INFO L87 Difference]: Start difference. First operand 385 states and 655 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:19:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:20,836 INFO L93 Difference]: Finished difference Result 917 states and 1569 transitions. [2024-10-31 22:19:20,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-10-31 22:19:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:20,840 INFO L225 Difference]: With dead ends: 917 [2024-10-31 22:19:20,842 INFO L226 Difference]: Without dead ends: 539 [2024-10-31 22:19:20,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,847 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:20,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-10-31 22:19:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2024-10-31 22:19:20,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 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:19:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 907 transitions. [2024-10-31 22:19:20,872 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 907 transitions. Word has length 21 [2024-10-31 22:19:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:20,873 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 907 transitions. [2024-10-31 22:19:20,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:19:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 907 transitions. [2024-10-31 22:19:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 22:19:20,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:20,875 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] [2024-10-31 22:19:20,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:19:20,876 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:20,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:20,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1801397547, now seen corresponding path program 1 times [2024-10-31 22:19:20,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:20,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103764659] [2024-10-31 22:19:20,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:20,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,924 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:19:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:20,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103764659] [2024-10-31 22:19:20,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103764659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:20,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170447405] [2024-10-31 22:19:20,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:20,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:20,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:20,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,930 INFO L87 Difference]: Start difference. First operand 537 states and 907 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:19:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:20,956 INFO L93 Difference]: Finished difference Result 813 states and 1369 transitions. [2024-10-31 22:19:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:20,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-10-31 22:19:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:20,960 INFO L225 Difference]: With dead ends: 813 [2024-10-31 22:19:20,960 INFO L226 Difference]: Without dead ends: 551 [2024-10-31 22:19:20,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,962 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:20,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-31 22:19:20,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2024-10-31 22:19:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 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:19:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 915 transitions. [2024-10-31 22:19:20,984 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 915 transitions. Word has length 22 [2024-10-31 22:19:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:20,984 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 915 transitions. [2024-10-31 22:19:20,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:19:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 915 transitions. [2024-10-31 22:19:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 22:19:20,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:21,000 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] [2024-10-31 22:19:21,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:19:21,000 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:21,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash 521533869, now seen corresponding path program 1 times [2024-10-31 22:19:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:21,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388263694] [2024-10-31 22:19:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,048 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:19:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388263694] [2024-10-31 22:19:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388263694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:21,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:21,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:21,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819040393] [2024-10-31 22:19:21,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:21,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:21,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:21,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,054 INFO L87 Difference]: Start difference. First operand 549 states and 915 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:19:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:21,127 INFO L93 Difference]: Finished difference Result 1001 states and 1693 transitions. [2024-10-31 22:19:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:21,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-10-31 22:19:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:21,134 INFO L225 Difference]: With dead ends: 1001 [2024-10-31 22:19:21,134 INFO L226 Difference]: Without dead ends: 999 [2024-10-31 22:19:21,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,136 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:21,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2024-10-31 22:19:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 773. [2024-10-31 22:19:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 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:19:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1259 transitions. [2024-10-31 22:19:21,180 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1259 transitions. Word has length 22 [2024-10-31 22:19:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:21,180 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1259 transitions. [2024-10-31 22:19:21,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:19:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1259 transitions. [2024-10-31 22:19:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 22:19:21,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:21,183 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] [2024-10-31 22:19:21,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:19:21,184 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:21,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash -489583381, now seen corresponding path program 1 times [2024-10-31 22:19:21,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:21,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673330792] [2024-10-31 22:19:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,230 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:19:21,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:21,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673330792] [2024-10-31 22:19:21,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673330792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:21,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:21,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:21,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24261545] [2024-10-31 22:19:21,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:21,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:21,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:21,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:21,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,235 INFO L87 Difference]: Start difference. First operand 773 states and 1259 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:19:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:21,287 INFO L93 Difference]: Finished difference Result 1817 states and 2973 transitions. [2024-10-31 22:19:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:21,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-10-31 22:19:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:21,292 INFO L225 Difference]: With dead ends: 1817 [2024-10-31 22:19:21,292 INFO L226 Difference]: Without dead ends: 1063 [2024-10-31 22:19:21,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,295 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:21,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:21,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-10-31 22:19:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2024-10-31 22:19:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 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:19:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1715 transitions. [2024-10-31 22:19:21,339 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1715 transitions. Word has length 22 [2024-10-31 22:19:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:21,339 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1715 transitions. [2024-10-31 22:19:21,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:19:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1715 transitions. [2024-10-31 22:19:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 22:19:21,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:21,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:21,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:19:21,342 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:21,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1012104857, now seen corresponding path program 1 times [2024-10-31 22:19:21,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:21,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803842912] [2024-10-31 22:19:21,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:21,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,375 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:19:21,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:21,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803842912] [2024-10-31 22:19:21,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803842912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:21,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:21,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:21,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073547305] [2024-10-31 22:19:21,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:21,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:21,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:21,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:21,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,381 INFO L87 Difference]: Start difference. First operand 1061 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:19:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:21,423 INFO L93 Difference]: Finished difference Result 1593 states and 2565 transitions. [2024-10-31 22:19:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:21,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2024-10-31 22:19:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:21,430 INFO L225 Difference]: With dead ends: 1593 [2024-10-31 22:19:21,430 INFO L226 Difference]: Without dead ends: 1079 [2024-10-31 22:19:21,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,432 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:21,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-10-31 22:19:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2024-10-31 22:19:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 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:19:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1715 transitions. [2024-10-31 22:19:21,487 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1715 transitions. Word has length 23 [2024-10-31 22:19:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:21,489 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1715 transitions. [2024-10-31 22:19:21,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:19:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1715 transitions. [2024-10-31 22:19:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 22:19:21,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:21,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:21,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:19:21,491 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:21,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2002998761, now seen corresponding path program 1 times [2024-10-31 22:19:21,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:21,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952121980] [2024-10-31 22:19:21,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:21,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,521 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:19:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:21,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952121980] [2024-10-31 22:19:21,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952121980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:21,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:21,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:21,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33062748] [2024-10-31 22:19:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:21,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:21,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:21,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,523 INFO L87 Difference]: Start difference. First operand 1077 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:19:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:21,576 INFO L93 Difference]: Finished difference Result 1929 states and 3125 transitions. [2024-10-31 22:19:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:21,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2024-10-31 22:19:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:21,583 INFO L225 Difference]: With dead ends: 1929 [2024-10-31 22:19:21,583 INFO L226 Difference]: Without dead ends: 1927 [2024-10-31 22:19:21,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,587 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:21,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 129 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:21,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2024-10-31 22:19:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1541. [2024-10-31 22:19:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 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:19:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2387 transitions. [2024-10-31 22:19:21,642 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2387 transitions. Word has length 23 [2024-10-31 22:19:21,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:21,642 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 2387 transitions. [2024-10-31 22:19:21,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:19:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2387 transitions. [2024-10-31 22:19:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-31 22:19:21,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:21,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:21,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:19:21,645 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:21,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:21,646 INFO L85 PathProgramCache]: Analyzing trace with hash 991881511, now seen corresponding path program 1 times [2024-10-31 22:19:21,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:21,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375638791] [2024-10-31 22:19:21,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:21,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,677 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:19:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:21,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375638791] [2024-10-31 22:19:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375638791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:21,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:21,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:21,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789277372] [2024-10-31 22:19:21,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:21,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:21,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:21,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,682 INFO L87 Difference]: Start difference. First operand 1541 states and 2387 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:19:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:21,749 INFO L93 Difference]: Finished difference Result 3593 states and 5589 transitions. [2024-10-31 22:19:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:21,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2024-10-31 22:19:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:21,757 INFO L225 Difference]: With dead ends: 3593 [2024-10-31 22:19:21,757 INFO L226 Difference]: Without dead ends: 2087 [2024-10-31 22:19:21,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,762 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:21,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2024-10-31 22:19:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2085. [2024-10-31 22:19:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 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:19:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3203 transitions. [2024-10-31 22:19:21,850 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3203 transitions. Word has length 23 [2024-10-31 22:19:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:21,850 INFO L471 AbstractCegarLoop]: Abstraction has 2085 states and 3203 transitions. [2024-10-31 22:19:21,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:19:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3203 transitions. [2024-10-31 22:19:21,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:19:21,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:21,853 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] [2024-10-31 22:19:21,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:19:21,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:21,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1963634176, now seen corresponding path program 1 times [2024-10-31 22:19:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:21,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268395474] [2024-10-31 22:19:21,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:21,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,911 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:19:21,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:21,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268395474] [2024-10-31 22:19:21,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268395474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:21,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:21,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:21,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874901978] [2024-10-31 22:19:21,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:21,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:21,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:21,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:21,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,913 INFO L87 Difference]: Start difference. First operand 2085 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:19:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:21,978 INFO L93 Difference]: Finished difference Result 3129 states and 4789 transitions. [2024-10-31 22:19:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:21,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2024-10-31 22:19:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:21,985 INFO L225 Difference]: With dead ends: 3129 [2024-10-31 22:19:21,986 INFO L226 Difference]: Without dead ends: 2119 [2024-10-31 22:19:21,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,988 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:21,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2024-10-31 22:19:22,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2117. [2024-10-31 22:19:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 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:19:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3203 transitions. [2024-10-31 22:19:22,070 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3203 transitions. Word has length 24 [2024-10-31 22:19:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:22,070 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3203 transitions. [2024-10-31 22:19:22,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:19:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3203 transitions. [2024-10-31 22:19:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:19:22,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:22,072 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] [2024-10-31 22:19:22,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:19:22,073 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:22,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash 683770498, now seen corresponding path program 1 times [2024-10-31 22:19:22,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:22,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321102711] [2024-10-31 22:19:22,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:22,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,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:19:22,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:22,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321102711] [2024-10-31 22:19:22,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321102711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:22,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:22,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:22,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89441332] [2024-10-31 22:19:22,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:22,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:22,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:22,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:22,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:22,101 INFO L87 Difference]: Start difference. First operand 2117 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:19:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:22,195 INFO L93 Difference]: Finished difference Result 3721 states and 5733 transitions. [2024-10-31 22:19:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:22,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2024-10-31 22:19:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:22,206 INFO L225 Difference]: With dead ends: 3721 [2024-10-31 22:19:22,207 INFO L226 Difference]: Without dead ends: 3719 [2024-10-31 22:19:22,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:22,209 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:22,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2024-10-31 22:19:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3077. [2024-10-31 22:19:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 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:19:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4515 transitions. [2024-10-31 22:19:22,335 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4515 transitions. Word has length 24 [2024-10-31 22:19:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:22,336 INFO L471 AbstractCegarLoop]: Abstraction has 3077 states and 4515 transitions. [2024-10-31 22:19:22,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:19:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4515 transitions. [2024-10-31 22:19:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:19:22,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:22,340 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] [2024-10-31 22:19:22,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:19:22,340 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:22,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash -327346752, now seen corresponding path program 1 times [2024-10-31 22:19:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:22,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209883628] [2024-10-31 22:19:22,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:22,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,377 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:19:22,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:22,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209883628] [2024-10-31 22:19:22,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209883628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:22,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:22,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:22,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654816350] [2024-10-31 22:19:22,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:22,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:22,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:22,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:22,378 INFO L87 Difference]: Start difference. First operand 3077 states and 4515 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:19:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:22,499 INFO L93 Difference]: Finished difference Result 7113 states and 10469 transitions. [2024-10-31 22:19:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:22,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2024-10-31 22:19:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:22,512 INFO L225 Difference]: With dead ends: 7113 [2024-10-31 22:19:22,513 INFO L226 Difference]: Without dead ends: 4103 [2024-10-31 22:19:22,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:22,517 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:22,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2024-10-31 22:19:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4101. [2024-10-31 22:19:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 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:19:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5955 transitions. [2024-10-31 22:19:22,729 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5955 transitions. Word has length 24 [2024-10-31 22:19:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:22,729 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 5955 transitions. [2024-10-31 22:19:22,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:19:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5955 transitions. [2024-10-31 22:19:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:19:22,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:22,735 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] [2024-10-31 22:19:22,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:19:22,735 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:22,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash -277735972, now seen corresponding path program 1 times [2024-10-31 22:19:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:22,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556550842] [2024-10-31 22:19:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,773 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:19:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:22,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556550842] [2024-10-31 22:19:22,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556550842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:22,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:22,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524111767] [2024-10-31 22:19:22,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:22,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:22,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:22,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:22,776 INFO L87 Difference]: Start difference. First operand 4101 states and 5955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:19:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:22,882 INFO L93 Difference]: Finished difference Result 6153 states and 8901 transitions. [2024-10-31 22:19:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2024-10-31 22:19:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:22,900 INFO L225 Difference]: With dead ends: 6153 [2024-10-31 22:19:22,900 INFO L226 Difference]: Without dead ends: 4167 [2024-10-31 22:19:22,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:22,904 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:22,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2024-10-31 22:19:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4165. [2024-10-31 22:19:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 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:19:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5955 transitions. [2024-10-31 22:19:23,087 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5955 transitions. Word has length 25 [2024-10-31 22:19:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:23,088 INFO L471 AbstractCegarLoop]: Abstraction has 4165 states and 5955 transitions. [2024-10-31 22:19:23,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:19:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5955 transitions. [2024-10-31 22:19:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:19:23,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:23,094 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] [2024-10-31 22:19:23,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:19:23,095 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:23,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1557599650, now seen corresponding path program 1 times [2024-10-31 22:19:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:23,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347463307] [2024-10-31 22:19:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,120 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:19:23,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:23,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347463307] [2024-10-31 22:19:23,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347463307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:23,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:23,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962838355] [2024-10-31 22:19:23,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:23,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:23,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:23,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:23,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:23,123 INFO L87 Difference]: Start difference. First operand 4165 states and 5955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:19:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:23,279 INFO L93 Difference]: Finished difference Result 7177 states and 10437 transitions. [2024-10-31 22:19:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:23,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2024-10-31 22:19:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:23,295 INFO L225 Difference]: With dead ends: 7177 [2024-10-31 22:19:23,295 INFO L226 Difference]: Without dead ends: 7175 [2024-10-31 22:19:23,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:23,298 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:23,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 125 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7175 states. [2024-10-31 22:19:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7175 to 6149. [2024-10-31 22:19:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 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:19:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8515 transitions. [2024-10-31 22:19:23,515 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 8515 transitions. Word has length 25 [2024-10-31 22:19:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:23,516 INFO L471 AbstractCegarLoop]: Abstraction has 6149 states and 8515 transitions. [2024-10-31 22:19:23,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:19:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 8515 transitions. [2024-10-31 22:19:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:19:23,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:23,530 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] [2024-10-31 22:19:23,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 22:19:23,530 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:23,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:23,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1726250396, now seen corresponding path program 1 times [2024-10-31 22:19:23,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:23,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636915477] [2024-10-31 22:19:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:23,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,555 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:19:23,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:23,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636915477] [2024-10-31 22:19:23,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636915477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:23,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:23,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:23,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765322579] [2024-10-31 22:19:23,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:23,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:23,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:23,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:23,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:23,558 INFO L87 Difference]: Start difference. First operand 6149 states and 8515 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:19:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:23,746 INFO L93 Difference]: Finished difference Result 14089 states and 19525 transitions. [2024-10-31 22:19:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:23,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2024-10-31 22:19:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:23,761 INFO L225 Difference]: With dead ends: 14089 [2024-10-31 22:19:23,761 INFO L226 Difference]: Without dead ends: 8071 [2024-10-31 22:19:23,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:23,769 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:23,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:23,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8071 states. [2024-10-31 22:19:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 8069. [2024-10-31 22:19:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 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:19:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 11011 transitions. [2024-10-31 22:19:24,120 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 11011 transitions. Word has length 25 [2024-10-31 22:19:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:24,120 INFO L471 AbstractCegarLoop]: Abstraction has 8069 states and 11011 transitions. [2024-10-31 22:19:24,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:19:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 11011 transitions. [2024-10-31 22:19:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:19:24,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:24,131 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] [2024-10-31 22:19:24,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 22:19:24,131 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:24,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1040733483, now seen corresponding path program 1 times [2024-10-31 22:19:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:24,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520410086] [2024-10-31 22:19:24,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:24,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,168 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:19:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520410086] [2024-10-31 22:19:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520410086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:24,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:24,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:24,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220809298] [2024-10-31 22:19:24,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:24,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:24,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:24,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:24,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:24,171 INFO L87 Difference]: Start difference. First operand 8069 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:24,399 INFO L93 Difference]: Finished difference Result 12105 states and 16453 transitions. [2024-10-31 22:19:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:24,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-31 22:19:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:24,414 INFO L225 Difference]: With dead ends: 12105 [2024-10-31 22:19:24,414 INFO L226 Difference]: Without dead ends: 8199 [2024-10-31 22:19:24,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:24,420 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:24,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2024-10-31 22:19:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8197. [2024-10-31 22:19:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 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:19:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 11011 transitions. [2024-10-31 22:19:24,711 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 11011 transitions. Word has length 26 [2024-10-31 22:19:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:24,711 INFO L471 AbstractCegarLoop]: Abstraction has 8197 states and 11011 transitions. [2024-10-31 22:19:24,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 11011 transitions. [2024-10-31 22:19:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:19:24,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:24,719 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] [2024-10-31 22:19:24,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 22:19:24,719 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:24,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1974370135, now seen corresponding path program 1 times [2024-10-31 22:19:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:24,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830385192] [2024-10-31 22:19:24,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,744 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:19:24,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:24,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830385192] [2024-10-31 22:19:24,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830385192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:24,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:24,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862103906] [2024-10-31 22:19:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:24,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:24,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:24,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:24,747 INFO L87 Difference]: Start difference. First operand 8197 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:25,035 INFO L93 Difference]: Finished difference Result 13833 states and 18821 transitions. [2024-10-31 22:19:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:25,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-31 22:19:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:25,063 INFO L225 Difference]: With dead ends: 13833 [2024-10-31 22:19:25,063 INFO L226 Difference]: Without dead ends: 13831 [2024-10-31 22:19:25,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:25,069 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:25,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13831 states. [2024-10-31 22:19:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13831 to 12293. [2024-10-31 22:19:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 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:19:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12293 states to 12293 states and 16003 transitions. [2024-10-31 22:19:25,473 INFO L78 Accepts]: Start accepts. Automaton has 12293 states and 16003 transitions. Word has length 26 [2024-10-31 22:19:25,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:25,474 INFO L471 AbstractCegarLoop]: Abstraction has 12293 states and 16003 transitions. [2024-10-31 22:19:25,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 12293 states and 16003 transitions. [2024-10-31 22:19:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:19:25,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:25,495 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] [2024-10-31 22:19:25,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-31 22:19:25,495 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:25,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:25,496 INFO L85 PathProgramCache]: Analyzing trace with hash 963252885, now seen corresponding path program 1 times [2024-10-31 22:19:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462456805] [2024-10-31 22:19:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:25,535 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:19:25,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:25,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462456805] [2024-10-31 22:19:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462456805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:25,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:25,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:25,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67236234] [2024-10-31 22:19:25,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:25,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:25,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:25,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:25,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:25,538 INFO L87 Difference]: Start difference. First operand 12293 states and 16003 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:25,998 INFO L93 Difference]: Finished difference Result 27913 states and 36229 transitions. [2024-10-31 22:19:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:26,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-31 22:19:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:26,039 INFO L225 Difference]: With dead ends: 27913 [2024-10-31 22:19:26,039 INFO L226 Difference]: Without dead ends: 15879 [2024-10-31 22:19:26,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:26,055 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:26,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15879 states. [2024-10-31 22:19:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15879 to 15877. [2024-10-31 22:19:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15877 states, 15876 states have (on average 1.2740614764424287) internal successors, (20227), 15876 states have internal predecessors, (20227), 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:19:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 20227 transitions. [2024-10-31 22:19:26,702 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 20227 transitions. Word has length 26 [2024-10-31 22:19:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:26,703 INFO L471 AbstractCegarLoop]: Abstraction has 15877 states and 20227 transitions. [2024-10-31 22:19:26,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:19:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 20227 transitions. [2024-10-31 22:19:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:19:26,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:26,717 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] [2024-10-31 22:19:26,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-31 22:19:26,718 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:26,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:26,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1076147793, now seen corresponding path program 1 times [2024-10-31 22:19:26,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:26,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380186806] [2024-10-31 22:19:26,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:26,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:26,744 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:19:26,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380186806] [2024-10-31 22:19:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380186806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:26,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:26,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:26,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023928538] [2024-10-31 22:19:26,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:26,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:26,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:26,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:26,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:26,747 INFO L87 Difference]: Start difference. First operand 15877 states and 20227 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:19:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:27,070 INFO L93 Difference]: Finished difference Result 23817 states and 30213 transitions. [2024-10-31 22:19:27,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:27,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2024-10-31 22:19:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:27,097 INFO L225 Difference]: With dead ends: 23817 [2024-10-31 22:19:27,098 INFO L226 Difference]: Without dead ends: 16135 [2024-10-31 22:19:27,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:27,105 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:27,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:19:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2024-10-31 22:19:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 16133. [2024-10-31 22:19:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16133 states, 16132 states have (on average 1.2538432928341186) internal successors, (20227), 16132 states have internal predecessors, (20227), 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:19:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 20227 transitions. [2024-10-31 22:19:27,608 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 20227 transitions. Word has length 27 [2024-10-31 22:19:27,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:27,609 INFO L471 AbstractCegarLoop]: Abstraction has 16133 states and 20227 transitions. [2024-10-31 22:19:27,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:19:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 20227 transitions. [2024-10-31 22:19:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:19:27,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:27,626 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] [2024-10-31 22:19:27,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-31 22:19:27,627 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:27,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:27,627 INFO L85 PathProgramCache]: Analyzing trace with hash -203715885, now seen corresponding path program 1 times [2024-10-31 22:19:27,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:27,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183916575] [2024-10-31 22:19:27,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:27,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:27,653 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:19:27,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:27,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183916575] [2024-10-31 22:19:27,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183916575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:27,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:27,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:27,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472732135] [2024-10-31 22:19:27,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:27,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:27,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:27,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:27,657 INFO L87 Difference]: Start difference. First operand 16133 states and 20227 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:19:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:28,425 INFO L93 Difference]: Finished difference Result 26633 states and 33541 transitions. [2024-10-31 22:19:28,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:28,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2024-10-31 22:19:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:28,486 INFO L225 Difference]: With dead ends: 26633 [2024-10-31 22:19:28,487 INFO L226 Difference]: Without dead ends: 26631 [2024-10-31 22:19:28,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:28,493 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:28,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26631 states. [2024-10-31 22:19:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26631 to 24581. [2024-10-31 22:19:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24581 states, 24580 states have (on average 1.2186737184703011) internal successors, (29955), 24580 states have internal predecessors, (29955), 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:19:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24581 states to 24581 states and 29955 transitions. [2024-10-31 22:19:29,407 INFO L78 Accepts]: Start accepts. Automaton has 24581 states and 29955 transitions. Word has length 27 [2024-10-31 22:19:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:29,408 INFO L471 AbstractCegarLoop]: Abstraction has 24581 states and 29955 transitions. [2024-10-31 22:19:29,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:19:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 24581 states and 29955 transitions. [2024-10-31 22:19:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:19:29,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:29,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] [2024-10-31 22:19:29,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-31 22:19:29,478 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:29,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1214833135, now seen corresponding path program 1 times [2024-10-31 22:19:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:29,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961644680] [2024-10-31 22:19:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:29,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:29,507 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:19:29,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:29,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961644680] [2024-10-31 22:19:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961644680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:29,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:29,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:29,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890686566] [2024-10-31 22:19:29,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:29,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:29,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:29,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:29,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:29,510 INFO L87 Difference]: Start difference. First operand 24581 states and 29955 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:19:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:30,022 INFO L93 Difference]: Finished difference Result 55305 states and 66821 transitions. [2024-10-31 22:19:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:30,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2024-10-31 22:19:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:30,068 INFO L225 Difference]: With dead ends: 55305 [2024-10-31 22:19:30,068 INFO L226 Difference]: Without dead ends: 31239 [2024-10-31 22:19:30,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:30,091 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:30,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:30,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31239 states. [2024-10-31 22:19:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31239 to 31237. [2024-10-31 22:19:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31237 states, 31236 states have (on average 1.1802727621974645) internal successors, (36867), 31236 states have internal predecessors, (36867), 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:19:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31237 states to 31237 states and 36867 transitions. [2024-10-31 22:19:31,133 INFO L78 Accepts]: Start accepts. Automaton has 31237 states and 36867 transitions. Word has length 27 [2024-10-31 22:19:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 31237 states and 36867 transitions. [2024-10-31 22:19:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:19:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 31237 states and 36867 transitions. [2024-10-31 22:19:31,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:19:31,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:31,157 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] [2024-10-31 22:19:31,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-31 22:19:31,158 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:31,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:31,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2020009046, now seen corresponding path program 1 times [2024-10-31 22:19:31,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:31,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701735990] [2024-10-31 22:19:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:31,179 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:19:31,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701735990] [2024-10-31 22:19:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701735990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:31,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:31,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272336588] [2024-10-31 22:19:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:31,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:31,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:31,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:31,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:31,182 INFO L87 Difference]: Start difference. First operand 31237 states and 36867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:19:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:31,771 INFO L93 Difference]: Finished difference Result 46857 states and 55045 transitions. [2024-10-31 22:19:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:31,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-10-31 22:19:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:31,811 INFO L225 Difference]: With dead ends: 46857 [2024-10-31 22:19:31,811 INFO L226 Difference]: Without dead ends: 31751 [2024-10-31 22:19:31,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:31,930 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 46 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:31,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31751 states. [2024-10-31 22:19:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31751 to 31749. [2024-10-31 22:19:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.1612385032128008) internal successors, (36867), 31748 states have internal predecessors, (36867), 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:19:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 36867 transitions. [2024-10-31 22:19:32,871 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 36867 transitions. Word has length 28 [2024-10-31 22:19:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:32,872 INFO L471 AbstractCegarLoop]: Abstraction has 31749 states and 36867 transitions. [2024-10-31 22:19:32,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:19:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 36867 transitions. [2024-10-31 22:19:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:19:32,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:32,886 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] [2024-10-31 22:19:32,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-31 22:19:32,887 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:32,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash 995094572, now seen corresponding path program 1 times [2024-10-31 22:19:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:32,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836289677] [2024-10-31 22:19:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:32,909 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:19:32,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:32,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836289677] [2024-10-31 22:19:32,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836289677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:32,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:32,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:32,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669199905] [2024-10-31 22:19:32,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:32,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:32,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:32,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:32,911 INFO L87 Difference]: Start difference. First operand 31749 states and 36867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:19:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:33,802 INFO L93 Difference]: Finished difference Result 92167 states and 104452 transitions. [2024-10-31 22:19:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:33,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-10-31 22:19:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:33,842 INFO L225 Difference]: With dead ends: 92167 [2024-10-31 22:19:33,842 INFO L226 Difference]: Without dead ends: 31749 [2024-10-31 22:19:33,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:33,867 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 43 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:33,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31749 states. [2024-10-31 22:19:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31749 to 31749. [2024-10-31 22:19:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.096730502708832) internal successors, (34819), 31748 states have internal predecessors, (34819), 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:19:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 34819 transitions. [2024-10-31 22:19:35,246 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 34819 transitions. Word has length 28 [2024-10-31 22:19:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:35,246 INFO L471 AbstractCegarLoop]: Abstraction has 31749 states and 34819 transitions. [2024-10-31 22:19:35,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:19:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 34819 transitions. [2024-10-31 22:19:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:19:35,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:35,266 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] [2024-10-31 22:19:35,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-31 22:19:35,266 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:35,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2006211822, now seen corresponding path program 1 times [2024-10-31 22:19:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:35,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642270574] [2024-10-31 22:19:35,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:35,291 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:19:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:35,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642270574] [2024-10-31 22:19:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642270574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:35,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:35,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103854607] [2024-10-31 22:19:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:35,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:35,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:35,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:35,293 INFO L87 Difference]: Start difference. First operand 31749 states and 34819 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:19:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:35,738 INFO L93 Difference]: Finished difference Result 31749 states and 34819 transitions. [2024-10-31 22:19:35,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:35,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-10-31 22:19:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:35,832 INFO L225 Difference]: With dead ends: 31749 [2024-10-31 22:19:35,832 INFO L226 Difference]: Without dead ends: 0 [2024-10-31 22:19:35,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:35,840 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:35,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-31 22:19:35,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-31 22:19:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:19:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-31 22:19:35,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2024-10-31 22:19:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:35,848 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-31 22:19:35,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:19:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-31 22:19:35,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-31 22:19:35,854 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:19:35,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-31 22:19:35,860 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-31 22:19:35,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-31 22:19:35,876 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:19:35,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:19:35 BoogieIcfgContainer [2024-10-31 22:19:35,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:19:35,892 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:19:35,892 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:19:35,894 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:19:35,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:19" (3/4) ... [2024-10-31 22:19:35,897 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-10-31 22:19:35,907 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-31 22:19:35,907 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-31 22:19:35,907 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-31 22:19:35,907 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-31 22:19:36,007 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:19:36,007 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/bin/uautomizer-verify-4GaUIPS5ZU/witness.yml [2024-10-31 22:19:36,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:19:36,008 INFO L158 Benchmark]: Toolchain (without parser) took 17919.65ms. Allocated memory was 140.5MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 104.2MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 556.9MB. Max. memory is 16.1GB. [2024-10-31 22:19:36,008 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 140.5MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:19:36,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.05ms. Allocated memory is still 140.5MB. Free memory was 103.7MB in the beginning and 90.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-31 22:19:36,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.55ms. Allocated memory is still 140.5MB. Free memory was 90.6MB in the beginning and 89.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:19:36,009 INFO L158 Benchmark]: Boogie Preprocessor took 66.83ms. Allocated memory is still 140.5MB. Free memory was 89.1MB in the beginning and 87.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:19:36,009 INFO L158 Benchmark]: RCFGBuilder took 563.62ms. Allocated memory is still 140.5MB. Free memory was 87.0MB in the beginning and 71.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:19:36,010 INFO L158 Benchmark]: TraceAbstraction took 16758.12ms. Allocated memory was 140.5MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 70.7MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 517.1MB. Max. memory is 16.1GB. [2024-10-31 22:19:36,010 INFO L158 Benchmark]: Witness Printer took 115.31ms. Allocated memory is still 8.1GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:19:36,014 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.24ms. Allocated memory is still 140.5MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.05ms. Allocated memory is still 140.5MB. Free memory was 103.7MB in the beginning and 90.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.55ms. Allocated memory is still 140.5MB. Free memory was 90.6MB in the beginning and 89.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.83ms. Allocated memory is still 140.5MB. Free memory was 89.1MB in the beginning and 87.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 563.62ms. Allocated memory is still 140.5MB. Free memory was 87.0MB in the beginning and 71.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16758.12ms. Allocated memory was 140.5MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 70.7MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 517.1MB. Max. memory is 16.1GB. * Witness Printer took 115.31ms. Allocated memory is still 8.1GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 177]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1398 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1398 mSDsluCounter, 4586 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1834 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 165 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2752 mSDtfsCounter, 165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31749occurred in iteration=29, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-31 22:19:36,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed1f9d04-f9cd-4ce9-8ed6-52324a19af4f/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 Writing output log to file Ultimate.log Result: TRUE