./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.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 b28c8175bc39dd1c459be6d9349fe3be895f115cd8cddc9719a89a6e0edbf727 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:42:56,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:42:56,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:42:56,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:42:56,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:42:56,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:42:56,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:42:56,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:42:56,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:42:56,901 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:42:56,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:42:56,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:42:56,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:42:56,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:42:56,907 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:42:56,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:42:56,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:42:56,908 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:42:56,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:42:56,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:42:56,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:42:56,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:42:56,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:42:56,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:42:56,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:42:56,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:42:56,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:42:56,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:42:56,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:42:56,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:42:56,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:42:56,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:42:56,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:42:56,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:42:56,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:42:56,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:42:56,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:42:56,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:42:56,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:42:56,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:42:56,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:42:56,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:42:56,918 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 -> b28c8175bc39dd1c459be6d9349fe3be895f115cd8cddc9719a89a6e0edbf727 [2024-10-24 11:42:57,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:42:57,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:42:57,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:42:57,198 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:42:57,199 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:42:57,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i [2024-10-24 11:42:58,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:42:58,904 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:42:58,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i [2024-10-24 11:42:58,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ea4e63e/69b5739ffc51444f91846333dc7e84f4/FLAG84ebe7484 [2024-10-24 11:42:58,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ea4e63e/69b5739ffc51444f91846333dc7e84f4 [2024-10-24 11:42:58,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:42:58,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:42:58,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:42:58,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:42:58,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:42:58,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2ae1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58, skipping insertion in model container [2024-10-24 11:42:58,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:42:59,152 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i[916,929] [2024-10-24 11:42:59,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:42:59,236 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:42:59,248 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-89.i[916,929] [2024-10-24 11:42:59,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:42:59,308 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:42:59,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59 WrapperNode [2024-10-24 11:42:59,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:42:59,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:42:59,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:42:59,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:42:59,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,375 INFO L138 Inliner]: procedures = 26, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2024-10-24 11:42:59,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:42:59,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:42:59,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:42:59,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:42:59,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,434 INFO L175 MemorySlicer]: Split 107 memory accesses to 13 slices as follows [2, 7, 13, 12, 6, 12, 9, 8, 12, 7, 5, 10, 4]. 12 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1]. [2024-10-24 11:42:59,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:42:59,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:42:59,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:42:59,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:42:59,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (1/1) ... [2024-10-24 11:42:59,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:42:59,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:59,519 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 11:42:59,522 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 11:42:59,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:42:59,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:42:59,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:42:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:42:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:42:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:42:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:42:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 11:42:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 11:42:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 11:42:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 11:42:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-24 11:42:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-24 11:42:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-24 11:42:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:42:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:42:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:42:59,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:42:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:42:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:42:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 11:42:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 11:42:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 11:42:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 11:42:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-24 11:42:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-24 11:42:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-24 11:42:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:42:59,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:42:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:42:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:42:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:42:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:42:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:42:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:42:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 11:42:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 11:42:59,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 11:42:59,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 11:42:59,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-24 11:42:59,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-24 11:42:59,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-24 11:42:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:42:59,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:42:59,770 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:42:59,773 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:43:00,253 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-24 11:43:00,253 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:43:00,297 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:43:00,297 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:43:00,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:43:00 BoogieIcfgContainer [2024-10-24 11:43:00,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:43:00,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:43:00,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:43:00,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:43:00,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:42:58" (1/3) ... [2024-10-24 11:43:00,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac7b799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:43:00, skipping insertion in model container [2024-10-24 11:43:00,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:59" (2/3) ... [2024-10-24 11:43:00,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac7b799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:43:00, skipping insertion in model container [2024-10-24 11:43:00,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:43:00" (3/3) ... [2024-10-24 11:43:00,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-89.i [2024-10-24 11:43:00,329 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:43:00,329 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:43:00,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:43:00,404 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;@7e8d2233, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:43:00,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:43:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 11:43:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:43:00,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:00,421 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:00,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:00,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1214591593, now seen corresponding path program 1 times [2024-10-24 11:43:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:00,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671726573] [2024-10-24 11:43:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:00,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 11:43:00,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:00,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671726573] [2024-10-24 11:43:00,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671726573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:00,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:00,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:43:00,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583175373] [2024-10-24 11:43:00,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:00,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:43:00,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:00,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:43:00,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:43:00,957 INFO L87 Difference]: Start difference. First operand has 95 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 11:43:01,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:01,013 INFO L93 Difference]: Finished difference Result 187 states and 297 transitions. [2024-10-24 11:43:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:43:01,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-10-24 11:43:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:01,028 INFO L225 Difference]: With dead ends: 187 [2024-10-24 11:43:01,029 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:43:01,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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 11:43:01,036 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:01,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:43:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:43:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:43:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 11:43:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2024-10-24 11:43:01,092 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 104 [2024-10-24 11:43:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:01,096 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2024-10-24 11:43:01,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 11:43:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2024-10-24 11:43:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:43:01,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:01,103 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:01,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:43:01,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:01,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1616983823, now seen corresponding path program 1 times [2024-10-24 11:43:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986449466] [2024-10-24 11:43:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:01,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 11:43:01,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:01,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986449466] [2024-10-24 11:43:01,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986449466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:01,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:01,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:43:01,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984754515] [2024-10-24 11:43:01,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:01,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:43:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:01,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:43:01,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:43:01,541 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:01,650 INFO L93 Difference]: Finished difference Result 188 states and 275 transitions. [2024-10-24 11:43:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:43:01,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 11:43:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:01,653 INFO L225 Difference]: With dead ends: 188 [2024-10-24 11:43:01,653 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 11:43:01,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:43:01,655 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:01,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 11:43:01,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-24 11:43:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 11:43:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 138 transitions. [2024-10-24 11:43:01,675 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 138 transitions. Word has length 104 [2024-10-24 11:43:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:01,677 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 138 transitions. [2024-10-24 11:43:01,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 138 transitions. [2024-10-24 11:43:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:43:01,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:01,679 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:01,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:43:01,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:01,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:01,681 INFO L85 PathProgramCache]: Analyzing trace with hash 807637197, now seen corresponding path program 1 times [2024-10-24 11:43:01,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:01,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769050305] [2024-10-24 11:43:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:01,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 11:43:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769050305] [2024-10-24 11:43:01,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769050305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:01,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:01,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:43:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699321419] [2024-10-24 11:43:01,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:01,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:43:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:43:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:43:01,966 INFO L87 Difference]: Start difference. First operand 95 states and 138 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:02,025 INFO L93 Difference]: Finished difference Result 192 states and 279 transitions. [2024-10-24 11:43:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:43:02,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 11:43:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:02,031 INFO L225 Difference]: With dead ends: 192 [2024-10-24 11:43:02,032 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 11:43:02,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:43:02,036 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:02,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:43:02,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 11:43:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-24 11:43:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 11:43:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-10-24 11:43:02,054 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 104 [2024-10-24 11:43:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:02,054 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-10-24 11:43:02,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-10-24 11:43:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:43:02,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:02,056 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:02,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:43:02,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:02,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:02,059 INFO L85 PathProgramCache]: Analyzing trace with hash 864895499, now seen corresponding path program 1 times [2024-10-24 11:43:02,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:02,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975546894] [2024-10-24 11:43:02,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:02,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 11:43:02,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975546894] [2024-10-24 11:43:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975546894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:02,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:02,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:43:02,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557039950] [2024-10-24 11:43:02,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:02,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:43:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:02,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:43:02,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:43:02,279 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:02,319 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-10-24 11:43:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:43:02,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 11:43:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:02,321 INFO L225 Difference]: With dead ends: 196 [2024-10-24 11:43:02,321 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:43:02,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:43:02,323 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:02,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:43:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:43:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-24 11:43:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 11:43:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2024-10-24 11:43:02,331 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 104 [2024-10-24 11:43:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:02,331 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2024-10-24 11:43:02,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2024-10-24 11:43:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:43:02,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:02,333 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:02,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:43:02,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:02,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash 864955081, now seen corresponding path program 1 times [2024-10-24 11:43:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:02,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878941979] [2024-10-24 11:43:02,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:02,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 11:43:03,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:03,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878941979] [2024-10-24 11:43:03,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878941979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:03,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:03,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:43:03,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146822672] [2024-10-24 11:43:03,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:03,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:43:03,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:03,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:43:03,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:43:03,691 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:04,070 INFO L93 Difference]: Finished difference Result 274 states and 391 transitions. [2024-10-24 11:43:04,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:43:04,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 11:43:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:04,072 INFO L225 Difference]: With dead ends: 274 [2024-10-24 11:43:04,072 INFO L226 Difference]: Without dead ends: 176 [2024-10-24 11:43:04,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:43:04,074 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 98 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:04,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 924 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:43:04,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-24 11:43:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2024-10-24 11:43:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.388157894736842) internal successors, (211), 153 states have internal predecessors, (211), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:43:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 247 transitions. [2024-10-24 11:43:04,091 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 247 transitions. Word has length 104 [2024-10-24 11:43:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:04,091 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 247 transitions. [2024-10-24 11:43:04,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 247 transitions. [2024-10-24 11:43:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:43:04,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:04,093 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:04,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:43:04,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:04,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash -414908597, now seen corresponding path program 1 times [2024-10-24 11:43:04,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:04,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051126088] [2024-10-24 11:43:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:04,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 11:43:04,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:04,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051126088] [2024-10-24 11:43:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051126088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:04,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:04,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:43:04,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110189496] [2024-10-24 11:43:04,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:04,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:04,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:04,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:04,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:43:04,455 INFO L87 Difference]: Start difference. First operand 173 states and 247 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:04,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:04,554 INFO L93 Difference]: Finished difference Result 350 states and 496 transitions. [2024-10-24 11:43:04,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:04,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 11:43:04,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:04,558 INFO L225 Difference]: With dead ends: 350 [2024-10-24 11:43:04,558 INFO L226 Difference]: Without dead ends: 178 [2024-10-24 11:43:04,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:04,560 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 167 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:04,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 383 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-24 11:43:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2024-10-24 11:43:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 154 states have (on average 1.3766233766233766) internal successors, (212), 155 states have internal predecessors, (212), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:43:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 248 transitions. [2024-10-24 11:43:04,574 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 248 transitions. Word has length 104 [2024-10-24 11:43:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:04,575 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 248 transitions. [2024-10-24 11:43:04,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 248 transitions. [2024-10-24 11:43:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:43:04,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:04,580 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:04,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:43:04,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:04,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash 993118848, now seen corresponding path program 1 times [2024-10-24 11:43:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:04,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10552285] [2024-10-24 11:43:04,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 11:43:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10552285] [2024-10-24 11:43:05,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10552285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:05,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:05,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:43:05,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927673389] [2024-10-24 11:43:05,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:05,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:43:05,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:05,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:43:05,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:43:05,953 INFO L87 Difference]: Start difference. First operand 176 states and 248 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 11:43:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:06,349 INFO L93 Difference]: Finished difference Result 579 states and 818 transitions. [2024-10-24 11:43:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:43:06,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 104 [2024-10-24 11:43:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:06,352 INFO L225 Difference]: With dead ends: 579 [2024-10-24 11:43:06,352 INFO L226 Difference]: Without dead ends: 404 [2024-10-24 11:43:06,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:43:06,356 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 447 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:06,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 619 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:43:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-24 11:43:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 357. [2024-10-24 11:43:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 314 states have (on average 1.3821656050955413) internal successors, (434), 316 states have internal predecessors, (434), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:43:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 506 transitions. [2024-10-24 11:43:06,400 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 506 transitions. Word has length 104 [2024-10-24 11:43:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:06,402 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 506 transitions. [2024-10-24 11:43:06,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 11:43:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 506 transitions. [2024-10-24 11:43:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:43:06,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:06,405 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:06,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:43:06,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:06,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1287656907, now seen corresponding path program 1 times [2024-10-24 11:43:06,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:06,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812836431] [2024-10-24 11:43:06,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:06,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 11:43:06,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:06,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812836431] [2024-10-24 11:43:06,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812836431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:06,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:06,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:43:06,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617919817] [2024-10-24 11:43:06,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:06,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:06,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:06,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:06,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:43:06,715 INFO L87 Difference]: Start difference. First operand 357 states and 506 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:06,812 INFO L93 Difference]: Finished difference Result 835 states and 1180 transitions. [2024-10-24 11:43:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:43:06,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 11:43:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:06,815 INFO L225 Difference]: With dead ends: 835 [2024-10-24 11:43:06,816 INFO L226 Difference]: Without dead ends: 479 [2024-10-24 11:43:06,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:06,817 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 87 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:06,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 547 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-24 11:43:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 473. [2024-10-24 11:43:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 422 states have (on average 1.3838862559241707) internal successors, (584), 426 states have internal predecessors, (584), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:43:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 668 transitions. [2024-10-24 11:43:06,853 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 668 transitions. Word has length 104 [2024-10-24 11:43:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:06,853 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 668 transitions. [2024-10-24 11:43:06,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 668 transitions. [2024-10-24 11:43:06,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:43:06,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:06,855 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:06,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:43:06,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:06,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:06,856 INFO L85 PathProgramCache]: Analyzing trace with hash 7793229, now seen corresponding path program 1 times [2024-10-24 11:43:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:06,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816869915] [2024-10-24 11:43:06,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:06,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 11:43:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816869915] [2024-10-24 11:43:07,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816869915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:07,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:07,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:43:07,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808656125] [2024-10-24 11:43:07,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:07,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:43:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:07,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:43:07,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:43:07,450 INFO L87 Difference]: Start difference. First operand 473 states and 668 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:07,647 INFO L93 Difference]: Finished difference Result 1017 states and 1434 transitions. [2024-10-24 11:43:07,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:43:07,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-24 11:43:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:07,653 INFO L225 Difference]: With dead ends: 1017 [2024-10-24 11:43:07,653 INFO L226 Difference]: Without dead ends: 545 [2024-10-24 11:43:07,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:43:07,656 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 131 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:07,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1085 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-24 11:43:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 523. [2024-10-24 11:43:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 450 states have (on average 1.3577777777777778) internal successors, (611), 454 states have internal predecessors, (611), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 11:43:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 735 transitions. [2024-10-24 11:43:07,690 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 735 transitions. Word has length 104 [2024-10-24 11:43:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:07,690 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 735 transitions. [2024-10-24 11:43:07,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 11:43:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 735 transitions. [2024-10-24 11:43:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:43:07,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:07,693 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:43:07,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:43:07,693 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:07,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2074942144, now seen corresponding path program 1 times [2024-10-24 11:43:07,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:07,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258579281] [2024-10-24 11:43:07,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:07,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat