./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:30:14,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:30:14,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:30:14,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:30:14,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:30:14,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:30:14,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:30:14,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:30:14,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:30:14,231 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:30:14,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:30:14,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:30:14,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:30:14,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:30:14,233 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:30:14,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:30:14,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:30:14,234 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:30:14,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:30:14,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:30:14,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:30:14,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:30:14,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:30:14,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:30:14,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:30:14,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:30:14,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:30:14,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:30:14,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:30:14,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:30:14,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:30:14,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:30:14,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:30:14,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:30:14,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:30:14,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:30:14,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:30:14,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:30:14,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:30:14,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:30:14,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:30:14,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:30:14,244 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 [2024-11-09 01:30:14,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:30:14,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:30:14,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:30:14,532 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:30:14,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:30:14,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-09 01:30:15,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:30:16,188 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:30:16,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-09 01:30:16,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dac45fcf/64ccfbcb0c98466ab53a0fcbfea46e91/FLAGc8ce7daa8 [2024-11-09 01:30:16,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dac45fcf/64ccfbcb0c98466ab53a0fcbfea46e91 [2024-11-09 01:30:16,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:30:16,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:30:16,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:30:16,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:30:16,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:30:16,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:30:16" (1/1) ... [2024-11-09 01:30:16,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f148d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:16, skipping insertion in model container [2024-11-09 01:30:16,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:30:16" (1/1) ... [2024-11-09 01:30:16,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:30:16,875 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-09 01:30:16,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:30:16,957 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:30:16,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-09 01:30:17,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:30:17,027 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:30:17,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17 WrapperNode [2024-11-09 01:30:17,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:30:17,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:30:17,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:30:17,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:30:17,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,108 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2024-11-09 01:30:17,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:30:17,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:30:17,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:30:17,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:30:17,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,154 INFO L175 MemorySlicer]: Split 141 memory accesses to 5 slices as follows [2, 22, 35, 9, 73]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 3, 5, 2, 9]. The 21 writes are split as follows [0, 3, 5, 2, 11]. [2024-11-09 01:30:17,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:30:17,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:30:17,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:30:17,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:30:17,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (1/1) ... [2024-11-09 01:30:17,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:30:17,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:30:17,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:30:17,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:30:17,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:30:17,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:30:17,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:30:17,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:30:17,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:30:17,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:30:17,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:30:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:30:17,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:30:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:30:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:30:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:30:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:30:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:30:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:30:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:30:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:30:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:30:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:30:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:30:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:30:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:30:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:30:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:30:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:30:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:30:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:30:17,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:30:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:30:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:30:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:30:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:30:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:30:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:30:17,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:30:17,454 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:30:17,455 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:30:17,960 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-09 01:30:17,960 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:30:17,986 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:30:17,986 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:30:17,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:30:17 BoogieIcfgContainer [2024-11-09 01:30:17,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:30:17,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:30:17,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:30:17,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:30:17,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:30:16" (1/3) ... [2024-11-09 01:30:17,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2155ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:30:17, skipping insertion in model container [2024-11-09 01:30:17,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:30:17" (2/3) ... [2024-11-09 01:30:17,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2155ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:30:17, skipping insertion in model container [2024-11-09 01:30:17,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:30:17" (3/3) ... [2024-11-09 01:30:17,998 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-38.i [2024-11-09 01:30:18,015 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:30:18,015 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:30:18,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:30:18,148 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;@1a24e036, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:30:18,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:30:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:30:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 01:30:18,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:18,171 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:30:18,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:30:18,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:18,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1484720315, now seen corresponding path program 1 times [2024-11-09 01:30:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:30:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658018254] [2024-11-09 01:30:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:30:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:30:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:30:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:30:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:30:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:30:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:30:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:30:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:30:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:30:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:30:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:30:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:30:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:30:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:30:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:30:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:30:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:30:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:30:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:30:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:30:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 01:30:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 01:30:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 01:30:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 01:30:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 01:30:18,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:30:18,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658018254] [2024-11-09 01:30:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658018254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:30:18,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:30:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426247808] [2024-11-09 01:30:18,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:18,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:30:18,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:30:18,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:30:18,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:30:18,798 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 01:30:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:18,830 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-09 01:30:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:30:18,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-09 01:30:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:18,845 INFO L225 Difference]: With dead ends: 237 [2024-11-09 01:30:18,845 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 01:30:18,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:30:18,853 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:18,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:30:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 01:30:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 01:30:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:30:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-09 01:30:18,921 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-09 01:30:18,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:18,922 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-09 01:30:18,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 01:30:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-09 01:30:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 01:30:18,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:18,931 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:30:18,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:30:18,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:30:18,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:18,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1050794083, now seen corresponding path program 1 times [2024-11-09 01:30:18,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:30:18,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094180922] [2024-11-09 01:30:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:18,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:30:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:30:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:30:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:30:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:30:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:30:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:30:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:30:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:30:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:30:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:30:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:30:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:30:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:30:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:30:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:30:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:30:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:30:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:30:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:30:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:30:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 01:30:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 01:30:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 01:30:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 01:30:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 01:30:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:30:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094180922] [2024-11-09 01:30:19,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094180922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:19,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:30:19,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:30:19,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782182472] [2024-11-09 01:30:19,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:19,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:30:19,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:30:19,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:30:19,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:30:19,848 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 01:30:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:20,002 INFO L93 Difference]: Finished difference Result 268 states and 391 transitions. [2024-11-09 01:30:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:30:20,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-09 01:30:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:20,007 INFO L225 Difference]: With dead ends: 268 [2024-11-09 01:30:20,007 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 01:30:20,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:30:20,013 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 48 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:20,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 622 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:30:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 01:30:20,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 121. [2024-11-09 01:30:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:30:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2024-11-09 01:30:20,036 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 184 [2024-11-09 01:30:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:20,042 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2024-11-09 01:30:20,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 01:30:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2024-11-09 01:30:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 01:30:20,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:20,049 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:30:20,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:30:20,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:30:20,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1250137949, now seen corresponding path program 1 times [2024-11-09 01:30:20,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:30:20,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617894363] [2024-11-09 01:30:20,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:30:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:30:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:30:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:30:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:30:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:30:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:30:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:30:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:30:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:30:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:30:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:30:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:30:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:30:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:30:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:30:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:30:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:30:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:30:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:30:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:30:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 01:30:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 01:30:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 01:30:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 01:30:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 01:30:21,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:30:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617894363] [2024-11-09 01:30:21,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617894363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:21,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:30:21,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:30:21,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885913688] [2024-11-09 01:30:21,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:21,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:30:21,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:30:21,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:30:21,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:30:21,997 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 9 states, 7 states have (on average 9.571428571428571) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-09 01:30:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:22,613 INFO L93 Difference]: Finished difference Result 345 states and 501 transitions. [2024-11-09 01:30:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:30:22,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.571428571428571) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-09 01:30:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:22,616 INFO L225 Difference]: With dead ends: 345 [2024-11-09 01:30:22,616 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 01:30:22,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:30:22,618 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 136 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:22,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1495 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:30:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 01:30:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2024-11-09 01:30:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 179 states have (on average 1.3519553072625698) internal successors, (242), 180 states have internal predecessors, (242), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:30:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 326 transitions. [2024-11-09 01:30:22,640 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 326 transitions. Word has length 184 [2024-11-09 01:30:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:22,641 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 326 transitions. [2024-11-09 01:30:22,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.571428571428571) internal successors, (67), 9 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-09 01:30:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 326 transitions. [2024-11-09 01:30:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 01:30:22,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:22,644 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:30:22,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:30:22,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:30:22,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:22,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1836943963, now seen corresponding path program 1 times [2024-11-09 01:30:22,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:30:22,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144581296] [2024-11-09 01:30:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:22,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:30:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:30:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:30:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:30:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:30:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:30:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:30:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:30:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:30:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:30:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:30:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:30:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:30:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:30:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:30:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:30:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:30:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:30:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:30:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:30:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:30:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 01:30:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 01:30:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 01:30:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 01:30:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 01:30:24,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:30:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144581296] [2024-11-09 01:30:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144581296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:24,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:30:24,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:30:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220913204] [2024-11-09 01:30:24,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:24,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:30:24,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:30:24,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:30:24,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:30:24,190 INFO L87 Difference]: Start difference. First operand 224 states and 326 transitions. Second operand has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-09 01:30:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:24,786 INFO L93 Difference]: Finished difference Result 511 states and 744 transitions. [2024-11-09 01:30:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:30:24,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-09 01:30:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:24,794 INFO L225 Difference]: With dead ends: 511 [2024-11-09 01:30:24,794 INFO L226 Difference]: Without dead ends: 290 [2024-11-09 01:30:24,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:30:24,800 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 139 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:24,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 884 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:30:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-09 01:30:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2024-11-09 01:30:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 221 states have (on average 1.330316742081448) internal successors, (294), 223 states have internal predecessors, (294), 62 states have call successors, (62), 3 states have call predecessors, (62), 3 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-09 01:30:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 418 transitions. [2024-11-09 01:30:24,874 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 418 transitions. Word has length 184 [2024-11-09 01:30:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:24,875 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 418 transitions. [2024-11-09 01:30:24,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-09 01:30:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 418 transitions. [2024-11-09 01:30:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 01:30:24,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:24,877 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:30:24,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:30:24,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:30:24,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1031283231, now seen corresponding path program 1 times [2024-11-09 01:30:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:30:24,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238879002] [2024-11-09 01:30:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:24,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:30:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:30:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:30:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:30:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:30:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:30:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:30:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:30:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:30:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:30:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:30:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:30:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:30:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:30:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:30:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:30:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:30:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:30:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:30:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:30:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:30:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 01:30:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 01:30:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 01:30:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 01:30:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 01:30:26,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:30:26,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238879002] [2024-11-09 01:30:26,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238879002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:26,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:30:26,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:30:26,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109501451] [2024-11-09 01:30:26,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:26,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:30:26,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:30:26,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:30:26,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:30:26,074 INFO L87 Difference]: Start difference. First operand 287 states and 418 transitions. Second operand has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-09 01:30:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:26,545 INFO L93 Difference]: Finished difference Result 521 states and 751 transitions. [2024-11-09 01:30:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:30:26,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-09 01:30:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:26,551 INFO L225 Difference]: With dead ends: 521 [2024-11-09 01:30:26,551 INFO L226 Difference]: Without dead ends: 294 [2024-11-09 01:30:26,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:30:26,553 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 138 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:26,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1217 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:30:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-09 01:30:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 226. [2024-11-09 01:30:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 180 states have (on average 1.3333333333333333) internal successors, (240), 181 states have internal predecessors, (240), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:30:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 324 transitions. [2024-11-09 01:30:26,589 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 324 transitions. Word has length 184 [2024-11-09 01:30:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:26,590 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 324 transitions. [2024-11-09 01:30:26,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.4) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-09 01:30:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 324 transitions. [2024-11-09 01:30:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 01:30:26,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:26,592 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:30:26,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:30:26,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:30:26,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:26,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1618089245, now seen corresponding path program 1 times [2024-11-09 01:30:26,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:30:26,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811861010] [2024-11-09 01:30:26,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:26,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:30:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:30:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:30:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:30:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:30:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:30:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:30:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:30:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:30:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:30:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:30:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:30:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:30:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:30:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:30:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:30:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:30:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:30:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:30:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:30:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:30:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 01:30:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 01:30:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 01:30:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 01:30:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 01:30:28,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:30:28,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811861010] [2024-11-09 01:30:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811861010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:28,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:30:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:30:28,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045143661] [2024-11-09 01:30:28,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:28,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:30:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:30:28,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:30:28,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:30:28,227 INFO L87 Difference]: Start difference. First operand 226 states and 324 transitions. Second operand has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-09 01:30:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:29,053 INFO L93 Difference]: Finished difference Result 513 states and 737 transitions. [2024-11-09 01:30:29,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:30:29,055 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-09 01:30:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:29,057 INFO L225 Difference]: With dead ends: 513 [2024-11-09 01:30:29,058 INFO L226 Difference]: Without dead ends: 290 [2024-11-09 01:30:29,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:30:29,060 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 132 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:29,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2182 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:30:29,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-09 01:30:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 201. [2024-11-09 01:30:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 155 states have (on average 1.3096774193548386) internal successors, (203), 156 states have internal predecessors, (203), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 01:30:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 287 transitions. [2024-11-09 01:30:29,094 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 287 transitions. Word has length 184 [2024-11-09 01:30:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:29,095 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 287 transitions. [2024-11-09 01:30:29,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 8.375) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-09 01:30:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 287 transitions. [2024-11-09 01:30:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 01:30:29,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:29,097 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:30:29,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:30:29,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:30:29,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1729973726, now seen corresponding path program 1 times [2024-11-09 01:30:29,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:30:29,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295571644] [2024-11-09 01:30:29,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:29,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:30:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:30:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:30:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:30:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:30:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:30:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:30:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:30:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:30:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:30:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:30:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:30:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:30:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:30:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:30:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:30:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:30:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:30:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:30:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:30:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:30:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 01:30:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 01:30:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 01:30:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 01:30:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 01:30:35,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:30:35,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295571644] [2024-11-09 01:30:35,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295571644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:30:35,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:30:35,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 01:30:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620163347] [2024-11-09 01:30:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:30:35,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 01:30:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:30:35,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 01:30:35,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:30:35,864 INFO L87 Difference]: Start difference. First operand 201 states and 287 transitions. Second operand has 17 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-09 01:30:44,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:30:50,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:30:54,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:31:00,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:31:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:00,484 INFO L93 Difference]: Finished difference Result 432 states and 611 transitions. [2024-11-09 01:31:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:31:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) Word has length 186 [2024-11-09 01:31:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:00,488 INFO L225 Difference]: With dead ends: 432 [2024-11-09 01:31:00,489 INFO L226 Difference]: Without dead ends: 291 [2024-11-09 01:31:00,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-09 01:31:00,491 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 244 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 31 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:00,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 2103 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1216 Invalid, 4 Unknown, 0 Unchecked, 23.6s Time] [2024-11-09 01:31:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-09 01:31:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2024-11-09 01:31:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 230 states have (on average 1.326086956521739) internal successors, (305), 232 states have internal predecessors, (305), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:31:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 409 transitions. [2024-11-09 01:31:00,535 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 409 transitions. Word has length 186 [2024-11-09 01:31:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:00,535 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 409 transitions. [2024-11-09 01:31:00,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 17 states have internal predecessors, (69), 5 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-09 01:31:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 409 transitions. [2024-11-09 01:31:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 01:31:00,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:00,538 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:31:00,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:31:00,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:00,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1049915356, now seen corresponding path program 1 times [2024-11-09 01:31:00,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:00,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789698201] [2024-11-09 01:31:00,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:00,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:31:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:31:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:31:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:31:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:31:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:31:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:31:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:31:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:31:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:31:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:31:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:31:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:31:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:31:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 01:31:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 01:31:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 01:31:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 01:31:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:31:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 01:31:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 01:31:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 01:31:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 01:31:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 01:31:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-09 01:31:01,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:31:01,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789698201] [2024-11-09 01:31:01,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789698201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:31:01,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536349387] [2024-11-09 01:31:01,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:01,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:01,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:31:01,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:31:01,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:31:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:02,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 01:31:02,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:02,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:02,418 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 7 [2024-11-09 01:31:02,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 01:31:02,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:02,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 29 [2024-11-09 01:31:02,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:02,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 29 [2024-11-09 01:31:02,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:02,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 29 [2024-11-09 01:31:03,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:03,008 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 62 treesize of output 26 [2024-11-09 01:31:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 371 proven. 18 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2024-11-09 01:31:03,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:31:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 114 proven. 21 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-09 01:31:04,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536349387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:31:04,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:31:04,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 31 [2024-11-09 01:31:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547796129] [2024-11-09 01:31:04,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:31:04,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 01:31:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:31:04,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 01:31:04,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-09 01:31:04,130 INFO L87 Difference]: Start difference. First operand 287 states and 409 transitions. Second operand has 31 states, 25 states have (on average 4.88) internal successors, (122), 29 states have internal predecessors, (122), 11 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (33), 7 states have call predecessors, (33), 11 states have call successors, (33) [2024-11-09 01:31:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:06,337 INFO L93 Difference]: Finished difference Result 537 states and 749 transitions. [2024-11-09 01:31:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 01:31:06,337 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 4.88) internal successors, (122), 29 states have internal predecessors, (122), 11 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (33), 7 states have call predecessors, (33), 11 states have call successors, (33) Word has length 186 [2024-11-09 01:31:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:06,341 INFO L225 Difference]: With dead ends: 537 [2024-11-09 01:31:06,342 INFO L226 Difference]: Without dead ends: 310 [2024-11-09 01:31:06,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=577, Invalid=2179, Unknown=0, NotChecked=0, Total=2756 [2024-11-09 01:31:06,344 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1347 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:06,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 1309 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 01:31:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-09 01:31:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 152. [2024-11-09 01:31:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 122 states have internal predecessors, (155), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:31:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 203 transitions. [2024-11-09 01:31:06,370 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 203 transitions. Word has length 186 [2024-11-09 01:31:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:06,371 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 203 transitions. [2024-11-09 01:31:06,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 4.88) internal successors, (122), 29 states have internal predecessors, (122), 11 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (33), 7 states have call predecessors, (33), 11 states have call successors, (33) [2024-11-09 01:31:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 203 transitions. [2024-11-09 01:31:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 01:31:06,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:06,373 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:31:06,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:31:06,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:31:06,574 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:06,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:06,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1526935512, now seen corresponding path program 1 times [2024-11-09 01:31:06,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:31:06,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139247471] [2024-11-09 01:31:06,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:06,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:31:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:31:06,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:31:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:31:06,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:31:06,848 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:31:06,849 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:31:06,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:31:06,854 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:31:06,962 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:31:06,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:31:06 BoogieIcfgContainer [2024-11-09 01:31:06,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:31:06,968 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:31:06,968 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:31:06,968 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:31:06,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:30:17" (3/4) ... [2024-11-09 01:31:06,971 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:31:06,972 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:31:06,973 INFO L158 Benchmark]: Toolchain (without parser) took 50410.05ms. Allocated memory was 140.5MB in the beginning and 564.1MB in the end (delta: 423.6MB). Free memory was 82.7MB in the beginning and 233.5MB in the end (delta: -150.8MB). Peak memory consumption was 272.4MB. Max. memory is 16.1GB. [2024-11-09 01:31:06,973 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:31:06,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.45ms. Allocated memory is still 140.5MB. Free memory was 82.3MB in the beginning and 104.1MB in the end (delta: -21.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 01:31:06,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.61ms. Allocated memory is still 140.5MB. Free memory was 104.1MB in the beginning and 99.7MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:31:06,973 INFO L158 Benchmark]: Boogie Preprocessor took 99.86ms. Allocated memory is still 140.5MB. Free memory was 99.1MB in the beginning and 93.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:31:06,974 INFO L158 Benchmark]: RCFGBuilder took 774.79ms. Allocated memory is still 140.5MB. Free memory was 93.4MB in the beginning and 56.5MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 01:31:06,974 INFO L158 Benchmark]: TraceAbstraction took 48978.57ms. Allocated memory was 140.5MB in the beginning and 564.1MB in the end (delta: 423.6MB). Free memory was 55.6MB in the beginning and 233.5MB in the end (delta: -177.9MB). Peak memory consumption was 247.9MB. Max. memory is 16.1GB. [2024-11-09 01:31:06,975 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 564.1MB. Free memory is still 233.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:31:06,977 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.45ms. Allocated memory is still 140.5MB. Free memory was 82.3MB in the beginning and 104.1MB in the end (delta: -21.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.61ms. Allocated memory is still 140.5MB. Free memory was 104.1MB in the beginning and 99.7MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.86ms. Allocated memory is still 140.5MB. Free memory was 99.1MB in the beginning and 93.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 774.79ms. Allocated memory is still 140.5MB. Free memory was 93.4MB in the beginning and 56.5MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 48978.57ms. Allocated memory was 140.5MB in the beginning and 564.1MB in the end (delta: 423.6MB). Free memory was 55.6MB in the beginning and 233.5MB in the end (delta: -177.9MB). Peak memory consumption was 247.9MB. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 564.1MB. Free memory is still 233.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryArithmeticDOUBLEoperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L25-L27] double double_Array_0[5] = { 32.71, 31.2, 0.4, 7.25, 7.75 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2] = { 1771558822, 16 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[3][3] = { {32, 20114, 52902}, {16773, 32, 56507}, {25, 8, 0} }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L58] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L59] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L59] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L60] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L61] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L62] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L62] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L62] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L64] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] double_Array_0[0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F [L68] EXPR double_Array_0[0] [L68] EXPR double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] EXPR (double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] RET assume_abort_if_not((double_Array_0[0] >= -230584.3009213691390e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] double_Array_0[1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[1] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L70] EXPR double_Array_0[1] [L70] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] double_Array_0[2] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[2] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F [L72] EXPR double_Array_0[2] [L72] EXPR double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[2] >= -115292.1504606845700e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 1152921.504606845700e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] double_Array_0[4] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[4] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F [L74] EXPR double_Array_0[4] [L74] EXPR double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((double_Array_0[4] >= -115292.1504606845700e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 1152921.504606845700e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L76] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1610612735) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1610612735) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L79] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16384) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16384) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L82] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] unsigned_short_int_Array_0[2][1] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[2][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[2][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[2][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[2][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L93] unsigned_short_int_Array_0[1][2] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L108] RET updateVariables() [L109] CALL step() [L37] EXPR unsigned_short_int_Array_0[1][2] [L37] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) [L37] EXPR unsigned_short_int_Array_0[1][2] [L37] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR unsigned_short_int_Array_0[2][1] [L37] unsigned_short_int_Array_0[2][2] = (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]) [L38] EXPR unsigned_short_int_Array_0[1][2] [L38] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[1][2]; [L39] EXPR unsigned_short_int_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] COND FALSE !(unsigned_short_int_Array_0[2][1] > stepLocal_0) [L42] EXPR double_Array_0[1] [L42] EXPR double_Array_0[0] [L42] EXPR double_Array_0[2] [L42] EXPR double_Array_0[4] [L42] double_Array_0[3] = (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))) [L43] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L43] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L44] EXPR unsigned_short_int_Array_0[0][2] [L44] EXPR unsigned_short_int_Array_0[0][1] [L44] EXPR unsigned_short_int_Array_0[1][1] [L44] unsigned_short_int_Array_0[0][0] = (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])) [L52] EXPR BOOL_unsigned_char_Array_0[2] [L52] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[2]; [L53] EXPR BOOL_unsigned_char_Array_0[0] [L53] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, stepLocal_1=256, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L53] EXPR BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L53] COND FALSE !((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && stepLocal_1) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR unsigned_short_int_Array_0[2][2] [L100] EXPR unsigned_short_int_Array_0[1][2] [L100] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) [L100] EXPR unsigned_short_int_Array_0[1][2] [L100] EXPR ((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR unsigned_short_int_Array_0[2][1] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) [L100] EXPR unsigned_short_int_Array_0[2][1] [L100] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1 [L100] EXPR (unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) [L100] EXPR double_Array_0[3] [L100] EXPR double_Array_0[1] [L100] EXPR double_Array_0[0] [L100] EXPR double_Array_0[2] [L100] EXPR double_Array_0[4] [L100] EXPR ((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR (((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] EXPR ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100-L101] return ((((unsigned_short_int_Array_0[2][2] == ((unsigned short int) (((((unsigned_short_int_Array_0[1][2]) > (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))) - unsigned_short_int_Array_0[2][1]))) && ((unsigned_short_int_Array_0[2][1] > unsigned_short_int_Array_0[1][2]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) (((unsigned_long_int_Array_0[0] - unsigned_short_int_Array_0[0][2]) + 2144048120u) - unsigned_short_int_Array_0[1][2]))) : 1)) && (double_Array_0[3] == ((double) (double_Array_0[1] + (double_Array_0[0] + (double_Array_0[2] + double_Array_0[4])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][2] - (unsigned_short_int_Array_0[0][1] - unsigned_short_int_Array_0[1][1])))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((27636 + unsigned_short_int_Array_0[1][0]) - (((((16853 - 10)) > (unsigned_short_int_Array_0[0][1])) ? ((16853 - 10)) : (unsigned_short_int_Array_0[0][1])))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))))) && (((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) && BOOL_unsigned_char_Array_0[2]) ? (unsigned_short_int_Array_0[2][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] + unsigned_short_int_Array_0[0][1]))) : 1) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.8s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 2236 SdHoareTripleChecker+Valid, 27.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2184 mSDsluCounter, 9984 SdHoareTripleChecker+Invalid, 26.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8386 mSDsCounter, 657 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4706 IncrementalHoareTripleChecker+Invalid, 5367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 657 mSolverCounterUnsat, 1598 mSDtfsCounter, 4706 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 918 GetRequests, 806 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=4, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 357 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 1848 NumberOfCodeBlocks, 1848 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1838 ConstructedInterpolants, 0 QuantifiedInterpolants, 7567 SizeOfPredicates, 7 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 10983/11040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:31:07,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:31:09,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:31:09,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:31:09,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:31:09,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:31:09,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:31:09,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:31:09,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:31:09,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:31:09,343 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:31:09,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:31:09,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:31:09,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:31:09,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:31:09,347 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:31:09,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:31:09,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:31:09,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:31:09,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:31:09,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:31:09,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:31:09,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:31:09,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:31:09,353 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:31:09,354 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:31:09,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:31:09,354 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:31:09,354 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:31:09,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:31:09,354 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:31:09,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:31:09,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:31:09,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:31:09,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:31:09,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:31:09,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:31:09,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:31:09,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:31:09,367 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:31:09,367 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:31:09,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:31:09,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:31:09,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:31:09,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:31:09,368 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bafc608ae20cc3b925738467682f7a351eaf74a33c9f01487a05b7ea4884eee3 [2024-11-09 01:31:09,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:31:09,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:31:09,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:31:09,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:31:09,681 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:31:09,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-09 01:31:11,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:31:11,428 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:31:11,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i [2024-11-09 01:31:11,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/027e2a629/d9afdb765d354214af4b79594d787a2f/FLAGe5cc6fe37 [2024-11-09 01:31:11,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/027e2a629/d9afdb765d354214af4b79594d787a2f [2024-11-09 01:31:11,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:31:11,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:31:11,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:31:11,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:31:11,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:31:11,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:31:11" (1/1) ... [2024-11-09 01:31:11,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@feddb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:11, skipping insertion in model container [2024-11-09 01:31:11,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:31:11" (1/1) ... [2024-11-09 01:31:11,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:31:12,021 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-09 01:31:12,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:31:12,145 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:31:12,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-38.i[916,929] [2024-11-09 01:31:12,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:31:12,258 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:31:12,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12 WrapperNode [2024-11-09 01:31:12,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:31:12,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:31:12,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:31:12,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:31:12,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,339 INFO L138 Inliner]: procedures = 36, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2024-11-09 01:31:12,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:31:12,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:31:12,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:31:12,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:31:12,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,403 INFO L175 MemorySlicer]: Split 141 memory accesses to 5 slices as follows [2, 22, 35, 9, 73]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 3, 5, 2, 9]. The 21 writes are split as follows [0, 3, 5, 2, 11]. [2024-11-09 01:31:12,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:31:12,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:31:12,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:31:12,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:31:12,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (1/1) ... [2024-11-09 01:31:12,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:31:12,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:31:12,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:31:12,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:31:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:31:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 01:31:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 01:31:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-09 01:31:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-09 01:31:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-09 01:31:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 01:31:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 01:31:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-09 01:31:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-09 01:31:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-09 01:31:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:31:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:31:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:31:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:31:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:31:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:31:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:31:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:31:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:31:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:31:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:31:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:31:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:31:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:31:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:31:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:31:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:31:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:31:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:31:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:31:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 01:31:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 01:31:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-09 01:31:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-09 01:31:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-09 01:31:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:31:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:31:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:31:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:31:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:31:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:31:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:31:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:31:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:31:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:31:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:31:12,594 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:31:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:31:12,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:31:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:31:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:31:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:31:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:31:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:31:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:31:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:31:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:31:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:31:12,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:31:12,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:31:12,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:31:12,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:31:12,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:31:12,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:31:12,784 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:31:12,787 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:31:16,105 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-09 01:31:16,106 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:31:16,122 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:31:16,123 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:31:16,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:16 BoogieIcfgContainer [2024-11-09 01:31:16,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:31:16,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:31:16,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:31:16,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:31:16,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:31:11" (1/3) ... [2024-11-09 01:31:16,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68704eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:31:16, skipping insertion in model container [2024-11-09 01:31:16,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:31:12" (2/3) ... [2024-11-09 01:31:16,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68704eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:31:16, skipping insertion in model container [2024-11-09 01:31:16,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:31:16" (3/3) ... [2024-11-09 01:31:16,133 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-38.i [2024-11-09 01:31:16,151 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:31:16,151 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:31:16,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:31:16,233 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;@3f881963, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:31:16,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:31:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:31:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 01:31:16,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:16,254 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:31:16,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:16,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1484720315, now seen corresponding path program 1 times [2024-11-09 01:31:16,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:31:16,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804377615] [2024-11-09 01:31:16,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:16,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:31:16,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:31:16,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:31:16,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:31:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:16,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:31:16,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-09 01:31:16,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:31:16,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:31:16,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804377615] [2024-11-09 01:31:16,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804377615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:16,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:16,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:31:16,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586817677] [2024-11-09 01:31:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:16,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:31:16,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:31:16,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:31:16,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:31:16,965 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 01:31:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:17,006 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-09 01:31:17,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:31:17,008 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-09 01:31:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:17,014 INFO L225 Difference]: With dead ends: 237 [2024-11-09 01:31:17,015 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 01:31:17,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:31:17,022 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:17,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:31:17,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 01:31:17,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 01:31:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:31:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-09 01:31:17,067 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-09 01:31:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:17,068 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-09 01:31:17,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 01:31:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-09 01:31:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 01:31:17,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:17,072 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:31:17,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:31:17,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:31:17,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:17,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1050794083, now seen corresponding path program 1 times [2024-11-09 01:31:17,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:31:17,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242700414] [2024-11-09 01:31:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:17,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:31:17,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:31:17,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:31:17,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:31:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:17,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:31:17,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 01:31:17,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:31:17,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:31:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242700414] [2024-11-09 01:31:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242700414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:31:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:31:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:31:17,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219462262] [2024-11-09 01:31:17,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:31:17,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:31:17,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:31:17,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:31:17,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:31:17,989 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 01:31:20,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 01:31:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:31:20,861 INFO L93 Difference]: Finished difference Result 268 states and 391 transitions. [2024-11-09 01:31:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:31:20,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-09 01:31:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:31:20,872 INFO L225 Difference]: With dead ends: 268 [2024-11-09 01:31:20,873 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 01:31:20,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:31:20,882 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 48 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:31:20,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 622 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 01:31:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 01:31:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 121. [2024-11-09 01:31:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:31:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2024-11-09 01:31:20,921 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 184 [2024-11-09 01:31:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:31:20,923 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2024-11-09 01:31:20,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-09 01:31:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2024-11-09 01:31:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 01:31:20,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:31:20,932 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:31:20,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:31:21,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:31:21,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:31:21,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:31:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1250137949, now seen corresponding path program 1 times [2024-11-09 01:31:21,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:31:21,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642103241] [2024-11-09 01:31:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:21,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:31:21,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:31:21,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:31:21,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:31:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:21,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:31:21,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:21,935 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-11-09 01:31:22,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 01:31:22,605 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 42 treesize of output 29 [2024-11-09 01:31:23,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:31:23,506 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 62 treesize of output 26 [2024-11-09 01:31:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 385 proven. 15 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2024-11-09 01:31:23,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:31:24,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:31:24,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642103241] [2024-11-09 01:31:24,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642103241] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:31:24,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [162658390] [2024-11-09 01:31:24,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:31:24,997 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:31:24,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:31:24,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:31:25,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-09 01:31:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:31:26,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 01:31:26,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:31:27,561 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 12 treesize of output 8 [2024-11-09 01:31:28,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-09 01:31:28,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25