./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-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 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 13:58:31,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 13:58:31,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 13:58:31,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 13:58:31,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 13:58:31,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 13:58:31,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 13:58:31,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 13:58:31,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 13:58:31,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 13:58:31,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 13:58:31,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 13:58:31,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 13:58:31,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 13:58:31,250 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 13:58:31,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 13:58:31,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 13:58:31,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 13:58:31,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 13:58:31,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 13:58:31,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 13:58:31,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 13:58:31,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 13:58:31,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 13:58:31,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 13:58:31,256 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 13:58:31,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 13:58:31,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 13:58:31,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 13:58:31,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 13:58:31,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 13:58:31,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 13:58:31,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 13:58:31,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 13:58:31,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 13:58:31,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 13:58:31,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 13:58:31,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 13:58:31,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 13:58:31,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 13:58:31,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 13:58:31,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 13:58:31,260 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 -> 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 [2024-11-10 13:58:31,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 13:58:31,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 13:58:31,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 13:58:31,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 13:58:31,506 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 13:58:31,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-11-10 13:58:32,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 13:58:32,972 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 13:58:32,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-11-10 13:58:32,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c49c8baa9/dbd57368603a4d3da6f7e67ea1aa5d70/FLAG379a5207a [2024-11-10 13:58:33,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c49c8baa9/dbd57368603a4d3da6f7e67ea1aa5d70 [2024-11-10 13:58:33,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 13:58:33,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 13:58:33,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 13:58:33,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 13:58:33,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 13:58:33,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1a7f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33, skipping insertion in model container [2024-11-10 13:58:33,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 13:58:33,418 WARN L250 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_OAT_test4-1.i[33021,33034] [2024-11-10 13:58:33,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 13:58:33,522 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 13:58:33,555 WARN L250 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_OAT_test4-1.i[33021,33034] [2024-11-10 13:58:33,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 13:58:33,647 INFO L204 MainTranslator]: Completed translation [2024-11-10 13:58:33,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33 WrapperNode [2024-11-10 13:58:33,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 13:58:33,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 13:58:33,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 13:58:33,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 13:58:33,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,735 INFO L138 Inliner]: procedures = 176, calls = 335, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1552 [2024-11-10 13:58:33,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 13:58:33,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 13:58:33,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 13:58:33,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 13:58:33,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,856 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-10 13:58:33,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 13:58:33,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 13:58:33,916 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 13:58:33,916 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 13:58:33,917 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (1/1) ... [2024-11-10 13:58:33,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 13:58:33,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 13:58:33,943 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-11-10 13:58:33,949 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-11-10 13:58:33,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 13:58:33,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 13:58:33,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 13:58:33,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 13:58:33,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 13:58:33,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 13:58:33,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 13:58:33,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 13:58:33,987 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 13:58:33,987 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 13:58:33,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 13:58:33,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 13:58:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 13:58:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 13:58:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 13:58:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 13:58:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 13:58:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 13:58:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 13:58:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 13:58:33,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 13:58:34,158 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 13:58:34,159 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 13:58:35,359 INFO L? ?]: Removed 387 outVars from TransFormulas that were not future-live. [2024-11-10 13:58:35,359 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 13:58:35,404 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 13:58:35,405 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 13:58:35,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:58:35 BoogieIcfgContainer [2024-11-10 13:58:35,405 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 13:58:35,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 13:58:35,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 13:58:35,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 13:58:35,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:58:33" (1/3) ... [2024-11-10 13:58:35,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19615b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:58:35, skipping insertion in model container [2024-11-10 13:58:35,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:58:33" (2/3) ... [2024-11-10 13:58:35,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19615b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:58:35, skipping insertion in model container [2024-11-10 13:58:35,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:58:35" (3/3) ... [2024-11-10 13:58:35,415 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-1.i [2024-11-10 13:58:35,426 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 13:58:35,427 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 13:58:35,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 13:58:35,491 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;@9efb660, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 13:58:35,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 13:58:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 430 states, 410 states have (on average 1.6097560975609757) internal successors, (660), 421 states have internal predecessors, (660), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 13:58:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 13:58:35,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:58:35,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:58:35,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:58:35,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:58:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1239807142, now seen corresponding path program 1 times [2024-11-10 13:58:35,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:58:35,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969632657] [2024-11-10 13:58:35,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:35,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:58:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 13:58:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:58:35,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969632657] [2024-11-10 13:58:35,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969632657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:58:35,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:58:35,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 13:58:35,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685040627] [2024-11-10 13:58:35,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:58:35,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 13:58:35,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:58:35,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 13:58:35,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 13:58:35,656 INFO L87 Difference]: Start difference. First operand has 430 states, 410 states have (on average 1.6097560975609757) internal successors, (660), 421 states have internal predecessors, (660), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:58:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:58:35,777 INFO L93 Difference]: Finished difference Result 858 states and 1392 transitions. [2024-11-10 13:58:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 13:58:35,779 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 13:58:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:58:35,791 INFO L225 Difference]: With dead ends: 858 [2024-11-10 13:58:35,792 INFO L226 Difference]: Without dead ends: 426 [2024-11-10 13:58:35,798 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-11-10 13:58:35,802 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 13:58:35,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 13:58:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-10 13:58:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2024-11-10 13:58:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 407 states have (on average 1.4447174447174447) internal successors, (588), 417 states have internal predecessors, (588), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 13:58:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2024-11-10 13:58:35,850 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 11 [2024-11-10 13:58:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:58:35,850 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2024-11-10 13:58:35,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:58:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2024-11-10 13:58:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 13:58:35,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:58:35,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:58:35,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 13:58:35,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:58:35,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:58:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1384729888, now seen corresponding path program 1 times [2024-11-10 13:58:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:58:35,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807016685] [2024-11-10 13:58:35,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:35,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:58:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 13:58:35,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:58:35,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807016685] [2024-11-10 13:58:35,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807016685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:58:35,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:58:35,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 13:58:35,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123822351] [2024-11-10 13:58:35,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:58:35,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 13:58:35,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:58:35,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 13:58:35,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 13:58:35,916 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:58:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:58:36,076 INFO L93 Difference]: Finished difference Result 846 states and 1234 transitions. [2024-11-10 13:58:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 13:58:36,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-10 13:58:36,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:58:36,085 INFO L225 Difference]: With dead ends: 846 [2024-11-10 13:58:36,085 INFO L226 Difference]: Without dead ends: 815 [2024-11-10 13:58:36,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 13:58:36,087 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 549 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 13:58:36,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1230 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 13:58:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-11-10 13:58:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 428. [2024-11-10 13:58:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 409 states have (on average 1.4425427872860637) internal successors, (590), 419 states have internal predecessors, (590), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 13:58:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 622 transitions. [2024-11-10 13:58:36,158 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 622 transitions. Word has length 12 [2024-11-10 13:58:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:58:36,159 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 622 transitions. [2024-11-10 13:58:36,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:58:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 622 transitions. [2024-11-10 13:58:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 13:58:36,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:58:36,166 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:58:36,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 13:58:36,166 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:58:36,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:58:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1284982753, now seen corresponding path program 1 times [2024-11-10 13:58:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:58:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066450462] [2024-11-10 13:58:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:36,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:58:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 13:58:36,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:58:36,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066450462] [2024-11-10 13:58:36,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066450462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:58:36,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:58:36,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 13:58:36,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83553636] [2024-11-10 13:58:36,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:58:36,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 13:58:36,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:58:36,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 13:58:36,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 13:58:36,598 INFO L87 Difference]: Start difference. First operand 428 states and 622 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:58:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:58:36,773 INFO L93 Difference]: Finished difference Result 855 states and 1243 transitions. [2024-11-10 13:58:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 13:58:36,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-11-10 13:58:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:58:36,775 INFO L225 Difference]: With dead ends: 855 [2024-11-10 13:58:36,776 INFO L226 Difference]: Without dead ends: 431 [2024-11-10 13:58:36,776 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-11-10 13:58:36,777 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 105 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 13:58:36,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1559 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 13:58:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-10 13:58:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 428. [2024-11-10 13:58:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 409 states have (on average 1.4254278728606358) internal successors, (583), 419 states have internal predecessors, (583), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 13:58:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 615 transitions. [2024-11-10 13:58:36,795 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 615 transitions. Word has length 161 [2024-11-10 13:58:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:58:36,795 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 615 transitions. [2024-11-10 13:58:36,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:58:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 615 transitions. [2024-11-10 13:58:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 13:58:36,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:58:36,803 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:58:36,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 13:58:36,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:58:36,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:58:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2049306650, now seen corresponding path program 1 times [2024-11-10 13:58:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:58:36,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033833192] [2024-11-10 13:58:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:36,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:58:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 13:58:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:58:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033833192] [2024-11-10 13:58:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033833192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:58:37,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:58:37,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 13:58:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568046562] [2024-11-10 13:58:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:58:37,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 13:58:37,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:58:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 13:58:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 13:58:37,037 INFO L87 Difference]: Start difference. First operand 428 states and 615 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:58:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:58:37,146 INFO L93 Difference]: Finished difference Result 858 states and 1235 transitions. [2024-11-10 13:58:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 13:58:37,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-11-10 13:58:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:58:37,149 INFO L225 Difference]: With dead ends: 858 [2024-11-10 13:58:37,149 INFO L226 Difference]: Without dead ends: 434 [2024-11-10 13:58:37,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 13:58:37,153 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 1 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 13:58:37,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1104 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 13:58:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-10 13:58:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2024-11-10 13:58:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 415 states have (on average 1.419277108433735) internal successors, (589), 425 states have internal predecessors, (589), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 13:58:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 621 transitions. [2024-11-10 13:58:37,167 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 621 transitions. Word has length 161 [2024-11-10 13:58:37,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:58:37,168 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 621 transitions. [2024-11-10 13:58:37,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:58:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 621 transitions. [2024-11-10 13:58:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 13:58:37,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:58:37,173 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:58:37,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 13:58:37,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:58:37,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:58:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1776870363, now seen corresponding path program 1 times [2024-11-10 13:58:37,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:58:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365158103] [2024-11-10 13:58:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:37,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:58:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 13:58:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:58:37,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365158103] [2024-11-10 13:58:37,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365158103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:58:37,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:58:37,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 13:58:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157020466] [2024-11-10 13:58:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:58:37,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 13:58:37,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:58:37,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 13:58:37,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 13:58:37,359 INFO L87 Difference]: Start difference. First operand 434 states and 621 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:58:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:58:37,487 INFO L93 Difference]: Finished difference Result 1000 states and 1434 transitions. [2024-11-10 13:58:37,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 13:58:37,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-11-10 13:58:37,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:58:37,491 INFO L225 Difference]: With dead ends: 1000 [2024-11-10 13:58:37,491 INFO L226 Difference]: Without dead ends: 570 [2024-11-10 13:58:37,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 13:58:37,493 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 134 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 13:58:37,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1129 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 13:58:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-10 13:58:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2024-11-10 13:58:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 551 states have (on average 1.4228675136116153) internal successors, (784), 561 states have internal predecessors, (784), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 13:58:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 816 transitions. [2024-11-10 13:58:37,505 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 816 transitions. Word has length 161 [2024-11-10 13:58:37,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:58:37,505 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 816 transitions. [2024-11-10 13:58:37,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:58:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 816 transitions. [2024-11-10 13:58:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 13:58:37,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:58:37,507 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:58:37,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 13:58:37,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:58:37,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:58:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash 86143702, now seen corresponding path program 1 times [2024-11-10 13:58:37,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:58:37,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87697631] [2024-11-10 13:58:37,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:37,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:58:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:37,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 13:58:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:37,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 13:58:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 13:58:37,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:58:37,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87697631] [2024-11-10 13:58:37,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87697631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:58:37,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:58:37,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 13:58:37,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939494618] [2024-11-10 13:58:37,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:58:37,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 13:58:37,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:58:37,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 13:58:37,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 13:58:37,768 INFO L87 Difference]: Start difference. First operand 570 states and 816 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 13:58:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:58:38,158 INFO L93 Difference]: Finished difference Result 961 states and 1376 transitions. [2024-11-10 13:58:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 13:58:38,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2024-11-10 13:58:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:58:38,161 INFO L225 Difference]: With dead ends: 961 [2024-11-10 13:58:38,163 INFO L226 Difference]: Without dead ends: 531 [2024-11-10 13:58:38,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 13:58:38,165 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 38 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 13:58:38,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1726 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 13:58:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-10 13:58:38,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 528. [2024-11-10 13:58:38,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 509 states have (on average 1.3889980353634577) internal successors, (707), 519 states have internal predecessors, (707), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 13:58:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 739 transitions. [2024-11-10 13:58:38,179 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 739 transitions. Word has length 176 [2024-11-10 13:58:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:58:38,180 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 739 transitions. [2024-11-10 13:58:38,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 13:58:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 739 transitions. [2024-11-10 13:58:38,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 13:58:38,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:58:38,182 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:58:38,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 13:58:38,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:58:38,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:58:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash 607994526, now seen corresponding path program 1 times [2024-11-10 13:58:38,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:58:38,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531153456] [2024-11-10 13:58:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:38,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:58:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:38,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 13:58:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:38,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 13:58:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 13:58:38,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:58:38,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531153456] [2024-11-10 13:58:38,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531153456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:58:38,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:58:38,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 13:58:38,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977516418] [2024-11-10 13:58:38,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:58:38,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 13:58:38,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:58:38,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 13:58:38,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 13:58:38,463 INFO L87 Difference]: Start difference. First operand 528 states and 739 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 13:58:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:58:38,784 INFO L93 Difference]: Finished difference Result 919 states and 1288 transitions. [2024-11-10 13:58:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 13:58:38,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2024-11-10 13:58:38,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:58:38,788 INFO L225 Difference]: With dead ends: 919 [2024-11-10 13:58:38,788 INFO L226 Difference]: Without dead ends: 531 [2024-11-10 13:58:38,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-11-10 13:58:38,791 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 9 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 13:58:38,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1309 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 13:58:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-10 13:58:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 528. [2024-11-10 13:58:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 509 states have (on average 1.3831041257367387) internal successors, (704), 519 states have internal predecessors, (704), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 13:58:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 736 transitions. [2024-11-10 13:58:38,805 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 736 transitions. Word has length 176 [2024-11-10 13:58:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:58:38,806 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 736 transitions. [2024-11-10 13:58:38,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 13:58:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 736 transitions. [2024-11-10 13:58:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 13:58:38,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:58:38,807 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:58:38,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 13:58:38,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:58:38,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:58:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash -302813988, now seen corresponding path program 1 times [2024-11-10 13:58:38,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:58:38,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017693491] [2024-11-10 13:58:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:38,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:58:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 13:58:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:39,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 13:58:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 13:58:39,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:58:39,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017693491] [2024-11-10 13:58:39,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017693491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:58:39,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:58:39,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 13:58:39,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612844451] [2024-11-10 13:58:39,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:58:39,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 13:58:39,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:58:39,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 13:58:39,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 13:58:39,032 INFO L87 Difference]: Start difference. First operand 528 states and 736 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 13:58:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:58:39,424 INFO L93 Difference]: Finished difference Result 1067 states and 1482 transitions. [2024-11-10 13:58:39,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 13:58:39,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2024-11-10 13:58:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:58:39,428 INFO L225 Difference]: With dead ends: 1067 [2024-11-10 13:58:39,429 INFO L226 Difference]: Without dead ends: 679 [2024-11-10 13:58:39,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-10 13:58:39,430 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 252 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 13:58:39,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1336 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 13:58:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-10 13:58:39,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 676. [2024-11-10 13:58:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 654 states have (on average 1.3669724770642202) internal successors, (894), 664 states have internal predecessors, (894), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 13:58:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 932 transitions. [2024-11-10 13:58:39,445 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 932 transitions. Word has length 176 [2024-11-10 13:58:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:58:39,446 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 932 transitions. [2024-11-10 13:58:39,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 13:58:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 932 transitions. [2024-11-10 13:58:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 13:58:39,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:58:39,448 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:58:39,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 13:58:39,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:58:39,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:58:39,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1199120191, now seen corresponding path program 1 times [2024-11-10 13:58:39,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:58:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085851125] [2024-11-10 13:58:39,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:58:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:39,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 13:58:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:39,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 13:58:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:39,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 13:58:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 13:58:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:58:39,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:58:39,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085851125] [2024-11-10 13:58:39,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085851125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 13:58:39,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569368271] [2024-11-10 13:58:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:39,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 13:58:39,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 13:58:39,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 13:58:39,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 13:58:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:40,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 13:58:40,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 13:58:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:58:40,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 13:58:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:58:40,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569368271] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 13:58:40,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 13:58:40,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-10 13:58:40,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766940881] [2024-11-10 13:58:40,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 13:58:40,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 13:58:40,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:58:40,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 13:58:40,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 13:58:40,526 INFO L87 Difference]: Start difference. First operand 676 states and 932 transitions. Second operand has 8 states, 8 states have (on average 62.0) internal successors, (496), 7 states have internal predecessors, (496), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 13:58:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:58:41,081 INFO L93 Difference]: Finished difference Result 1481 states and 2061 transitions. [2024-11-10 13:58:41,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 13:58:41,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 62.0) internal successors, (496), 7 states have internal predecessors, (496), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 191 [2024-11-10 13:58:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:58:41,086 INFO L225 Difference]: With dead ends: 1481 [2024-11-10 13:58:41,086 INFO L226 Difference]: Without dead ends: 1450 [2024-11-10 13:58:41,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 13:58:41,087 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 2585 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2617 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 13:58:41,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2617 Valid, 2414 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 13:58:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2024-11-10 13:58:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1447. [2024-11-10 13:58:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1410 states have (on average 1.3567375886524822) internal successors, (1913), 1420 states have internal predecessors, (1913), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 13:58:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1981 transitions. [2024-11-10 13:58:41,114 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1981 transitions. Word has length 191 [2024-11-10 13:58:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:58:41,115 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1981 transitions. [2024-11-10 13:58:41,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 62.0) internal successors, (496), 7 states have internal predecessors, (496), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 13:58:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1981 transitions. [2024-11-10 13:58:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2024-11-10 13:58:41,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:58:41,125 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:58:41,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 13:58:41,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 13:58:41,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:58:41,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:58:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash -407802038, now seen corresponding path program 1 times [2024-11-10 13:58:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:58:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721368303] [2024-11-10 13:58:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:58:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 13:58:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:42,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 13:58:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:42,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 13:58:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:42,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 13:58:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 0 proven. 890 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:58:42,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:58:42,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721368303] [2024-11-10 13:58:42,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721368303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 13:58:42,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396001344] [2024-11-10 13:58:42,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:42,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 13:58:42,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 13:58:42,494 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 13:58:42,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 13:58:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:58:43,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 3126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 13:58:43,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 13:58:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 0 proven. 890 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:58:43,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 13:58:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 0 proven. 890 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:58:44,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396001344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 13:58:44,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 13:58:44,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-10 13:58:44,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662204948] [2024-11-10 13:58:44,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 13:58:44,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 13:58:44,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:58:44,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 13:58:44,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-10 13:58:44,576 INFO L87 Difference]: Start difference. First operand 1447 states and 1981 transitions. Second operand has 14 states, 14 states have (on average 99.28571428571429) internal successors, (1390), 13 states have internal predecessors, (1390), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 13:58:45,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:58:45,540 INFO L93 Difference]: Finished difference Result 3599 states and 4992 transitions. [2024-11-10 13:58:45,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 13:58:45,540 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 99.28571428571429) internal successors, (1390), 13 states have internal predecessors, (1390), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 638 [2024-11-10 13:58:45,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:58:45,552 INFO L225 Difference]: With dead ends: 3599 [2024-11-10 13:58:45,553 INFO L226 Difference]: Without dead ends: 3568 [2024-11-10 13:58:45,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1289 GetRequests, 1277 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-10 13:58:45,554 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 6999 mSDsluCounter, 4733 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7103 SdHoareTripleChecker+Valid, 5260 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 13:58:45,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7103 Valid, 5260 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 13:58:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3568 states. [2024-11-10 13:58:45,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3568 to 3565. [2024-11-10 13:58:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 3492 states have (on average 1.3553837342497137) internal successors, (4733), 3502 states have internal predecessors, (4733), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 61 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 13:58:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4873 transitions. [2024-11-10 13:58:45,612 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4873 transitions. Word has length 638 [2024-11-10 13:58:45,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:58:45,612 INFO L471 AbstractCegarLoop]: Abstraction has 3565 states and 4873 transitions. [2024-11-10 13:58:45,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 99.28571428571429) internal successors, (1390), 13 states have internal predecessors, (1390), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 13:58:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4873 transitions. [2024-11-10 13:58:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1533 [2024-11-10 13:58:45,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:58:45,667 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:58:45,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 13:58:45,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 13:58:45,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:58:45,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:58:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash 717918314, now seen corresponding path program 2 times [2024-11-10 13:58:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:58:45,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911588716] [2024-11-10 13:58:45,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:58:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms