./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-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 67499ec0709cfdcc368630c5b1d94f26157589b8bf16f22cf5d62554760c6dd7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 14:56:04,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 14:56:04,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 14:56:04,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 14:56:04,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 14:56:05,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 14:56:05,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 14:56:05,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 14:56:05,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 14:56:05,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 14:56:05,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 14:56:05,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 14:56:05,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 14:56:05,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 14:56:05,013 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 14:56:05,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 14:56:05,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 14:56:05,015 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 14:56:05,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 14:56:05,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 14:56:05,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 14:56:05,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 14:56:05,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 14:56:05,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 14:56:05,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 14:56:05,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 14:56:05,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 14:56:05,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 14:56:05,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 14:56:05,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 14:56:05,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 14:56:05,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 14:56:05,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:56:05,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 14:56:05,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 14:56:05,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 14:56:05,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 14:56:05,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 14:56:05,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 14:56:05,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 14:56:05,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 14:56:05,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 14:56:05,023 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 -> 67499ec0709cfdcc368630c5b1d94f26157589b8bf16f22cf5d62554760c6dd7 [2024-10-24 14:56:05,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 14:56:05,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 14:56:05,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 14:56:05,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 14:56:05,345 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 14:56:05,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i [2024-10-24 14:56:06,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 14:56:07,071 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 14:56:07,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i [2024-10-24 14:56:07,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c35cdd9/5515c3c8f44d4f54b56ff0d0267ce37a/FLAG167c554ab [2024-10-24 14:56:07,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c35cdd9/5515c3c8f44d4f54b56ff0d0267ce37a [2024-10-24 14:56:07,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 14:56:07,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 14:56:07,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 14:56:07,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 14:56:07,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 14:56:07,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:07,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7597b382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07, skipping insertion in model container [2024-10-24 14:56:07,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:07,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 14:56:07,622 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[33021,33034] [2024-10-24 14:56:07,726 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[44124,44137] [2024-10-24 14:56:07,727 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[44245,44258] [2024-10-24 14:56:07,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:56:07,746 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 14:56:07,798 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[33021,33034] [2024-10-24 14:56:07,861 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[44124,44137] [2024-10-24 14:56:07,862 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-1.i[44245,44258] [2024-10-24 14:56:07,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 14:56:07,902 INFO L204 MainTranslator]: Completed translation [2024-10-24 14:56:07,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07 WrapperNode [2024-10-24 14:56:07,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 14:56:07,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 14:56:07,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 14:56:07,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 14:56:07,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:07,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:08,006 INFO L138 Inliner]: procedures = 176, calls = 269, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1423 [2024-10-24 14:56:08,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 14:56:08,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 14:56:08,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 14:56:08,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 14:56:08,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:08,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:08,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:08,103 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 34, 217]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-24 14:56:08,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:08,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:08,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:08,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:08,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:08,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:08,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 14:56:08,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 14:56:08,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 14:56:08,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 14:56:08,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (1/1) ... [2024-10-24 14:56:08,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 14:56:08,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:56:08,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 14:56:08,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 14:56:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 14:56:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 14:56:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 14:56:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 14:56:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 14:56:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 14:56:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 14:56:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 14:56:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 14:56:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 14:56:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 14:56:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 14:56:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 14:56:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 14:56:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 14:56:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 14:56:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 14:56:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 14:56:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 14:56:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 14:56:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 14:56:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 14:56:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 14:56:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 14:56:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 14:56:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 14:56:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 14:56:08,616 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 14:56:08,619 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 14:56:10,113 INFO L? ?]: Removed 309 outVars from TransFormulas that were not future-live. [2024-10-24 14:56:10,114 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 14:56:10,165 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 14:56:10,165 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-24 14:56:10,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:56:10 BoogieIcfgContainer [2024-10-24 14:56:10,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 14:56:10,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 14:56:10,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 14:56:10,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 14:56:10,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:56:07" (1/3) ... [2024-10-24 14:56:10,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79936dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:56:10, skipping insertion in model container [2024-10-24 14:56:10,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:56:07" (2/3) ... [2024-10-24 14:56:10,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79936dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:56:10, skipping insertion in model container [2024-10-24 14:56:10,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:56:10" (3/3) ... [2024-10-24 14:56:10,178 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test7-1.i [2024-10-24 14:56:10,195 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 14:56:10,195 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 14:56:10,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 14:56:10,281 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;@18aae9e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 14:56:10,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 14:56:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 391 states, 384 states have (on average 1.6328125) internal successors, (627), 386 states have internal predecessors, (627), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:56:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 14:56:10,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:10,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:56:10,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:10,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1356440670, now seen corresponding path program 1 times [2024-10-24 14:56:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51840644] [2024-10-24 14:56:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:10,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:56:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:56:10,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:56:10,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51840644] [2024-10-24 14:56:10,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51840644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:56:10,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:56:10,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 14:56:10,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115085117] [2024-10-24 14:56:10,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:56:10,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 14:56:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:56:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 14:56:10,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 14:56:10,548 INFO L87 Difference]: Start difference. First operand has 391 states, 384 states have (on average 1.6328125) internal successors, (627), 386 states have internal predecessors, (627), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:56:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:56:10,633 INFO L93 Difference]: Finished difference Result 781 states and 1265 transitions. [2024-10-24 14:56:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 14:56:10,637 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 14:56:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:56:10,653 INFO L225 Difference]: With dead ends: 781 [2024-10-24 14:56:10,654 INFO L226 Difference]: Without dead ends: 389 [2024-10-24 14:56:10,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 14:56:10,666 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 14:56:10,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 14:56:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-24 14:56:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-10-24 14:56:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 383 states have (on average 1.4516971279373367) internal successors, (556), 384 states have internal predecessors, (556), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:56:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 562 transitions. [2024-10-24 14:56:10,745 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 562 transitions. Word has length 7 [2024-10-24 14:56:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:56:10,745 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 562 transitions. [2024-10-24 14:56:10,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:56:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 562 transitions. [2024-10-24 14:56:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 14:56:10,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:10,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:56:10,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 14:56:10,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:10,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1301144548, now seen corresponding path program 1 times [2024-10-24 14:56:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:10,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109420832] [2024-10-24 14:56:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:56:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:56:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:56:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109420832] [2024-10-24 14:56:10,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109420832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:56:10,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:56:10,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 14:56:10,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502594413] [2024-10-24 14:56:10,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:56:10,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:56:10,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:56:10,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:56:10,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:56:10,967 INFO L87 Difference]: Start difference. First operand 389 states and 562 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:56:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:56:11,159 INFO L93 Difference]: Finished difference Result 963 states and 1394 transitions. [2024-10-24 14:56:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 14:56:11,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 14:56:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:56:11,166 INFO L225 Difference]: With dead ends: 963 [2024-10-24 14:56:11,167 INFO L226 Difference]: Without dead ends: 773 [2024-10-24 14:56:11,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:56:11,172 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 548 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:56:11,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1705 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:56:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-24 14:56:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 391. [2024-10-24 14:56:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 385 states have (on average 1.4493506493506494) internal successors, (558), 386 states have internal predecessors, (558), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:56:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 564 transitions. [2024-10-24 14:56:11,209 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 564 transitions. Word has length 9 [2024-10-24 14:56:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:56:11,210 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 564 transitions. [2024-10-24 14:56:11,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:56:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 564 transitions. [2024-10-24 14:56:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 14:56:11,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:11,217 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] [2024-10-24 14:56:11,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 14:56:11,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:11,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1454214717, now seen corresponding path program 1 times [2024-10-24 14:56:11,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:11,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434872617] [2024-10-24 14:56:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:56:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:56:11,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:56:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434872617] [2024-10-24 14:56:11,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434872617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:56:11,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:56:11,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 14:56:11,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576815251] [2024-10-24 14:56:11,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:56:11,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 14:56:11,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:56:11,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 14:56:11,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 14:56:11,669 INFO L87 Difference]: Start difference. First operand 391 states and 564 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:56:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:56:11,763 INFO L93 Difference]: Finished difference Result 782 states and 1128 transitions. [2024-10-24 14:56:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 14:56:11,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-24 14:56:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:56:11,765 INFO L225 Difference]: With dead ends: 782 [2024-10-24 14:56:11,765 INFO L226 Difference]: Without dead ends: 394 [2024-10-24 14:56:11,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:56:11,767 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 105 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:56:11,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1505 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:56:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-24 14:56:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2024-10-24 14:56:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 385 states have (on average 1.431168831168831) internal successors, (551), 386 states have internal predecessors, (551), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:56:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 557 transitions. [2024-10-24 14:56:11,788 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 557 transitions. Word has length 85 [2024-10-24 14:56:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:56:11,790 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 557 transitions. [2024-10-24 14:56:11,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:56:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 557 transitions. [2024-10-24 14:56:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 14:56:11,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:11,793 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] [2024-10-24 14:56:11,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 14:56:11,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:11,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1209933513, now seen corresponding path program 1 times [2024-10-24 14:56:11,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:11,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390207317] [2024-10-24 14:56:11,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:11,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:56:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 14:56:12,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:56:12,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390207317] [2024-10-24 14:56:12,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390207317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:56:12,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:56:12,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 14:56:12,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576273318] [2024-10-24 14:56:12,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:56:12,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 14:56:12,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:56:12,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 14:56:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 14:56:12,046 INFO L87 Difference]: Start difference. First operand 391 states and 557 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:56:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:56:12,157 INFO L93 Difference]: Finished difference Result 1072 states and 1542 transitions. [2024-10-24 14:56:12,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 14:56:12,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-24 14:56:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:56:12,163 INFO L225 Difference]: With dead ends: 1072 [2024-10-24 14:56:12,163 INFO L226 Difference]: Without dead ends: 684 [2024-10-24 14:56:12,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 14:56:12,167 INFO L432 NwaCegarLoop]: 739 mSDtfsCounter, 371 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 14:56:12,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1269 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 14:56:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-10-24 14:56:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 680. [2024-10-24 14:56:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 674 states have (on average 1.4495548961424332) internal successors, (977), 675 states have internal predecessors, (977), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:56:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 983 transitions. [2024-10-24 14:56:12,189 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 983 transitions. Word has length 85 [2024-10-24 14:56:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:56:12,191 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 983 transitions. [2024-10-24 14:56:12,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 14:56:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 983 transitions. [2024-10-24 14:56:12,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 14:56:12,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:12,197 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 14:56:12,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 14:56:12,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:12,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1474708445, now seen corresponding path program 1 times [2024-10-24 14:56:12,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:12,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227063702] [2024-10-24 14:56:12,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:12,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:56:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:56:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:56:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 14:56:12,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:56:12,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227063702] [2024-10-24 14:56:12,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227063702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:56:12,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:56:12,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 14:56:12,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163733468] [2024-10-24 14:56:12,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:56:12,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 14:56:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:56:12,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 14:56:12,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:56:12,646 INFO L87 Difference]: Start difference. First operand 680 states and 983 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:56:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:56:12,988 INFO L93 Difference]: Finished difference Result 964 states and 1389 transitions. [2024-10-24 14:56:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 14:56:12,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2024-10-24 14:56:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:56:12,997 INFO L225 Difference]: With dead ends: 964 [2024-10-24 14:56:12,997 INFO L226 Difference]: Without dead ends: 960 [2024-10-24 14:56:12,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-24 14:56:13,000 INFO L432 NwaCegarLoop]: 576 mSDtfsCounter, 536 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:56:13,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 2168 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 14:56:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-24 14:56:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 682. [2024-10-24 14:56:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 676 states have (on average 1.448224852071006) internal successors, (979), 677 states have internal predecessors, (979), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:56:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 985 transitions. [2024-10-24 14:56:13,025 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 985 transitions. Word has length 98 [2024-10-24 14:56:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:56:13,027 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 985 transitions. [2024-10-24 14:56:13,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:56:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 985 transitions. [2024-10-24 14:56:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-24 14:56:13,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:13,062 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 14:56:13,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 14:56:13,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:13,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash 415984286, now seen corresponding path program 1 times [2024-10-24 14:56:13,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:13,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739570722] [2024-10-24 14:56:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:56:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:56:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:13,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:56:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 14:56:13,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:56:13,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739570722] [2024-10-24 14:56:13,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739570722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:56:13,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:56:13,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 14:56:13,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755991588] [2024-10-24 14:56:13,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:56:13,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 14:56:13,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:56:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 14:56:13,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 14:56:13,374 INFO L87 Difference]: Start difference. First operand 682 states and 985 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:56:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:56:13,664 INFO L93 Difference]: Finished difference Result 949 states and 1370 transitions. [2024-10-24 14:56:13,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:56:13,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-24 14:56:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:56:13,668 INFO L225 Difference]: With dead ends: 949 [2024-10-24 14:56:13,669 INFO L226 Difference]: Without dead ends: 600 [2024-10-24 14:56:13,669 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-10-24 14:56:13,670 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 32 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 14:56:13,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1711 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 14:56:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-24 14:56:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2024-10-24 14:56:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 592 states have (on average 1.3935810810810811) internal successors, (825), 593 states have internal predecessors, (825), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:56:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 831 transitions. [2024-10-24 14:56:13,703 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 831 transitions. Word has length 152 [2024-10-24 14:56:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:56:13,704 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 831 transitions. [2024-10-24 14:56:13,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:56:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 831 transitions. [2024-10-24 14:56:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-24 14:56:13,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:13,707 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 14:56:13,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 14:56:13,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:13,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash -755529838, now seen corresponding path program 1 times [2024-10-24 14:56:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:13,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603879057] [2024-10-24 14:56:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:56:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:14,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:56:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:56:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:56:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:56:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603879057] [2024-10-24 14:56:14,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603879057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:56:14,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 14:56:14,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 14:56:14,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672190383] [2024-10-24 14:56:14,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:56:14,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 14:56:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:56:14,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 14:56:14,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 14:56:14,088 INFO L87 Difference]: Start difference. First operand 598 states and 831 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:56:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:56:14,575 INFO L93 Difference]: Finished difference Result 1413 states and 1944 transitions. [2024-10-24 14:56:14,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 14:56:14,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-24 14:56:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:56:14,580 INFO L225 Difference]: With dead ends: 1413 [2024-10-24 14:56:14,580 INFO L226 Difference]: Without dead ends: 947 [2024-10-24 14:56:14,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 14:56:14,582 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 1265 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:56:14,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 2367 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:56:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-10-24 14:56:14,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 737. [2024-10-24 14:56:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 731 states have (on average 1.387140902872777) internal successors, (1014), 732 states have internal predecessors, (1014), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 14:56:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1020 transitions. [2024-10-24 14:56:14,604 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1020 transitions. Word has length 152 [2024-10-24 14:56:14,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:56:14,604 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1020 transitions. [2024-10-24 14:56:14,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:56:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1020 transitions. [2024-10-24 14:56:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 14:56:14,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:14,606 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 14:56:14,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 14:56:14,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:14,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1424447802, now seen corresponding path program 1 times [2024-10-24 14:56:14,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:14,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905819366] [2024-10-24 14:56:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:14,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:56:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:15,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:56:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:15,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:56:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:56:15,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:56:15,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905819366] [2024-10-24 14:56:15,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905819366] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:56:15,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083849764] [2024-10-24 14:56:15,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:15,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:56:15,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:56:15,485 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-10-24 14:56:15,486 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-10-24 14:56:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:15,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 14:56:15,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:56:15,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 14:56:16,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-24 14:56:16,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-24 14:56:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:56:16,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 14:56:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:56:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083849764] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 14:56:16,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 14:56:16,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-24 14:56:16,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165626934] [2024-10-24 14:56:16,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 14:56:16,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 14:56:16,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:56:16,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 14:56:16,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-24 14:56:16,438 INFO L87 Difference]: Start difference. First operand 737 states and 1020 transitions. Second operand has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 14:56:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:56:17,033 INFO L93 Difference]: Finished difference Result 3140 states and 4313 transitions. [2024-10-24 14:56:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 14:56:17,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 162 [2024-10-24 14:56:17,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:56:17,045 INFO L225 Difference]: With dead ends: 3140 [2024-10-24 14:56:17,045 INFO L226 Difference]: Without dead ends: 2733 [2024-10-24 14:56:17,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-24 14:56:17,048 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 2402 mSDsluCounter, 3664 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 14:56:17,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 4162 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 14:56:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2024-10-24 14:56:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 1167. [2024-10-24 14:56:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1157 states have (on average 1.3915298184961107) internal successors, (1610), 1158 states have internal predecessors, (1610), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 14:56:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1622 transitions. [2024-10-24 14:56:17,103 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1622 transitions. Word has length 162 [2024-10-24 14:56:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:56:17,104 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1622 transitions. [2024-10-24 14:56:17,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 14:56:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1622 transitions. [2024-10-24 14:56:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-24 14:56:17,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:17,110 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, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:56:17,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 14:56:17,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:56:17,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:17,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:17,312 INFO L85 PathProgramCache]: Analyzing trace with hash -897644595, now seen corresponding path program 1 times [2024-10-24 14:56:17,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:17,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489306825] [2024-10-24 14:56:17,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:17,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:56:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:56:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:56:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:21,446 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:56:21,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:56:21,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489306825] [2024-10-24 14:56:21,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489306825] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:56:21,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344850209] [2024-10-24 14:56:21,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:21,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:56:21,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:56:21,449 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-10-24 14:56:21,450 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-10-24 14:56:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:22,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 14:56:22,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:56:22,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 14:56:22,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-24 14:56:22,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:22,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:22,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:22,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-24 14:56:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:56:22,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 14:56:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:56:23,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344850209] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 14:56:23,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 14:56:23,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2024-10-24 14:56:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413977931] [2024-10-24 14:56:23,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 14:56:23,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 14:56:23,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:56:23,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 14:56:23,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2024-10-24 14:56:23,337 INFO L87 Difference]: Start difference. First operand 1167 states and 1622 transitions. Second operand has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 14:56:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:56:24,477 INFO L93 Difference]: Finished difference Result 6680 states and 9188 transitions. [2024-10-24 14:56:24,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 14:56:24,478 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 390 [2024-10-24 14:56:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:56:24,506 INFO L225 Difference]: With dead ends: 6680 [2024-10-24 14:56:24,507 INFO L226 Difference]: Without dead ends: 6273 [2024-10-24 14:56:24,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 774 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2024-10-24 14:56:24,516 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 9563 mSDsluCounter, 7239 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9583 SdHoareTripleChecker+Valid, 7737 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:56:24,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9583 Valid, 7737 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 14:56:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2024-10-24 14:56:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 2283. [2024-10-24 14:56:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2267 states have (on average 1.4009704455227172) internal successors, (3176), 2268 states have internal predecessors, (3176), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 14:56:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 3200 transitions. [2024-10-24 14:56:24,641 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 3200 transitions. Word has length 390 [2024-10-24 14:56:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:56:24,642 INFO L471 AbstractCegarLoop]: Abstraction has 2283 states and 3200 transitions. [2024-10-24 14:56:24,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 14:56:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3200 transitions. [2024-10-24 14:56:24,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-24 14:56:24,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:24,662 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, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 14:56:24,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 14:56:24,862 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,SelfDestructingSolverStorable8 [2024-10-24 14:56:24,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:24,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash -654644389, now seen corresponding path program 2 times [2024-10-24 14:56:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:24,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491587921] [2024-10-24 14:56:24,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:24,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:56:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:38,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:56:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:38,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:56:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:56:38,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:56:38,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491587921] [2024-10-24 14:56:38,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491587921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:56:38,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085312400] [2024-10-24 14:56:38,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 14:56:38,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:56:38,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:56:38,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:56:38,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 14:56:38,981 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 14:56:38,981 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 14:56:38,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 14:56:39,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:56:39,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 14:56:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3425 trivial. 0 not checked. [2024-10-24 14:56:39,767 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 14:56:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085312400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 14:56:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 14:56:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [26] total 33 [2024-10-24 14:56:39,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779197732] [2024-10-24 14:56:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 14:56:39,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 14:56:39,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:56:39,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 14:56:39,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 14:56:39,771 INFO L87 Difference]: Start difference. First operand 2283 states and 3200 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:56:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:56:40,880 INFO L93 Difference]: Finished difference Result 2867 states and 3983 transitions. [2024-10-24 14:56:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 14:56:40,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 846 [2024-10-24 14:56:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:56:40,892 INFO L225 Difference]: With dead ends: 2867 [2024-10-24 14:56:40,893 INFO L226 Difference]: Without dead ends: 2463 [2024-10-24 14:56:40,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 847 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 14:56:40,896 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 468 mSDsluCounter, 3433 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 14:56:40,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 3945 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 14:56:40,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2024-10-24 14:56:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2318. [2024-10-24 14:56:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2302 states have (on average 1.396611642050391) internal successors, (3215), 2303 states have internal predecessors, (3215), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 14:56:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3239 transitions. [2024-10-24 14:56:40,971 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3239 transitions. Word has length 846 [2024-10-24 14:56:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:56:40,973 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 3239 transitions. [2024-10-24 14:56:40,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 14:56:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3239 transitions. [2024-10-24 14:56:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2024-10-24 14:56:40,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:40,997 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, 9, 9, 9, 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] [2024-10-24 14:56:41,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 14:56:41,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:56:41,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:41,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:41,198 INFO L85 PathProgramCache]: Analyzing trace with hash 73801654, now seen corresponding path program 1 times [2024-10-24 14:56:41,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:41,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775988024] [2024-10-24 14:56:41,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:41,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:56:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 14:56:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:52,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 14:56:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:56:52,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 14:56:52,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775988024] [2024-10-24 14:56:52,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775988024] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 14:56:52,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829354341] [2024-10-24 14:56:52,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:52,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:56:52,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 14:56:52,576 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 14:56:52,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 14:56:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 14:56:53,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 4159 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-24 14:56:53,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 14:56:53,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 14:56:54,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-24 14:56:54,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:54,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:54,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:54,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:54,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:54,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:54,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:54,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:54,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 14:56:54,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-24 14:56:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:56:54,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 14:56:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 14:56:56,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829354341] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 14:56:56,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 14:56:56,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 39 [2024-10-24 14:56:56,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835740864] [2024-10-24 14:56:56,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 14:56:56,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-24 14:56:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 14:56:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-24 14:56:56,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=910, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 14:56:56,122 INFO L87 Difference]: Start difference. First operand 2318 states and 3239 transitions. Second operand has 39 states, 39 states have (on average 43.87179487179487) internal successors, (1711), 38 states have internal predecessors, (1711), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 14:56:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 14:56:58,793 INFO L93 Difference]: Finished difference Result 13795 states and 18976 transitions. [2024-10-24 14:56:58,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-24 14:56:58,794 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 43.87179487179487) internal successors, (1711), 38 states have internal predecessors, (1711), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 847 [2024-10-24 14:56:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 14:56:58,856 INFO L225 Difference]: With dead ends: 13795 [2024-10-24 14:56:58,856 INFO L226 Difference]: Without dead ends: 13353 [2024-10-24 14:56:58,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1738 GetRequests, 1685 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=877, Invalid=1775, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 14:56:58,866 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 15634 mSDsluCounter, 12440 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15678 SdHoareTripleChecker+Valid, 12938 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 14:56:58,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15678 Valid, 12938 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 14:56:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13353 states. [2024-10-24 14:56:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13353 to 4550. [2024-10-24 14:56:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4550 states, 4522 states have (on average 1.4035824856258292) internal successors, (6347), 4523 states have internal predecessors, (6347), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 14:56:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 6395 transitions. [2024-10-24 14:56:59,103 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 6395 transitions. Word has length 847 [2024-10-24 14:56:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 14:56:59,105 INFO L471 AbstractCegarLoop]: Abstraction has 4550 states and 6395 transitions. [2024-10-24 14:56:59,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 43.87179487179487) internal successors, (1711), 38 states have internal predecessors, (1711), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 14:56:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 6395 transitions. [2024-10-24 14:56:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1760 [2024-10-24 14:56:59,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 14:56:59,131 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2024-10-24 14:56:59,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 14:56:59,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 14:56:59,336 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 14:56:59,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 14:56:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1418037734, now seen corresponding path program 2 times [2024-10-24 14:56:59,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 14:56:59,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298875549] [2024-10-24 14:56:59,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 14:56:59,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 14:57:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat