./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-a_file-19.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-a_file-19.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 81c7729345d5d6e6cfdedd64c331a4f8f6005773af2c566c0c24cc964b2ec390 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:14:15,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:14:15,335 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:14:15,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:14:15,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:14:15,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:14:15,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:14:15,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:14:15,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:14:15,370 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:14:15,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:14:15,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:14:15,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:14:15,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:14:15,374 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:14:15,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:14:15,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:14:15,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:14:15,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:14:15,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:14:15,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:14:15,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:14:15,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:14:15,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:14:15,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:14:15,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:14:15,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:14:15,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:14:15,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:14:15,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:14:15,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:14:15,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:14:15,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:15,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:14:15,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:14:15,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:14:15,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:14:15,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:14:15,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:14:15,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:14:15,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:14:15,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:14:15,383 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 -> 81c7729345d5d6e6cfdedd64c331a4f8f6005773af2c566c0c24cc964b2ec390 [2024-10-11 13:14:15,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:14:15,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:14:15,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:14:15,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:14:15,620 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:14:15,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i [2024-10-11 13:14:16,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:14:17,005 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:14:17,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i [2024-10-11 13:14:17,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/98e1ff628/510bf78687e14c9c96337709107ae9c4/FLAGd174f1aac [2024-10-11 13:14:17,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/98e1ff628/510bf78687e14c9c96337709107ae9c4 [2024-10-11 13:14:17,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:14:17,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:14:17,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:17,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:14:17,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:14:17,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbb962b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17, skipping insertion in model container [2024-10-11 13:14:17,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:14:17,215 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-a_file-19.i[916,929] [2024-10-11 13:14:17,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:17,275 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:14:17,283 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-a_file-19.i[916,929] [2024-10-11 13:14:17,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:17,337 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:14:17,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17 WrapperNode [2024-10-11 13:14:17,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:17,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:17,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:14:17,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:14:17,347 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:14:17" (1/1) ... [2024-10-11 13:14:17,357 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:14:17" (1/1) ... [2024-10-11 13:14:17,390 INFO L138 Inliner]: procedures = 26, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 468 [2024-10-11 13:14:17,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:17,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:14:17,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:14:17,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:14:17,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,422 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 8, 43, 27, 26, 18]. 35 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 3, 4, 2, 2]. The 15 writes are split as follows [0, 1, 4, 6, 2, 2]. [2024-10-11 13:14:17,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:14:17,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:14:17,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:14:17,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:14:17,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17" (1/1) ... [2024-10-11 13:14:17,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:17,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:14:17,484 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:14:17,487 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:14:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:14:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:14:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:14:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:14:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:14:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:14:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:14:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:14:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:14:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:14:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:14:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:14:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:14:17,527 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:14:17,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:14:17,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:14:17,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:14:17,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:14:17,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:14:17,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:14:17,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:14:17,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:14:17,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:14:17,635 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:14:17,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:14:17,982 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-11 13:14:17,982 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:14:18,012 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:14:18,012 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:14:18,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:18 BoogieIcfgContainer [2024-10-11 13:14:18,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:14:18,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:14:18,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:14:18,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:14:18,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:14:17" (1/3) ... [2024-10-11 13:14:18,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320f5f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:18, skipping insertion in model container [2024-10-11 13:14:18,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:17" (2/3) ... [2024-10-11 13:14:18,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320f5f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:18, skipping insertion in model container [2024-10-11 13:14:18,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:18" (3/3) ... [2024-10-11 13:14:18,019 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-19.i [2024-10-11 13:14:18,036 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:14:18,036 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:14:18,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:14:18,097 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;@44815e30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:14:18,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:14:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:14:18,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 13:14:18,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:18,114 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:18,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:18,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1542024245, now seen corresponding path program 1 times [2024-10-11 13:14:18,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:18,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479867514] [2024-10-11 13:14:18,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:18,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:14:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479867514] [2024-10-11 13:14:18,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479867514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:18,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:18,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:14:18,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929751328] [2024-10-11 13:14:18,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:18,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:14:18,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:14:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:14:18,498 INFO L87 Difference]: Start difference. First operand has 95 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:18,573 INFO L93 Difference]: Finished difference Result 187 states and 297 transitions. [2024-10-11 13:14:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:14:18,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 127 [2024-10-11 13:14:18,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:18,581 INFO L225 Difference]: With dead ends: 187 [2024-10-11 13:14:18,581 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:14:18,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:14:18,586 INFO L432 NwaCegarLoop]: 130 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, 130 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:14:18,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:18,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:14:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:14:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:14:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2024-10-11 13:14:18,628 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 127 [2024-10-11 13:14:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:18,629 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2024-10-11 13:14:18,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2024-10-11 13:14:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 13:14:18,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:18,633 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:18,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:14:18,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:18,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash -177356435, now seen corresponding path program 1 times [2024-10-11 13:14:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:18,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944961928] [2024-10-11 13:14:18,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:14:18,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:18,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944961928] [2024-10-11 13:14:18,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944961928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:18,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:18,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:14:18,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148335567] [2024-10-11 13:14:18,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:18,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:14:18,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:18,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:14:18,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:18,946 INFO L87 Difference]: Start difference. First operand 93 states and 134 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:14:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:18,992 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2024-10-11 13:14:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:14:18,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-11 13:14:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:18,995 INFO L225 Difference]: With dead ends: 188 [2024-10-11 13:14:18,996 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 13:14:18,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:18,998 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:18,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 377 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 13:14:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-11 13:14:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:14:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2024-10-11 13:14:19,016 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 127 [2024-10-11 13:14:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:19,017 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2024-10-11 13:14:19,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:14:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2024-10-11 13:14:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 13:14:19,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:19,019 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:19,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:14:19,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:19,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:19,020 INFO L85 PathProgramCache]: Analyzing trace with hash -177296853, now seen corresponding path program 1 times [2024-10-11 13:14:19,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:19,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852462945] [2024-10-11 13:14:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:19,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:14:20,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:20,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852462945] [2024-10-11 13:14:20,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852462945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:20,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433965235] [2024-10-11 13:14:20,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:20,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:14:20,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:14:20,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:14:20,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:14:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:20,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 13:14:20,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:20,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-11 13:14:20,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-11 13:14:20,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2024-10-11 13:14:20,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 13:14:20,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2024-10-11 13:14:20,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-10-11 13:14:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 13 proven. 250 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-10-11 13:14:20,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:21,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2024-10-11 13:14:21,122 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2024-10-11 13:14:21,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2024-10-11 13:14:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:14:21,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433965235] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:21,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:14:21,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 13] total 19 [2024-10-11 13:14:21,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954197401] [2024-10-11 13:14:21,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:21,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:21,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:21,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:14:21,184 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:14:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:21,424 INFO L93 Difference]: Finished difference Result 262 states and 372 transitions. [2024-10-11 13:14:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:14:21,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-11 13:14:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:21,427 INFO L225 Difference]: With dead ends: 262 [2024-10-11 13:14:21,427 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 13:14:21,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 280 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:14:21,429 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 87 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:21,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 736 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 13:14:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2024-10-11 13:14:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 132 states have (on average 1.3106060606060606) internal successors, (173), 133 states have internal predecessors, (173), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:14:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 233 transitions. [2024-10-11 13:14:21,451 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 233 transitions. Word has length 127 [2024-10-11 13:14:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:21,453 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 233 transitions. [2024-10-11 13:14:21,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:14:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 233 transitions. [2024-10-11 13:14:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 13:14:21,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:21,455 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:21,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:14:21,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:14:21,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:21,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:21,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1198365207, now seen corresponding path program 1 times [2024-10-11 13:14:21,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:21,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46506122] [2024-10-11 13:14:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:14:21,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:21,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46506122] [2024-10-11 13:14:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46506122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:21,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:21,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:21,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891926912] [2024-10-11 13:14:21,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:21,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:21,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:21,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:21,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:21,946 INFO L87 Difference]: Start difference. First operand 165 states and 233 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:22,004 INFO L93 Difference]: Finished difference Result 369 states and 519 transitions. [2024-10-11 13:14:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:14:22,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 127 [2024-10-11 13:14:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:22,007 INFO L225 Difference]: With dead ends: 369 [2024-10-11 13:14:22,007 INFO L226 Difference]: Without dead ends: 205 [2024-10-11 13:14:22,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:22,011 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 90 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:22,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 623 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-11 13:14:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 171. [2024-10-11 13:14:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 138 states have (on average 1.3115942028985508) internal successors, (181), 139 states have internal predecessors, (181), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:14:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2024-10-11 13:14:22,034 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 127 [2024-10-11 13:14:22,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:22,034 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2024-10-11 13:14:22,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2024-10-11 13:14:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 13:14:22,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:22,038 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:22,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:14:22,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:22,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1855639618, now seen corresponding path program 1 times [2024-10-11 13:14:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:22,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122896938] [2024-10-11 13:14:22,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:14:22,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:22,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122896938] [2024-10-11 13:14:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122896938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:22,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:22,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:14:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585750006] [2024-10-11 13:14:22,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:22,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:14:22,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:22,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:14:22,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:14:22,689 INFO L87 Difference]: Start difference. First operand 171 states and 241 transitions. Second operand has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:14:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:23,128 INFO L93 Difference]: Finished difference Result 451 states and 629 transitions. [2024-10-11 13:14:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:14:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 128 [2024-10-11 13:14:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:23,134 INFO L225 Difference]: With dead ends: 451 [2024-10-11 13:14:23,134 INFO L226 Difference]: Without dead ends: 281 [2024-10-11 13:14:23,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:14:23,135 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 72 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:23,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 941 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:14:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-11 13:14:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2024-10-11 13:14:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 224 states have (on average 1.2857142857142858) internal successors, (288), 227 states have internal predecessors, (288), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:14:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 384 transitions. [2024-10-11 13:14:23,159 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 384 transitions. Word has length 128 [2024-10-11 13:14:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:23,159 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 384 transitions. [2024-10-11 13:14:23,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:14:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 384 transitions. [2024-10-11 13:14:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:14:23,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:23,161 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:23,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:14:23,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:23,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash -994811650, now seen corresponding path program 1 times [2024-10-11 13:14:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:23,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729636349] [2024-10-11 13:14:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:14:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729636349] [2024-10-11 13:14:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729636349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:23,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:23,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:14:23,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895758713] [2024-10-11 13:14:23,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:23,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:14:23,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:23,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:14:23,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:14:23,578 INFO L87 Difference]: Start difference. First operand 277 states and 384 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:24,035 INFO L93 Difference]: Finished difference Result 796 states and 1097 transitions. [2024-10-11 13:14:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:14:24,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-11 13:14:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:24,039 INFO L225 Difference]: With dead ends: 796 [2024-10-11 13:14:24,040 INFO L226 Difference]: Without dead ends: 516 [2024-10-11 13:14:24,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:14:24,041 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 95 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:24,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1309 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:14:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-11 13:14:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 316. [2024-10-11 13:14:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 263 states have (on average 1.3079847908745248) internal successors, (344), 266 states have internal predecessors, (344), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:14:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 440 transitions. [2024-10-11 13:14:24,072 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 440 transitions. Word has length 129 [2024-10-11 13:14:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:24,073 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 440 transitions. [2024-10-11 13:14:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 440 transitions. [2024-10-11 13:14:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:14:24,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:24,074 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:24,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:14:24,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:24,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash 790498779, now seen corresponding path program 1 times [2024-10-11 13:14:24,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:24,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22498331] [2024-10-11 13:14:24,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:14:24,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:24,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22498331] [2024-10-11 13:14:24,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22498331] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:24,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907534910] [2024-10-11 13:14:24,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:24,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:14:24,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:14:24,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:14:24,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:14:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:24,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:14:24,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:24,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 13:14:24,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2024-10-11 13:14:24,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2024-10-11 13:14:24,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2024-10-11 13:14:24,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 28 [2024-10-11 13:14:24,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:24,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 29 [2024-10-11 13:14:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 132 proven. 42 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-11 13:14:24,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:24,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2024-10-11 13:14:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:14:25,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907534910] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:14:25,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:14:25,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2024-10-11 13:14:25,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773583354] [2024-10-11 13:14:25,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:14:25,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:14:25,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:25,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:14:25,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:14:25,015 INFO L87 Difference]: Start difference. First operand 316 states and 440 transitions. Second operand has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 2 states have call predecessors, (33), 5 states have call successors, (33) [2024-10-11 13:14:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:25,403 INFO L93 Difference]: Finished difference Result 711 states and 965 transitions. [2024-10-11 13:14:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:14:25,403 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 2 states have call predecessors, (33), 5 states have call successors, (33) Word has length 129 [2024-10-11 13:14:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:25,405 INFO L225 Difference]: With dead ends: 711 [2024-10-11 13:14:25,405 INFO L226 Difference]: Without dead ends: 396 [2024-10-11 13:14:25,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:14:25,406 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 188 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:25,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 451 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:14:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-11 13:14:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 381. [2024-10-11 13:14:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 319 states have (on average 1.2758620689655173) internal successors, (407), 323 states have internal predecessors, (407), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:14:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 507 transitions. [2024-10-11 13:14:25,437 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 507 transitions. Word has length 129 [2024-10-11 13:14:25,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:25,438 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 507 transitions. [2024-10-11 13:14:25,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (33), 2 states have call predecessors, (33), 5 states have call successors, (33) [2024-10-11 13:14:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 507 transitions. [2024-10-11 13:14:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:14:25,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:25,439 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:25,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 13:14:25,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:14:25,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:25,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:25,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1048664217, now seen corresponding path program 1 times [2024-10-11 13:14:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:25,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375895650] [2024-10-11 13:14:25,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:25,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:14:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:26,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375895650] [2024-10-11 13:14:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375895650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:26,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:14:26,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202220569] [2024-10-11 13:14:26,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:26,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:14:26,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:26,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:14:26,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:26,147 INFO L87 Difference]: Start difference. First operand 381 states and 507 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:26,468 INFO L93 Difference]: Finished difference Result 926 states and 1223 transitions. [2024-10-11 13:14:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:26,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-11 13:14:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:26,471 INFO L225 Difference]: With dead ends: 926 [2024-10-11 13:14:26,472 INFO L226 Difference]: Without dead ends: 546 [2024-10-11 13:14:26,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:14:26,473 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 87 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:26,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 742 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-10-11 13:14:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 259. [2024-10-11 13:14:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 1.275229357798165) internal successors, (278), 220 states have internal predecessors, (278), 32 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:14:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 342 transitions. [2024-10-11 13:14:26,514 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 342 transitions. Word has length 129 [2024-10-11 13:14:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:26,515 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 342 transitions. [2024-10-11 13:14:26,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 342 transitions. [2024-10-11 13:14:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:14:26,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:26,516 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:26,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:14:26,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:26,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1170629111, now seen corresponding path program 1 times [2024-10-11 13:14:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:26,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236036865] [2024-10-11 13:14:26,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:14:27,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:27,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236036865] [2024-10-11 13:14:27,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236036865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:27,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:27,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:14:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990470731] [2024-10-11 13:14:27,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:27,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:14:27,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:27,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:14:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:14:27,096 INFO L87 Difference]: Start difference. First operand 259 states and 342 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:27,841 INFO L93 Difference]: Finished difference Result 633 states and 823 transitions. [2024-10-11 13:14:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 13:14:27,841 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-11 13:14:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:27,844 INFO L225 Difference]: With dead ends: 633 [2024-10-11 13:14:27,844 INFO L226 Difference]: Without dead ends: 375 [2024-10-11 13:14:27,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:14:27,845 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 213 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:27,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1025 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:14:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-11 13:14:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 338. [2024-10-11 13:14:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 284 states have (on average 1.2605633802816902) internal successors, (358), 287 states have internal predecessors, (358), 41 states have call successors, (41), 12 states have call predecessors, (41), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 13:14:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 440 transitions. [2024-10-11 13:14:27,897 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 440 transitions. Word has length 130 [2024-10-11 13:14:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:27,898 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 440 transitions. [2024-10-11 13:14:27,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 440 transitions. [2024-10-11 13:14:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:14:27,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:27,899 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:27,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:14:27,899 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:27,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1180167488, now seen corresponding path program 1 times [2024-10-11 13:14:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:27,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625557813] [2024-10-11 13:14:27,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:27,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:14:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:14:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:14:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:14:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:14:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:14:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:14:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:14:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:14:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:14:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:14:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:14:28,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:28,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625557813] [2024-10-11 13:14:28,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625557813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:28,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:28,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:28,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228634999] [2024-10-11 13:14:28,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:28,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:28,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:28,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:28,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:28,367 INFO L87 Difference]: Start difference. First operand 338 states and 440 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:28,642 INFO L93 Difference]: Finished difference Result 880 states and 1142 transitions. [2024-10-11 13:14:28,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:14:28,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-11 13:14:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:28,646 INFO L225 Difference]: With dead ends: 880 [2024-10-11 13:14:28,646 INFO L226 Difference]: Without dead ends: 538 [2024-10-11 13:14:28,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:28,647 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 84 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:28,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 668 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-11 13:14:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 331. [2024-10-11 13:14:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 277 states have (on average 1.2454873646209386) internal successors, (345), 280 states have internal predecessors, (345), 41 states have call successors, (41), 12 states have call predecessors, (41), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 13:14:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 427 transitions. [2024-10-11 13:14:28,699 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 427 transitions. Word has length 130 [2024-10-11 13:14:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:28,701 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 427 transitions. [2024-10-11 13:14:28,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:14:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 427 transitions. [2024-10-11 13:14:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:14:28,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:28,702 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:28,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:14:28,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:28,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:28,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1907831159, now seen corresponding path program 1 times [2024-10-11 13:14:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:28,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712309721] [2024-10-11 13:14:28,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:28,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:14:28,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1018994488] [2024-10-11 13:14:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:28,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:14:28,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:14:28,792 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:14:28,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 13:14:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:29,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-10-11 13:14:29,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:29,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 13:14:29,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:29,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 13:14:29,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:14:29,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 13:14:29,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:14:29,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-10-11 13:14:30,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:14:30,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2024-10-11 13:14:30,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2024-10-11 13:14:30,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:30,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 96 [2024-10-11 13:14:31,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 143 [2024-10-11 13:14:31,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:31,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 161 [2024-10-11 13:14:31,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 72 [2024-10-11 13:14:32,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:32,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 242 [2024-10-11 13:14:42,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:42,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 349 treesize of output 229 [2024-10-11 13:14:45,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:14:45,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 120 [2024-10-11 13:14:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 188 proven. 294 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-11 13:14:46,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:14:50,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:50,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712309721] [2024-10-11 13:14:50,570 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 13:14:50,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018994488] [2024-10-11 13:14:50,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018994488] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:14:50,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:14:50,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2024-10-11 13:14:50,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161059594] [2024-10-11 13:14:50,570 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 13:14:50,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 13:14:50,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:50,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 13:14:50,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2315, Unknown=2, NotChecked=0, Total=2550 [2024-10-11 13:14:50,573 INFO L87 Difference]: Start difference. First operand 331 states and 427 transitions. Second operand has 38 states, 33 states have (on average 2.272727272727273) internal successors, (75), 35 states have internal predecessors, (75), 10 states have call successors, (17), 6 states have call predecessors, (17), 10 states have return successors, (17), 7 states have call predecessors, (17), 10 states have call successors, (17) [2024-10-11 13:14:59,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-11 13:15:04,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-11 13:15:15,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-11 13:15:19,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-11 13:15:35,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]