./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.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 7435769e205a5a22a211f82999711a463f5dd426d6bac372f4ec13ff649b3c52 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:35:26,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:35:26,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:35:26,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:35:26,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:35:26,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:35:26,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:35:26,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:35:26,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:35:26,146 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:35:26,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:35:26,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:35:26,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:35:26,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:35:26,150 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:35:26,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:35:26,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:35:26,151 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:35:26,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:35:26,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:35:26,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:35:26,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:35:26,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:35:26,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:35:26,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:35:26,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:35:26,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:35:26,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:35:26,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:35:26,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:35:26,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:35:26,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:35:26,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:35:26,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:35:26,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:35:26,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:35:26,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:35:26,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:35:26,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:35:26,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:35:26,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:35:26,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:35:26,162 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 -> 7435769e205a5a22a211f82999711a463f5dd426d6bac372f4ec13ff649b3c52 [2024-11-09 01:35:26,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:35:26,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:35:26,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:35:26,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:35:26,449 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:35:26,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i [2024-11-09 01:35:27,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:35:28,201 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:35:28,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i [2024-11-09 01:35:28,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7517c952a/d2b59438d53d4394b90691e418b6e18e/FLAGaba75882c [2024-11-09 01:35:28,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7517c952a/d2b59438d53d4394b90691e418b6e18e [2024-11-09 01:35:28,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:35:28,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:35:28,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:35:28,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:35:28,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:35:28,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62eeb9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28, skipping insertion in model container [2024-11-09 01:35:28,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:35:28,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i[916,929] [2024-11-09 01:35:28,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:35:28,547 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:35:28,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i[916,929] [2024-11-09 01:35:28,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:35:28,657 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:35:28,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28 WrapperNode [2024-11-09 01:35:28,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:35:28,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:35:28,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:35:28,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:35:28,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,742 INFO L138 Inliner]: procedures = 29, calls = 233, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 772 [2024-11-09 01:35:28,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:35:28,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:35:28,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:35:28,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:35:28,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,798 INFO L175 MemorySlicer]: Split 199 memory accesses to 7 slices as follows [2, 6, 98, 36, 11, 23, 23]. 49 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 1, 8, 3, 1, 3, 1]. The 19 writes are split as follows [0, 1, 9, 4, 1, 3, 1]. [2024-11-09 01:35:28,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:35:28,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:35:28,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:35:28,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:35:28,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (1/1) ... [2024-11-09 01:35:28,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:35:28,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:28,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:35:28,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:35:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:35:28,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:35:28,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:35:28,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:35:28,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:35:28,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:35:28,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:35:28,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:35:28,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:35:28,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:35:28,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:35:28,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:35:28,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:35:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:35:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:35:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:35:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:35:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:35:28,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:35:28,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:35:28,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:35:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:35:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:35:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:35:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:35:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:35:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:35:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:35:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:35:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:35:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:35:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:35:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:35:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:35:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:35:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:35:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:35:28,963 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:35:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:35:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:35:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:35:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:35:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:35:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:35:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:35:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:35:28,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:35:29,139 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:35:29,141 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:35:29,869 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2024-11-09 01:35:29,870 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:35:29,889 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:35:29,891 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:35:29,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:29 BoogieIcfgContainer [2024-11-09 01:35:29,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:35:29,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:35:29,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:35:29,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:35:29,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:35:28" (1/3) ... [2024-11-09 01:35:29,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220a58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:35:29, skipping insertion in model container [2024-11-09 01:35:29,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:28" (2/3) ... [2024-11-09 01:35:29,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220a58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:35:29, skipping insertion in model container [2024-11-09 01:35:29,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:29" (3/3) ... [2024-11-09 01:35:29,900 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-80.i [2024-11-09 01:35:29,917 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:35:29,918 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:35:29,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:35:29,991 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;@63c13388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:35:29,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:35:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 134 states have (on average 1.455223880597015) internal successors, (195), 135 states have internal predecessors, (195), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:35:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:35:30,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:30,015 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:30,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:30,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1933176881, now seen corresponding path program 1 times [2024-11-09 01:35:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232593827] [2024-11-09 01:35:30,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:35:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:35:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:35:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:35:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:35:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:35:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:35:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:35:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:35:30,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:30,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232593827] [2024-11-09 01:35:30,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232593827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:30,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:30,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:35:30,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350023742] [2024-11-09 01:35:30,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:30,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:35:30,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:30,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:35:30,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:35:30,568 INFO L87 Difference]: Start difference. First operand has 154 states, 134 states have (on average 1.455223880597015) internal successors, (195), 135 states have internal predecessors, (195), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:35:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:30,609 INFO L93 Difference]: Finished difference Result 301 states and 469 transitions. [2024-11-09 01:35:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:35:30,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2024-11-09 01:35:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:30,618 INFO L225 Difference]: With dead ends: 301 [2024-11-09 01:35:30,618 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 01:35:30,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:35:30,626 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:30,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 01:35:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-09 01:35:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 131 states have internal predecessors, (188), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:35:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2024-11-09 01:35:30,695 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 222 transitions. Word has length 153 [2024-11-09 01:35:30,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:30,696 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 222 transitions. [2024-11-09 01:35:30,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:35:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 222 transitions. [2024-11-09 01:35:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:35:30,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:30,701 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:30,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:35:30,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:30,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash -503270471, now seen corresponding path program 1 times [2024-11-09 01:35:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:30,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984670080] [2024-11-09 01:35:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:35:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:35:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:35:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:35:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:35:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:35:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:35:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:35:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:35:31,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:31,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984670080] [2024-11-09 01:35:31,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984670080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:31,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:31,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471793764] [2024-11-09 01:35:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:31,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:31,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:31,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:31,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:31,126 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:35:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:31,185 INFO L93 Difference]: Finished difference Result 299 states and 444 transitions. [2024-11-09 01:35:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:31,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2024-11-09 01:35:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:31,191 INFO L225 Difference]: With dead ends: 299 [2024-11-09 01:35:31,191 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 01:35:31,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:31,194 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:31,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 01:35:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-09 01:35:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 1.4285714285714286) internal successors, (190), 133 states have internal predecessors, (190), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:35:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2024-11-09 01:35:31,215 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 153 [2024-11-09 01:35:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:31,219 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2024-11-09 01:35:31,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 01:35:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2024-11-09 01:35:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 01:35:31,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:31,222 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:31,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:35:31,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:31,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -921159173, now seen corresponding path program 1 times [2024-11-09 01:35:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:31,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338987459] [2024-11-09 01:35:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:31,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:35:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:35:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:35:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:35:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:35:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:35:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:35:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:35:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:35:31,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:31,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338987459] [2024-11-09 01:35:31,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338987459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:31,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:31,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127944528] [2024-11-09 01:35:31,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:31,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:31,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:31,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:31,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:31,637 INFO L87 Difference]: Start difference. First operand 152 states and 224 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:35:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:31,665 INFO L93 Difference]: Finished difference Result 303 states and 448 transitions. [2024-11-09 01:35:31,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:31,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 153 [2024-11-09 01:35:31,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:31,667 INFO L225 Difference]: With dead ends: 303 [2024-11-09 01:35:31,667 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 01:35:31,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:31,669 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:31,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 01:35:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-09 01:35:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 135 states have internal predecessors, (192), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:35:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 226 transitions. [2024-11-09 01:35:31,681 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 226 transitions. Word has length 153 [2024-11-09 01:35:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:31,681 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 226 transitions. [2024-11-09 01:35:31,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:35:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 226 transitions. [2024-11-09 01:35:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:35:31,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:31,685 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:31,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:35:31,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:31,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:31,689 INFO L85 PathProgramCache]: Analyzing trace with hash -277707594, now seen corresponding path program 1 times [2024-11-09 01:35:31,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:31,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016150333] [2024-11-09 01:35:31,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:31,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:35:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:35:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:35:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:35:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:35:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:35:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:35:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:35:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:35:31,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:31,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016150333] [2024-11-09 01:35:31,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016150333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:31,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:31,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:31,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776713772] [2024-11-09 01:35:31,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:31,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:31,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:31,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:31,916 INFO L87 Difference]: Start difference. First operand 154 states and 226 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:35:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:31,950 INFO L93 Difference]: Finished difference Result 308 states and 453 transitions. [2024-11-09 01:35:31,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:31,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-09 01:35:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:31,955 INFO L225 Difference]: With dead ends: 308 [2024-11-09 01:35:31,955 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 01:35:31,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:31,957 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 1 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:31,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 646 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 01:35:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2024-11-09 01:35:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 137 states have (on average 1.416058394160584) internal successors, (194), 137 states have internal predecessors, (194), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:35:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 228 transitions. [2024-11-09 01:35:31,972 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 228 transitions. Word has length 155 [2024-11-09 01:35:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:31,973 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 228 transitions. [2024-11-09 01:35:31,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:35:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 228 transitions. [2024-11-09 01:35:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:35:31,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:31,979 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:31,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:35:31,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:31,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash 402350776, now seen corresponding path program 1 times [2024-11-09 01:35:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:31,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4247225] [2024-11-09 01:35:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:35:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:35:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:35:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:35:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:35:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:35:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:35:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:35:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:35:32,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4247225] [2024-11-09 01:35:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4247225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334408689] [2024-11-09 01:35:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:32,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:32,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:32,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:32,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:32,197 INFO L87 Difference]: Start difference. First operand 156 states and 228 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:35:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:32,226 INFO L93 Difference]: Finished difference Result 312 states and 457 transitions. [2024-11-09 01:35:32,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:32,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-09 01:35:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:32,230 INFO L225 Difference]: With dead ends: 312 [2024-11-09 01:35:32,231 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 01:35:32,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:32,233 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:32,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 647 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 01:35:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-11-09 01:35:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.410071942446043) internal successors, (196), 139 states have internal predecessors, (196), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:35:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 230 transitions. [2024-11-09 01:35:32,253 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 230 transitions. Word has length 155 [2024-11-09 01:35:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:32,253 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 230 transitions. [2024-11-09 01:35:32,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:35:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 230 transitions. [2024-11-09 01:35:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:35:32,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:32,259 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:32,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:35:32,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:32,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:32,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2117609158, now seen corresponding path program 1 times [2024-11-09 01:35:32,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:32,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295837952] [2024-11-09 01:35:32,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:32,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:35:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:35:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:35:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:35:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:35:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:35:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:35:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:35:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:35:32,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:32,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295837952] [2024-11-09 01:35:32,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295837952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:32,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:32,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:32,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500776254] [2024-11-09 01:35:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:32,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:32,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:32,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:32,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:32,471 INFO L87 Difference]: Start difference. First operand 158 states and 230 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:35:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:32,500 INFO L93 Difference]: Finished difference Result 316 states and 461 transitions. [2024-11-09 01:35:32,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:32,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-09 01:35:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:32,517 INFO L225 Difference]: With dead ends: 316 [2024-11-09 01:35:32,517 INFO L226 Difference]: Without dead ends: 161 [2024-11-09 01:35:32,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:32,519 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 1 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:32,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 649 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-09 01:35:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2024-11-09 01:35:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 141 states have internal predecessors, (198), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:35:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2024-11-09 01:35:32,537 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 155 [2024-11-09 01:35:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:32,538 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2024-11-09 01:35:32,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:35:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2024-11-09 01:35:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:35:32,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:32,540 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:32,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:35:32,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:32,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:32,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2115762116, now seen corresponding path program 1 times [2024-11-09 01:35:32,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:32,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84745054] [2024-11-09 01:35:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:35:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:35:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:35:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:35:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:35:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:35:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:35:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:35:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:35:33,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84745054] [2024-11-09 01:35:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84745054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:33,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:33,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:33,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965250201] [2024-11-09 01:35:33,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:33,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:33,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:33,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:33,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:33,243 INFO L87 Difference]: Start difference. First operand 160 states and 232 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:35:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:33,329 INFO L93 Difference]: Finished difference Result 321 states and 468 transitions. [2024-11-09 01:35:33,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:33,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-09 01:35:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:33,332 INFO L225 Difference]: With dead ends: 321 [2024-11-09 01:35:33,332 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 01:35:33,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:33,333 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 2 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:33,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 839 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 01:35:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2024-11-09 01:35:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 144 states have (on average 1.4027777777777777) internal successors, (202), 144 states have internal predecessors, (202), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:35:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 236 transitions. [2024-11-09 01:35:33,348 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 236 transitions. Word has length 155 [2024-11-09 01:35:33,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:33,349 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 236 transitions. [2024-11-09 01:35:33,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 01:35:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 236 transitions. [2024-11-09 01:35:33,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:35:33,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:33,351 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:33,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:35:33,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:33,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:33,351 INFO L85 PathProgramCache]: Analyzing trace with hash 373766846, now seen corresponding path program 1 times [2024-11-09 01:35:33,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:33,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670347053] [2024-11-09 01:35:33,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:33,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:35:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:35:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:35:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:35:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:35:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:35:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:35:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:35:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:35:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:35:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:35:42,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:42,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670347053] [2024-11-09 01:35:42,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670347053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:42,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:42,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 01:35:42,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077959381] [2024-11-09 01:35:42,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:42,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 01:35:42,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:42,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 01:35:42,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:35:42,443 INFO L87 Difference]: Start difference. First operand 163 states and 236 transitions. Second operand has 17 states, 15 states have (on average 4.866666666666666) internal successors, (73), 17 states have internal predecessors, (73), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-09 01:35:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:48,776 INFO L93 Difference]: Finished difference Result 728 states and 1034 transitions. [2024-11-09 01:35:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 01:35:48,777 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.866666666666666) internal successors, (73), 17 states have internal predecessors, (73), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2024-11-09 01:35:48,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:48,780 INFO L225 Difference]: With dead ends: 728 [2024-11-09 01:35:48,782 INFO L226 Difference]: Without dead ends: 568 [2024-11-09 01:35:48,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 01:35:48,784 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 2862 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2863 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:48,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2863 Valid, 2421 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 01:35:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-09 01:35:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 433. [2024-11-09 01:35:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 383 states have (on average 1.391644908616188) internal successors, (533), 385 states have internal predecessors, (533), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:35:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 613 transitions. [2024-11-09 01:35:48,851 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 613 transitions. Word has length 155 [2024-11-09 01:35:48,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:48,853 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 613 transitions. [2024-11-09 01:35:48,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.866666666666666) internal successors, (73), 17 states have internal predecessors, (73), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-09 01:35:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 613 transitions. [2024-11-09 01:35:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 01:35:48,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:48,855 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:48,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:35:48,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:48,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:48,856 INFO L85 PathProgramCache]: Analyzing trace with hash -647301508, now seen corresponding path program 1 times [2024-11-09 01:35:48,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:48,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922324376] [2024-11-09 01:35:48,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:48,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat