./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:07:07,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:07:07,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 09:07:07,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:07:07,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:07:07,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:07:07,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:07:07,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:07:07,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 09:07:07,320 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 09:07:07,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:07:07,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:07:07,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:07:07,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:07:07,322 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:07:07,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:07:07,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:07:07,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:07:07,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:07:07,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:07:07,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:07:07,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:07:07,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:07:07,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:07:07,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:07:07,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:07:07,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:07:07,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:07:07,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:07:07,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:07:07,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 09:07:07,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:07:07,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:07:07,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:07:07,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:07:07,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:07:07,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:07:07,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:07:07,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:07:07,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:07:07,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:07:07,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:07:07,331 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2024-10-13 09:07:07,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:07:07,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:07:07,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:07:07,601 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:07:07,601 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:07:07,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-13 09:07:09,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:07:09,370 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:07:09,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-13 09:07:09,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8becf38/b932cc08055d42449e6de79f1f54cce1/FLAG8ab5af1aa [2024-10-13 09:07:09,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8becf38/b932cc08055d42449e6de79f1f54cce1 [2024-10-13 09:07:09,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:07:09,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:07:09,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:07:09,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:07:09,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:07:09,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:07:09" (1/1) ... [2024-10-13 09:07:09,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4be905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:09, skipping insertion in model container [2024-10-13 09:07:09,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:07:09" (1/1) ... [2024-10-13 09:07:09,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:07:09,970 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i[44118,44131] [2024-10-13 09:07:09,983 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i[44660,44673] [2024-10-13 09:07:10,080 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i[56247,56260] [2024-10-13 09:07:10,085 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i[56368,56381] [2024-10-13 09:07:10,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:07:10,109 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:07:10,158 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i[44118,44131] [2024-10-13 09:07:10,161 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i[44660,44673] [2024-10-13 09:07:10,216 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i[56247,56260] [2024-10-13 09:07:10,216 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i[56368,56381] [2024-10-13 09:07:10,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:07:10,279 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:07:10,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10 WrapperNode [2024-10-13 09:07:10,279 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:07:10,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:07:10,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:07:10,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:07:10,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,391 INFO L138 Inliner]: procedures = 282, calls = 286, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1468 [2024-10-13 09:07:10,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:07:10,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:07:10,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:07:10,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:07:10,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,513 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 3, 34, 220]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 2, 4, 49]. [2024-10-13 09:07:10,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:07:10,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:07:10,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:07:10,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:07:10,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (1/1) ... [2024-10-13 09:07:10,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:07:10,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:07:10,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:07:10,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:07:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:07:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 09:07:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 09:07:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 09:07:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 09:07:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:07:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-13 09:07:10,727 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-13 09:07:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 09:07:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 09:07:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 09:07:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 09:07:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 09:07:10,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 09:07:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 09:07:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 09:07:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 09:07:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 09:07:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:07:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:07:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-13 09:07:10,731 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-13 09:07:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 09:07:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 09:07:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 09:07:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 09:07:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-13 09:07:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-13 09:07:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 09:07:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 09:07:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 09:07:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 09:07:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:07:10,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:07:11,006 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:07:11,009 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:07:12,594 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2024-10-13 09:07:12,594 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:07:12,654 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:07:12,654 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-13 09:07:12,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:07:12 BoogieIcfgContainer [2024-10-13 09:07:12,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:07:12,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:07:12,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:07:12,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:07:12,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:07:09" (1/3) ... [2024-10-13 09:07:12,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229ef572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:07:12, skipping insertion in model container [2024-10-13 09:07:12,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:10" (2/3) ... [2024-10-13 09:07:12,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229ef572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:07:12, skipping insertion in model container [2024-10-13 09:07:12,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:07:12" (3/3) ... [2024-10-13 09:07:12,665 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-1.i [2024-10-13 09:07:12,681 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:07:12,682 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 09:07:12,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:07:12,767 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;@54b541d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:07:12,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 09:07:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 402 states have (on average 1.6144278606965174) internal successors, (649), 406 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 09:07:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 09:07:12,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:12,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:12,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:12,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash 141968546, now seen corresponding path program 1 times [2024-10-13 09:07:12,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:12,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759804402] [2024-10-13 09:07:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:12,994 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-13 09:07:12,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:12,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759804402] [2024-10-13 09:07:12,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759804402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:12,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:12,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:07:12,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635372863] [2024-10-13 09:07:12,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:13,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:07:13,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:13,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:07:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:07:13,035 INFO L87 Difference]: Start difference. First operand has 424 states, 402 states have (on average 1.6144278606965174) internal successors, (649), 406 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-13 09:07:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:13,130 INFO L93 Difference]: Finished difference Result 845 states and 1360 transitions. [2024-10-13 09:07:13,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:07:13,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-10-13 09:07:13,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:13,151 INFO L225 Difference]: With dead ends: 845 [2024-10-13 09:07:13,151 INFO L226 Difference]: Without dead ends: 420 [2024-10-13 09:07:13,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:07:13,160 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 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-13 09:07:13,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:07:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-13 09:07:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-13 09:07:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 399 states have (on average 1.443609022556391) internal successors, (576), 404 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 601 transitions. [2024-10-13 09:07:13,225 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 601 transitions. Word has length 7 [2024-10-13 09:07:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:13,226 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 601 transitions. [2024-10-13 09:07:13,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-13 09:07:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 601 transitions. [2024-10-13 09:07:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 09:07:13,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:13,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:13,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:07:13,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:13,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash 750725892, now seen corresponding path program 1 times [2024-10-13 09:07:13,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:13,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601825243] [2024-10-13 09:07:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:13,489 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-13 09:07:13,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:13,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601825243] [2024-10-13 09:07:13,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601825243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:13,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:13,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:07:13,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823634609] [2024-10-13 09:07:13,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:13,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:07:13,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:13,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:07:13,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:07:13,494 INFO L87 Difference]: Start difference. First operand 420 states and 601 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-13 09:07:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:13,742 INFO L93 Difference]: Finished difference Result 1027 states and 1478 transitions. [2024-10-13 09:07:13,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:07:13,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-13 09:07:13,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:13,750 INFO L225 Difference]: With dead ends: 1027 [2024-10-13 09:07:13,751 INFO L226 Difference]: Without dead ends: 818 [2024-10-13 09:07:13,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:07:13,757 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 554 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:13,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1826 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 09:07:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-13 09:07:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 422. [2024-10-13 09:07:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4413965087281795) internal successors, (578), 406 states have internal predecessors, (578), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 603 transitions. [2024-10-13 09:07:13,807 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 603 transitions. Word has length 9 [2024-10-13 09:07:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:13,807 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 603 transitions. [2024-10-13 09:07:13,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-13 09:07:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 603 transitions. [2024-10-13 09:07:13,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 09:07:13,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:13,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:13,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:07:13,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:13,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 992376086, now seen corresponding path program 1 times [2024-10-13 09:07:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:13,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725978967] [2024-10-13 09:07:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:13,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:14,111 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-13 09:07:14,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:14,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725978967] [2024-10-13 09:07:14,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725978967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:14,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:14,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:07:14,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827308023] [2024-10-13 09:07:14,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:14,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:07:14,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:14,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:07:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:07:14,115 INFO L87 Difference]: Start difference. First operand 422 states and 603 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:14,221 INFO L93 Difference]: Finished difference Result 844 states and 1206 transitions. [2024-10-13 09:07:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:07:14,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-13 09:07:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:14,224 INFO L225 Difference]: With dead ends: 844 [2024-10-13 09:07:14,228 INFO L226 Difference]: Without dead ends: 425 [2024-10-13 09:07:14,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:07:14,230 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 106 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:14,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1607 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:07:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-13 09:07:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2024-10-13 09:07:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4239401496259352) internal successors, (571), 406 states have internal predecessors, (571), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 596 transitions. [2024-10-13 09:07:14,252 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 596 transitions. Word has length 64 [2024-10-13 09:07:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:14,252 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 596 transitions. [2024-10-13 09:07:14,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 596 transitions. [2024-10-13 09:07:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 09:07:14,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:14,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:14,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:07:14,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:14,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash 696880968, now seen corresponding path program 1 times [2024-10-13 09:07:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:14,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511249113] [2024-10-13 09:07:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:14,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:07:14,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:14,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511249113] [2024-10-13 09:07:14,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511249113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:14,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:14,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:07:14,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564343188] [2024-10-13 09:07:14,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:14,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:07:14,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:14,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:07:14,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:07:14,429 INFO L87 Difference]: Start difference. First operand 422 states and 596 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:14,537 INFO L93 Difference]: Finished difference Result 793 states and 1114 transitions. [2024-10-13 09:07:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:07:14,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-13 09:07:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:14,540 INFO L225 Difference]: With dead ends: 793 [2024-10-13 09:07:14,541 INFO L226 Difference]: Without dead ends: 374 [2024-10-13 09:07:14,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:07:14,543 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 9 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:14,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1456 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:07:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-13 09:07:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-10-13 09:07:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.3909348441926346) internal successors, (491), 358 states have internal predecessors, (491), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 516 transitions. [2024-10-13 09:07:14,561 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 516 transitions. Word has length 64 [2024-10-13 09:07:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:14,562 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 516 transitions. [2024-10-13 09:07:14,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 516 transitions. [2024-10-13 09:07:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 09:07:14,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:14,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:14,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:07:14,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:14,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2068688266, now seen corresponding path program 1 times [2024-10-13 09:07:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:14,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374084165] [2024-10-13 09:07:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:14,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:15,012 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-13 09:07:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:15,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374084165] [2024-10-13 09:07:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374084165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:15,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:07:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984923093] [2024-10-13 09:07:15,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:15,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:07:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:07:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:07:15,019 INFO L87 Difference]: Start difference. First operand 374 states and 516 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:15,407 INFO L93 Difference]: Finished difference Result 750 states and 1037 transitions. [2024-10-13 09:07:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:07:15,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-13 09:07:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:15,411 INFO L225 Difference]: With dead ends: 750 [2024-10-13 09:07:15,411 INFO L226 Difference]: Without dead ends: 379 [2024-10-13 09:07:15,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:07:15,414 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 10 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:15,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2171 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:07:15,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-13 09:07:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2024-10-13 09:07:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 355 states have (on average 1.388732394366197) internal successors, (493), 360 states have internal predecessors, (493), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 518 transitions. [2024-10-13 09:07:15,446 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 518 transitions. Word has length 64 [2024-10-13 09:07:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:15,447 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 518 transitions. [2024-10-13 09:07:15,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 518 transitions. [2024-10-13 09:07:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 09:07:15,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:15,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:15,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:07:15,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:15,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:15,450 INFO L85 PathProgramCache]: Analyzing trace with hash -437125107, now seen corresponding path program 1 times [2024-10-13 09:07:15,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:15,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130937689] [2024-10-13 09:07:15,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:15,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:15,786 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-13 09:07:15,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:15,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130937689] [2024-10-13 09:07:15,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130937689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:15,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:15,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:07:15,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108627329] [2024-10-13 09:07:15,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:15,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:07:15,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:15,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:07:15,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:07:15,789 INFO L87 Difference]: Start difference. First operand 376 states and 518 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:15,927 INFO L93 Difference]: Finished difference Result 749 states and 1033 transitions. [2024-10-13 09:07:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:07:15,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-13 09:07:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:15,931 INFO L225 Difference]: With dead ends: 749 [2024-10-13 09:07:15,931 INFO L226 Difference]: Without dead ends: 376 [2024-10-13 09:07:15,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:07:15,933 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 13 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:15,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1368 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:07:15,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-13 09:07:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2024-10-13 09:07:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 355 states have (on average 1.3859154929577464) internal successors, (492), 360 states have internal predecessors, (492), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 517 transitions. [2024-10-13 09:07:15,947 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 517 transitions. Word has length 65 [2024-10-13 09:07:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:15,948 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 517 transitions. [2024-10-13 09:07:15,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 517 transitions. [2024-10-13 09:07:15,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 09:07:15,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:15,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:15,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:07:15,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:15,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2023236473, now seen corresponding path program 1 times [2024-10-13 09:07:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:15,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165585870] [2024-10-13 09:07:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:16,253 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-13 09:07:16,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165585870] [2024-10-13 09:07:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165585870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:16,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:16,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:07:16,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058965231] [2024-10-13 09:07:16,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:16,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:07:16,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:16,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:07:16,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:07:16,258 INFO L87 Difference]: Start difference. First operand 376 states and 517 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:16,598 INFO L93 Difference]: Finished difference Result 754 states and 1039 transitions. [2024-10-13 09:07:16,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:07:16,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-13 09:07:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:16,601 INFO L225 Difference]: With dead ends: 754 [2024-10-13 09:07:16,602 INFO L226 Difference]: Without dead ends: 381 [2024-10-13 09:07:16,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:07:16,603 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 10 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:16,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2605 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:07:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-13 09:07:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 380. [2024-10-13 09:07:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 359 states have (on average 1.384401114206128) internal successors, (497), 364 states have internal predecessors, (497), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 522 transitions. [2024-10-13 09:07:16,615 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 522 transitions. Word has length 65 [2024-10-13 09:07:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:16,615 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 522 transitions. [2024-10-13 09:07:16,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 522 transitions. [2024-10-13 09:07:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 09:07:16,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:16,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:16,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:07:16,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:16,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash 946071343, now seen corresponding path program 1 times [2024-10-13 09:07:16,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:16,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472193753] [2024-10-13 09:07:16,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:16,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:16,839 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-13 09:07:16,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:16,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472193753] [2024-10-13 09:07:16,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472193753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:16,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:16,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:07:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079395456] [2024-10-13 09:07:16,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:16,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:07:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:16,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:07:16,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:07:16,841 INFO L87 Difference]: Start difference. First operand 380 states and 522 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:17,064 INFO L93 Difference]: Finished difference Result 760 states and 1046 transitions. [2024-10-13 09:07:17,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:07:17,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-13 09:07:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:17,067 INFO L225 Difference]: With dead ends: 760 [2024-10-13 09:07:17,067 INFO L226 Difference]: Without dead ends: 383 [2024-10-13 09:07:17,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:07:17,069 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 4 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:17,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1788 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 09:07:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-13 09:07:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-10-13 09:07:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 362 states have (on average 1.3812154696132597) internal successors, (500), 367 states have internal predecessors, (500), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 525 transitions. [2024-10-13 09:07:17,080 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 525 transitions. Word has length 66 [2024-10-13 09:07:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:17,081 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 525 transitions. [2024-10-13 09:07:17,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 525 transitions. [2024-10-13 09:07:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 09:07:17,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:17,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:17,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:07:17,082 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:17,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1827898922, now seen corresponding path program 1 times [2024-10-13 09:07:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:17,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773010454] [2024-10-13 09:07:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:17,524 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-13 09:07:17,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:17,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773010454] [2024-10-13 09:07:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773010454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 09:07:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884574853] [2024-10-13 09:07:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:17,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 09:07:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:17,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 09:07:17,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:07:17,528 INFO L87 Difference]: Start difference. First operand 383 states and 525 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:18,052 INFO L93 Difference]: Finished difference Result 776 states and 1068 transitions. [2024-10-13 09:07:18,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 09:07:18,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-13 09:07:18,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:18,056 INFO L225 Difference]: With dead ends: 776 [2024-10-13 09:07:18,056 INFO L226 Difference]: Without dead ends: 396 [2024-10-13 09:07:18,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-13 09:07:18,058 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 30 mSDsluCounter, 3033 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:18,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3520 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:07:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-13 09:07:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2024-10-13 09:07:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.381720430107527) internal successors, (514), 377 states have internal predecessors, (514), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 539 transitions. [2024-10-13 09:07:18,073 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 539 transitions. Word has length 66 [2024-10-13 09:07:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:18,073 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 539 transitions. [2024-10-13 09:07:18,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 539 transitions. [2024-10-13 09:07:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 09:07:18,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:18,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:18,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:07:18,076 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:18,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash -215227921, now seen corresponding path program 1 times [2024-10-13 09:07:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868610972] [2024-10-13 09:07:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:18,564 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-13 09:07:18,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:18,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868610972] [2024-10-13 09:07:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868610972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:18,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:18,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 09:07:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524093980] [2024-10-13 09:07:18,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:18,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 09:07:18,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:18,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 09:07:18,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:07:18,567 INFO L87 Difference]: Start difference. First operand 393 states and 539 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:19,009 INFO L93 Difference]: Finished difference Result 786 states and 1080 transitions. [2024-10-13 09:07:19,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 09:07:19,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-13 09:07:19,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:19,012 INFO L225 Difference]: With dead ends: 786 [2024-10-13 09:07:19,012 INFO L226 Difference]: Without dead ends: 396 [2024-10-13 09:07:19,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:07:19,014 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 23 mSDsluCounter, 2592 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:19,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3083 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 09:07:19,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-13 09:07:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-10-13 09:07:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 375 states have (on average 1.3786666666666667) internal successors, (517), 380 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 542 transitions. [2024-10-13 09:07:19,026 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 542 transitions. Word has length 66 [2024-10-13 09:07:19,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:19,027 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 542 transitions. [2024-10-13 09:07:19,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:19,027 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 542 transitions. [2024-10-13 09:07:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 09:07:19,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:19,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:19,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:07:19,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:19,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1927888144, now seen corresponding path program 1 times [2024-10-13 09:07:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:19,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225757379] [2024-10-13 09:07:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:19,391 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-13 09:07:19,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:19,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225757379] [2024-10-13 09:07:19,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225757379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:19,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:19,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:07:19,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579376706] [2024-10-13 09:07:19,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:19,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:07:19,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:19,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:07:19,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:07:19,393 INFO L87 Difference]: Start difference. First operand 396 states and 542 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:20,140 INFO L93 Difference]: Finished difference Result 794 states and 1089 transitions. [2024-10-13 09:07:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:07:20,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-13 09:07:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:20,143 INFO L225 Difference]: With dead ends: 794 [2024-10-13 09:07:20,143 INFO L226 Difference]: Without dead ends: 401 [2024-10-13 09:07:20,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:07:20,145 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 9 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:20,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2611 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 09:07:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-13 09:07:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 396. [2024-10-13 09:07:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 375 states have (on average 1.3786666666666667) internal successors, (517), 380 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 542 transitions. [2024-10-13 09:07:20,157 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 542 transitions. Word has length 67 [2024-10-13 09:07:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:20,157 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 542 transitions. [2024-10-13 09:07:20,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 542 transitions. [2024-10-13 09:07:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 09:07:20,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:20,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:20,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:07:20,159 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:20,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1191157692, now seen corresponding path program 1 times [2024-10-13 09:07:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:20,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892468760] [2024-10-13 09:07:20,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:20,743 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-13 09:07:20,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892468760] [2024-10-13 09:07:20,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892468760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:20,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:20,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 09:07:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261730809] [2024-10-13 09:07:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:20,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 09:07:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 09:07:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:07:20,745 INFO L87 Difference]: Start difference. First operand 396 states and 542 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:21,664 INFO L93 Difference]: Finished difference Result 1144 states and 1578 transitions. [2024-10-13 09:07:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:07:21,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-13 09:07:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:21,668 INFO L225 Difference]: With dead ends: 1144 [2024-10-13 09:07:21,668 INFO L226 Difference]: Without dead ends: 751 [2024-10-13 09:07:21,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-13 09:07:21,670 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 598 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:21,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2935 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 09:07:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-10-13 09:07:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 427. [2024-10-13 09:07:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 406 states have (on average 1.3497536945812807) internal successors, (548), 411 states have internal predecessors, (548), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 573 transitions. [2024-10-13 09:07:21,689 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 573 transitions. Word has length 67 [2024-10-13 09:07:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:21,689 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 573 transitions. [2024-10-13 09:07:21,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 573 transitions. [2024-10-13 09:07:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 09:07:21,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:21,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:21,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:07:21,691 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:21,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1668996667, now seen corresponding path program 1 times [2024-10-13 09:07:21,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:21,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048381741] [2024-10-13 09:07:21,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:21,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:22,019 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-13 09:07:22,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:22,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048381741] [2024-10-13 09:07:22,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048381741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:22,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:22,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 09:07:22,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460624978] [2024-10-13 09:07:22,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:22,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 09:07:22,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:22,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 09:07:22,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:07:22,022 INFO L87 Difference]: Start difference. First operand 427 states and 573 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:22,400 INFO L93 Difference]: Finished difference Result 830 states and 1126 transitions. [2024-10-13 09:07:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 09:07:22,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-13 09:07:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:22,403 INFO L225 Difference]: With dead ends: 830 [2024-10-13 09:07:22,403 INFO L226 Difference]: Without dead ends: 437 [2024-10-13 09:07:22,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:07:22,407 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 16 mSDsluCounter, 2619 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:22,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3105 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:07:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-13 09:07:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 430. [2024-10-13 09:07:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.3496332518337408) internal successors, (552), 414 states have internal predecessors, (552), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 577 transitions. [2024-10-13 09:07:22,426 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 577 transitions. Word has length 68 [2024-10-13 09:07:22,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:22,426 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 577 transitions. [2024-10-13 09:07:22,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 577 transitions. [2024-10-13 09:07:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 09:07:22,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:22,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:22,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:07:22,429 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:22,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash -488729825, now seen corresponding path program 1 times [2024-10-13 09:07:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:22,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679518317] [2024-10-13 09:07:22,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:22,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-13 09:07:22,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:22,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679518317] [2024-10-13 09:07:22,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679518317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:22,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:22,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 09:07:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324051862] [2024-10-13 09:07:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:22,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 09:07:22,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 09:07:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:07:22,748 INFO L87 Difference]: Start difference. First operand 430 states and 577 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:23,261 INFO L93 Difference]: Finished difference Result 836 states and 1134 transitions. [2024-10-13 09:07:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:07:23,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-13 09:07:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:23,264 INFO L225 Difference]: With dead ends: 836 [2024-10-13 09:07:23,265 INFO L226 Difference]: Without dead ends: 440 [2024-10-13 09:07:23,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:07:23,266 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 26 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:23,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3456 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:07:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-13 09:07:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 430. [2024-10-13 09:07:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.3496332518337408) internal successors, (552), 414 states have internal predecessors, (552), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 577 transitions. [2024-10-13 09:07:23,284 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 577 transitions. Word has length 68 [2024-10-13 09:07:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:23,285 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 577 transitions. [2024-10-13 09:07:23,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 577 transitions. [2024-10-13 09:07:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 09:07:23,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:23,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:23,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:07:23,286 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash -29765440, now seen corresponding path program 1 times [2024-10-13 09:07:23,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:23,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026584166] [2024-10-13 09:07:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:23,642 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-13 09:07:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:23,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026584166] [2024-10-13 09:07:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026584166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:23,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:23,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 09:07:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775524861] [2024-10-13 09:07:23,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:23,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:07:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:23,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:07:23,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:07:23,645 INFO L87 Difference]: Start difference. First operand 430 states and 577 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:24,150 INFO L93 Difference]: Finished difference Result 842 states and 1143 transitions. [2024-10-13 09:07:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:07:24,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-13 09:07:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:24,153 INFO L225 Difference]: With dead ends: 842 [2024-10-13 09:07:24,153 INFO L226 Difference]: Without dead ends: 446 [2024-10-13 09:07:24,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-13 09:07:24,155 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 22 mSDsluCounter, 3018 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3511 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:24,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3511 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 09:07:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-13 09:07:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2024-10-13 09:07:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 419 states have (on average 1.3460620525059666) internal successors, (564), 424 states have internal predecessors, (564), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 589 transitions. [2024-10-13 09:07:24,174 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 589 transitions. Word has length 69 [2024-10-13 09:07:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:24,174 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 589 transitions. [2024-10-13 09:07:24,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2024-10-13 09:07:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 09:07:24,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:24,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:24,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:07:24,175 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:24,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1800190044, now seen corresponding path program 1 times [2024-10-13 09:07:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:24,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625254185] [2024-10-13 09:07:24,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:24,513 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-13 09:07:24,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:24,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625254185] [2024-10-13 09:07:24,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625254185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:24,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:24,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 09:07:24,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878433710] [2024-10-13 09:07:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:24,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:07:24,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:24,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:07:24,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:07:24,516 INFO L87 Difference]: Start difference. First operand 440 states and 589 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:25,081 INFO L93 Difference]: Finished difference Result 862 states and 1167 transitions. [2024-10-13 09:07:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:07:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-13 09:07:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:25,085 INFO L225 Difference]: With dead ends: 862 [2024-10-13 09:07:25,085 INFO L226 Difference]: Without dead ends: 456 [2024-10-13 09:07:25,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:07:25,087 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 13 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:25,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3919 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:07:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-13 09:07:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 443. [2024-10-13 09:07:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 422 states have (on average 1.3459715639810426) internal successors, (568), 427 states have internal predecessors, (568), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 593 transitions. [2024-10-13 09:07:25,105 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 593 transitions. Word has length 69 [2024-10-13 09:07:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:25,105 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 593 transitions. [2024-10-13 09:07:25,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 593 transitions. [2024-10-13 09:07:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 09:07:25,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:25,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:25,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:07:25,107 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:25,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash 302137308, now seen corresponding path program 1 times [2024-10-13 09:07:25,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:25,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344416957] [2024-10-13 09:07:25,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:25,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:25,480 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-13 09:07:25,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:25,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344416957] [2024-10-13 09:07:25,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344416957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:25,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:25,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:07:25,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504736429] [2024-10-13 09:07:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:25,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:07:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:07:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:07:25,484 INFO L87 Difference]: Start difference. First operand 443 states and 593 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:25,809 INFO L93 Difference]: Finished difference Result 857 states and 1157 transitions. [2024-10-13 09:07:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:07:25,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-13 09:07:25,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:25,813 INFO L225 Difference]: With dead ends: 857 [2024-10-13 09:07:25,814 INFO L226 Difference]: Without dead ends: 448 [2024-10-13 09:07:25,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:07:25,815 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 7 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:25,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2635 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:07:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-13 09:07:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 443. [2024-10-13 09:07:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 422 states have (on average 1.3436018957345972) internal successors, (567), 427 states have internal predecessors, (567), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 592 transitions. [2024-10-13 09:07:25,830 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 592 transitions. Word has length 69 [2024-10-13 09:07:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:25,830 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 592 transitions. [2024-10-13 09:07:25,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 592 transitions. [2024-10-13 09:07:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 09:07:25,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:25,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:25,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:07:25,833 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:25,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:25,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1914808309, now seen corresponding path program 1 times [2024-10-13 09:07:25,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:25,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899353237] [2024-10-13 09:07:25,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:07:26,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:26,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899353237] [2024-10-13 09:07:26,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899353237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:26,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:26,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:07:26,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676598055] [2024-10-13 09:07:26,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:26,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:07:26,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:26,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:07:26,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:07:26,122 INFO L87 Difference]: Start difference. First operand 443 states and 592 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:26,480 INFO L93 Difference]: Finished difference Result 855 states and 1155 transitions. [2024-10-13 09:07:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:07:26,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-13 09:07:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:26,484 INFO L225 Difference]: With dead ends: 855 [2024-10-13 09:07:26,484 INFO L226 Difference]: Without dead ends: 446 [2024-10-13 09:07:26,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:07:26,486 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 4 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:26,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2594 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:07:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-13 09:07:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2024-10-13 09:07:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 425 states have (on average 1.3411764705882352) internal successors, (570), 430 states have internal predecessors, (570), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:26,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 595 transitions. [2024-10-13 09:07:26,502 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 595 transitions. Word has length 69 [2024-10-13 09:07:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:26,502 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 595 transitions. [2024-10-13 09:07:26,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 595 transitions. [2024-10-13 09:07:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 09:07:26,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:26,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:26,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:07:26,503 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:26,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash 48213054, now seen corresponding path program 1 times [2024-10-13 09:07:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:26,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094066499] [2024-10-13 09:07:26,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:26,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:26,950 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-13 09:07:26,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094066499] [2024-10-13 09:07:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094066499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:26,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 09:07:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108595987] [2024-10-13 09:07:26,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:26,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:07:26,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:26,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:07:26,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:07:26,953 INFO L87 Difference]: Start difference. First operand 446 states and 595 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:27,759 INFO L93 Difference]: Finished difference Result 870 states and 1174 transitions. [2024-10-13 09:07:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:07:27,759 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-13 09:07:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:27,762 INFO L225 Difference]: With dead ends: 870 [2024-10-13 09:07:27,762 INFO L226 Difference]: Without dead ends: 458 [2024-10-13 09:07:27,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:07:27,764 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 9 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3903 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:27,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3903 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 09:07:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-13 09:07:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 450. [2024-10-13 09:07:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 429 states have (on average 1.3403263403263403) internal successors, (575), 434 states have internal predecessors, (575), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 600 transitions. [2024-10-13 09:07:27,783 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 600 transitions. Word has length 70 [2024-10-13 09:07:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:27,783 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 600 transitions. [2024-10-13 09:07:27,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 600 transitions. [2024-10-13 09:07:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 09:07:27,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:27,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:27,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:07:27,786 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:27,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1976786731, now seen corresponding path program 1 times [2024-10-13 09:07:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:27,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885961445] [2024-10-13 09:07:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:28,124 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-13 09:07:28,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:28,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885961445] [2024-10-13 09:07:28,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885961445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:28,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:28,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 09:07:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698049924] [2024-10-13 09:07:28,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:28,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 09:07:28,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:28,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 09:07:28,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:07:28,127 INFO L87 Difference]: Start difference. First operand 450 states and 600 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:28,681 INFO L93 Difference]: Finished difference Result 879 states and 1184 transitions. [2024-10-13 09:07:28,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:07:28,681 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-13 09:07:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:28,684 INFO L225 Difference]: With dead ends: 879 [2024-10-13 09:07:28,684 INFO L226 Difference]: Without dead ends: 463 [2024-10-13 09:07:28,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:07:28,685 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 22 mSDsluCounter, 3914 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4401 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:28,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4401 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:07:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-13 09:07:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 453. [2024-10-13 09:07:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 432 states have (on average 1.337962962962963) internal successors, (578), 437 states have internal predecessors, (578), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 603 transitions. [2024-10-13 09:07:28,702 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 603 transitions. Word has length 70 [2024-10-13 09:07:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:28,702 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 603 transitions. [2024-10-13 09:07:28,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2024-10-13 09:07:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 09:07:28,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:28,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:28,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:07:28,703 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:28,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash 942258210, now seen corresponding path program 1 times [2024-10-13 09:07:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:28,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506090927] [2024-10-13 09:07:28,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:28,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:29,249 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-13 09:07:29,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:29,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506090927] [2024-10-13 09:07:29,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506090927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:29,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:29,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 09:07:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329485860] [2024-10-13 09:07:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:29,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:07:29,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:29,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:07:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:07:29,253 INFO L87 Difference]: Start difference. First operand 453 states and 603 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:33,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 09:07:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:34,029 INFO L93 Difference]: Finished difference Result 876 states and 1178 transitions. [2024-10-13 09:07:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:07:34,029 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-13 09:07:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:34,032 INFO L225 Difference]: With dead ends: 876 [2024-10-13 09:07:34,032 INFO L226 Difference]: Without dead ends: 457 [2024-10-13 09:07:34,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-13 09:07:34,034 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 31 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:34,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3426 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 652 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 09:07:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-13 09:07:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 454. [2024-10-13 09:07:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 433 states have (on average 1.3371824480369514) internal successors, (579), 438 states have internal predecessors, (579), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 604 transitions. [2024-10-13 09:07:34,054 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 604 transitions. Word has length 70 [2024-10-13 09:07:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:34,055 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 604 transitions. [2024-10-13 09:07:34,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 604 transitions. [2024-10-13 09:07:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 09:07:34,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:34,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:34,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 09:07:34,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:34,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:34,057 INFO L85 PathProgramCache]: Analyzing trace with hash -894204710, now seen corresponding path program 1 times [2024-10-13 09:07:34,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:34,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233015996] [2024-10-13 09:07:34,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:34,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:34,328 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-13 09:07:34,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:07:34,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233015996] [2024-10-13 09:07:34,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233015996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:07:34,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:07:34,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 09:07:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552531662] [2024-10-13 09:07:34,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:07:34,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 09:07:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:07:34,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 09:07:34,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:07:34,331 INFO L87 Difference]: Start difference. First operand 454 states and 604 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:07:34,878 INFO L93 Difference]: Finished difference Result 883 states and 1187 transitions. [2024-10-13 09:07:34,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:07:34,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-13 09:07:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:07:34,883 INFO L225 Difference]: With dead ends: 883 [2024-10-13 09:07:34,883 INFO L226 Difference]: Without dead ends: 463 [2024-10-13 09:07:34,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:07:34,886 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 22 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:07:34,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3456 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:07:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-13 09:07:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 451. [2024-10-13 09:07:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 430 states have (on average 1.3395348837209302) internal successors, (576), 435 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:07:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 601 transitions. [2024-10-13 09:07:34,907 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 601 transitions. Word has length 70 [2024-10-13 09:07:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:07:34,907 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 601 transitions. [2024-10-13 09:07:34,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:07:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 601 transitions. [2024-10-13 09:07:34,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 09:07:34,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:07:34,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:07:34,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 09:07:34,909 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-13 09:07:34,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:07:34,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1497195914, now seen corresponding path program 1 times [2024-10-13 09:07:34,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:07:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104565244] [2024-10-13 09:07:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:07:34,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:07:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:07:47,980 WARN L286 SmtUtils]: Spent 7.68s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 09:08:00,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2024-10-13 09:08:00,974 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-13 09:08:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:08:00,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104565244] [2024-10-13 09:08:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104565244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:08:00,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:08:00,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 09:08:00,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311969884] [2024-10-13 09:08:00,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:08:00,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 09:08:00,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:08:00,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 09:08:00,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-10-13 09:08:00,977 INFO L87 Difference]: Start difference. First operand 451 states and 601 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:08:04,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 09:08:08,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 09:08:12,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 09:08:16,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 09:08:20,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 09:08:24,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 09:08:28,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 09:08:32,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []