./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5997605399232d6623d2d70739affa04a63a65f78c1dd829a070c5dea4fb22a3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:26:20,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:26:20,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:26:20,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:26:20,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:26:20,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:26:20,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:26:20,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:26:20,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:26:20,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:26:20,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:26:20,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:26:20,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:26:20,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:26:20,241 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:26:20,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:26:20,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:26:20,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:26:20,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:26:20,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:26:20,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:26:20,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:26:20,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:26:20,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:26:20,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:26:20,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:26:20,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:26:20,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:26:20,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:26:20,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:26:20,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:26:20,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:26:20,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:26:20,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:26:20,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:26:20,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:26:20,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:26:20,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:26:20,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:26:20,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:26:20,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:26:20,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:26:20,251 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-clean/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-clean/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 -> 5997605399232d6623d2d70739affa04a63a65f78c1dd829a070c5dea4fb22a3 [2024-10-11 13:26:20,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:26:20,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:26:20,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:26:20,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:26:20,493 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:26:20,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i [2024-10-11 13:26:21,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:26:21,985 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:26:21,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i [2024-10-11 13:26:21,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8db6b197e/02fbc3cb0be04c6984c6cb9e174fbcec/FLAG4c9b23412 [2024-10-11 13:26:22,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8db6b197e/02fbc3cb0be04c6984c6cb9e174fbcec [2024-10-11 13:26:22,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:26:22,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:26:22,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:26:22,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:26:22,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:26:22,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47faf35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22, skipping insertion in model container [2024-10-11 13:26:22,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:26:22,216 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i[917,930] [2024-10-11 13:26:22,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:26:22,302 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:26:22,322 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i[917,930] [2024-10-11 13:26:22,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:26:22,384 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:26:22,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22 WrapperNode [2024-10-11 13:26:22,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:26:22,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:26:22,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:26:22,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:26:22,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,453 INFO L138 Inliner]: procedures = 26, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2024-10-11 13:26:22,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:26:22,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:26:22,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:26:22,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:26:22,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,527 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 14, 23, 8, 24, 53]. 43 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 3, 1, 2, 4]. The 15 writes are split as follows [0, 2, 5, 2, 2, 4]. [2024-10-11 13:26:22,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:26:22,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:26:22,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:26:22,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:26:22,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (1/1) ... [2024-10-11 13:26:22,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:26:22,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:26:22,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:26:22,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:26:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:26:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:26:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:26:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:26:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:26:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:26:22,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:26:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:26:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:26:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:26:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:26:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:26:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:26:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:26:22,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:26:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:26:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:26:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:26:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:26:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:26:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:26:22,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:26:22,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:26:22,877 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:26:22,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:26:23,259 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-11 13:26:23,259 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:26:23,301 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:26:23,301 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:26:23,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:26:23 BoogieIcfgContainer [2024-10-11 13:26:23,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:26:23,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:26:23,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:26:23,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:26:23,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:26:22" (1/3) ... [2024-10-11 13:26:23,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142be2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:26:23, skipping insertion in model container [2024-10-11 13:26:23,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:22" (2/3) ... [2024-10-11 13:26:23,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142be2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:26:23, skipping insertion in model container [2024-10-11 13:26:23,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:26:23" (3/3) ... [2024-10-11 13:26:23,308 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-32.i [2024-10-11 13:26:23,320 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:26:23,320 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:26:23,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:26:23,378 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;@33a99b98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:26:23,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:26:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:26:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:26:23,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:23,396 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:23,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:23,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1301880535, now seen corresponding path program 1 times [2024-10-11 13:26:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704841604] [2024-10-11 13:26:23,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:26:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:26:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:26:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:26:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:26:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:26:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:26:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:26:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:26:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:26:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:26:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:26:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:26:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:26:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:26:23,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:23,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704841604] [2024-10-11 13:26:23,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704841604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:23,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:23,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:26:23,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829252311] [2024-10-11 13:26:23,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:23,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:26:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:23,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:26:23,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:26:23,727 INFO L87 Difference]: Start difference. First operand has 92 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:26:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:23,762 INFO L93 Difference]: Finished difference Result 181 states and 288 transitions. [2024-10-11 13:26:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:26:23,766 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-10-11 13:26:23,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:23,771 INFO L225 Difference]: With dead ends: 181 [2024-10-11 13:26:23,771 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 13:26:23,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:26:23,777 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:23,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:26:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 13:26:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 13:26:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:26:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-11 13:26:23,817 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 124 [2024-10-11 13:26:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:23,817 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-11 13:26:23,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:26:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-11 13:26:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:26:23,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:23,824 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:23,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:26:23,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:23,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1738315597, now seen corresponding path program 1 times [2024-10-11 13:26:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:23,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587091400] [2024-10-11 13:26:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:23,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:26:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:26:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:26:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:26:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:26:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:26:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:26:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:26:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:26:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:26:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:26:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:26:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:26:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:26:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:26:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587091400] [2024-10-11 13:26:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587091400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:24,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:24,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:26:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489897940] [2024-10-11 13:26:24,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:24,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:26:24,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:24,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:26:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:26:24,331 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:26:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:24,473 INFO L93 Difference]: Finished difference Result 306 states and 432 transitions. [2024-10-11 13:26:24,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:26:24,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-10-11 13:26:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:24,476 INFO L225 Difference]: With dead ends: 306 [2024-10-11 13:26:24,476 INFO L226 Difference]: Without dead ends: 217 [2024-10-11 13:26:24,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:26:24,478 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 206 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:24,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 350 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:26:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-11 13:26:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 185. [2024-10-11 13:26:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.3013698630136987) internal successors, (190), 146 states have internal predecessors, (190), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:26:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 262 transitions. [2024-10-11 13:26:24,508 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 262 transitions. Word has length 124 [2024-10-11 13:26:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:24,509 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 262 transitions. [2024-10-11 13:26:24,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:26:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 262 transitions. [2024-10-11 13:26:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:26:24,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:24,511 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:24,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:26:24,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:24,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1084937767, now seen corresponding path program 1 times [2024-10-11 13:26:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:24,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508899187] [2024-10-11 13:26:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:26:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:26:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:26:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:26:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:26:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:26:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:26:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:26:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:26:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:26:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:26:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:26:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:26:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:26:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:26:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508899187] [2024-10-11 13:26:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508899187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:25,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:25,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:26:25,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759137744] [2024-10-11 13:26:25,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:25,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:26:25,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:25,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:26:25,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:26:25,748 INFO L87 Difference]: Start difference. First operand 185 states and 262 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:26:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:26,314 INFO L93 Difference]: Finished difference Result 525 states and 744 transitions. [2024-10-11 13:26:26,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:26:26,314 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 132 [2024-10-11 13:26:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:26,316 INFO L225 Difference]: With dead ends: 525 [2024-10-11 13:26:26,316 INFO L226 Difference]: Without dead ends: 341 [2024-10-11 13:26:26,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:26:26,321 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 226 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:26,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 643 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:26:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-11 13:26:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 337. [2024-10-11 13:26:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 272 states have (on average 1.3125) internal successors, (357), 274 states have internal predecessors, (357), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:26:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 477 transitions. [2024-10-11 13:26:26,353 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 477 transitions. Word has length 132 [2024-10-11 13:26:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:26,354 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 477 transitions. [2024-10-11 13:26:26,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:26:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 477 transitions. [2024-10-11 13:26:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:26:26,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:26,356 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:26,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:26:26,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:26,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:26,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1886227570, now seen corresponding path program 1 times [2024-10-11 13:26:26,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:26,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547834119] [2024-10-11 13:26:26,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:26,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:26:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:26:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:26:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:26:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:26:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:26:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:26:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:26:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:26:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:26:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:26:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:26:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:26:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:26:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:26:28,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:28,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547834119] [2024-10-11 13:26:28,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547834119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:28,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:28,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 13:26:28,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603097947] [2024-10-11 13:26:28,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:28,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 13:26:28,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:28,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 13:26:28,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:26:28,438 INFO L87 Difference]: Start difference. First operand 337 states and 477 transitions. Second operand has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 13:26:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:30,959 INFO L93 Difference]: Finished difference Result 833 states and 1167 transitions. [2024-10-11 13:26:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:26:30,960 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 134 [2024-10-11 13:26:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:30,966 INFO L225 Difference]: With dead ends: 833 [2024-10-11 13:26:30,966 INFO L226 Difference]: Without dead ends: 497 [2024-10-11 13:26:30,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-10-11 13:26:30,969 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 721 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:30,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1041 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 13:26:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-11 13:26:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 344. [2024-10-11 13:26:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 279 states have (on average 1.3082437275985663) internal successors, (365), 281 states have internal predecessors, (365), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:26:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 485 transitions. [2024-10-11 13:26:31,016 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 485 transitions. Word has length 134 [2024-10-11 13:26:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:31,017 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 485 transitions. [2024-10-11 13:26:31,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 13:26:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 485 transitions. [2024-10-11 13:26:31,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:26:31,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:31,020 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:31,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:26:31,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:31,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1742443630, now seen corresponding path program 1 times [2024-10-11 13:26:31,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:31,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711344638] [2024-10-11 13:26:31,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:31,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:26:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:26:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:26:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:26:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:26:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:26:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:26:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:26:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:26:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:26:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:26:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:26:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:26:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:26:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:26:31,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:31,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711344638] [2024-10-11 13:26:31,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711344638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:31,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:31,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:26:31,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967284871] [2024-10-11 13:26:31,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:31,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:26:31,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:31,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:26:31,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:26:31,155 INFO L87 Difference]: Start difference. First operand 344 states and 485 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:26:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:31,205 INFO L93 Difference]: Finished difference Result 699 states and 985 transitions. [2024-10-11 13:26:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:26:31,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-10-11 13:26:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:31,211 INFO L225 Difference]: With dead ends: 699 [2024-10-11 13:26:31,213 INFO L226 Difference]: Without dead ends: 356 [2024-10-11 13:26:31,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:26:31,214 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:31,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:26:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-11 13:26:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-10-11 13:26:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 291 states have (on average 1.29553264604811) internal successors, (377), 293 states have internal predecessors, (377), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:26:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2024-10-11 13:26:31,249 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 134 [2024-10-11 13:26:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:31,249 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2024-10-11 13:26:31,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 13:26:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2024-10-11 13:26:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:26:31,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:31,251 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:31,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:26:31,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:31,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1644467598, now seen corresponding path program 1 times [2024-10-11 13:26:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:31,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521087061] [2024-10-11 13:26:31,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:26:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:26:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:26:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:26:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:26:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:26:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:26:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:26:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:26:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:26:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:26:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:26:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:26:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:26:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:26:32,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:32,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521087061] [2024-10-11 13:26:32,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521087061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:32,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:32,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 13:26:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786437384] [2024-10-11 13:26:32,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:32,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:26:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:32,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:26:32,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:26:32,573 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 13:26:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:34,215 INFO L93 Difference]: Finished difference Result 812 states and 1123 transitions. [2024-10-11 13:26:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:26:34,216 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 134 [2024-10-11 13:26:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:34,218 INFO L225 Difference]: With dead ends: 812 [2024-10-11 13:26:34,218 INFO L226 Difference]: Without dead ends: 457 [2024-10-11 13:26:34,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2024-10-11 13:26:34,222 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 448 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:34,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1224 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:26:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-11 13:26:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 305. [2024-10-11 13:26:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 252 states have (on average 1.2976190476190477) internal successors, (327), 253 states have internal predecessors, (327), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:26:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 423 transitions. [2024-10-11 13:26:34,251 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 423 transitions. Word has length 134 [2024-10-11 13:26:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:34,252 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 423 transitions. [2024-10-11 13:26:34,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 13:26:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 423 transitions. [2024-10-11 13:26:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:26:34,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:34,253 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:34,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:26:34,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:34,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:34,254 INFO L85 PathProgramCache]: Analyzing trace with hash 274472630, now seen corresponding path program 1 times [2024-10-11 13:26:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:34,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937276073] [2024-10-11 13:26:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:26:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:26:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:26:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:26:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:26:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:26:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:26:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:26:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:26:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:26:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:26:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:26:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:26:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:26:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:26:36,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:36,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937276073] [2024-10-11 13:26:36,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937276073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:36,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:36,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-11 13:26:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074697042] [2024-10-11 13:26:36,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:36,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 13:26:36,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:36,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 13:26:36,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:26:36,296 INFO L87 Difference]: Start difference. First operand 305 states and 423 transitions. Second operand has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 13:26:44,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:26:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:45,965 INFO L93 Difference]: Finished difference Result 671 states and 922 transitions. [2024-10-11 13:26:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 13:26:45,966 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 135 [2024-10-11 13:26:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:45,968 INFO L225 Difference]: With dead ends: 671 [2024-10-11 13:26:45,968 INFO L226 Difference]: Without dead ends: 503 [2024-10-11 13:26:45,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 13:26:45,969 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 600 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 156 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:45,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1619 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1829 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2024-10-11 13:26:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-10-11 13:26:46,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 371. [2024-10-11 13:26:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 306 states have internal predecessors, (390), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 13:26:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 510 transitions. [2024-10-11 13:26:46,013 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 510 transitions. Word has length 135 [2024-10-11 13:26:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:46,013 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 510 transitions. [2024-10-11 13:26:46,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 13:26:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 510 transitions. [2024-10-11 13:26:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:26:46,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:46,014 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:46,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:26:46,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:46,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:46,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1985130588, now seen corresponding path program 1 times [2024-10-11 13:26:46,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:46,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779859278] [2024-10-11 13:26:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:26:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:26:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:26:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:26:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:26:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:26:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:26:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:26:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:26:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:26:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:26:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:26:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:26:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:26:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:26:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779859278] [2024-10-11 13:26:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779859278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 13:26:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273411255] [2024-10-11 13:26:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:51,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 13:26:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:51,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 13:26:51,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=228, Unknown=1, NotChecked=0, Total=272 [2024-10-11 13:26:51,717 INFO L87 Difference]: Start difference. First operand 371 states and 510 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 13:26:54,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:26:55,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:05,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:09,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:20,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:22,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:24,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:26,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:30,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:43,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:47,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:57,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []