./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:26:16,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:26:17,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:26:17,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:26:17,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:26:17,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:26:17,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:26:17,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:26:17,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:26:17,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:26:17,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:26:17,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:26:17,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:26:17,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:26:17,061 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:26:17,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:26:17,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:26:17,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:26:17,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:26:17,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:26:17,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:26:17,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:26:17,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:26:17,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:26:17,066 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:26:17,066 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:26:17,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:26:17,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:26:17,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:26:17,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:26:17,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:26:17,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:26:17,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:26:17,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:26:17,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:26:17,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:26:17,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:26:17,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:26:17,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:26:17,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:26:17,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:26:17,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:26:17,070 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e [2024-10-11 13:26:17,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:26:17,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:26:17,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:26:17,283 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:26:17,283 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:26:17,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i [2024-10-11 13:26:18,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:26:18,653 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:26:18,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i [2024-10-11 13:26:18,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f607f9e45/5f30896076b045208cccdfc15cad6bc3/FLAGd4c0c3d03 [2024-10-11 13:26:19,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f607f9e45/5f30896076b045208cccdfc15cad6bc3 [2024-10-11 13:26:19,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:26:19,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:26:19,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:26:19,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:26:19,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:26:19,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5979bbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19, skipping insertion in model container [2024-10-11 13:26:19,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:26:19,207 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2024-10-11 13:26:19,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:26:19,266 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:26:19,275 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2024-10-11 13:26:19,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:26:19,314 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:26:19,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19 WrapperNode [2024-10-11 13:26:19,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:26:19,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:26:19,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:26:19,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:26:19,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,372 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 425 [2024-10-11 13:26:19,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:26:19,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:26:19,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:26:19,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:26:19,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,406 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 20, 22, 33, 33]. 30 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 4, 2]. The 16 writes are split as follows [0, 2, 5, 6, 3]. [2024-10-11 13:26:19,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:26:19,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:26:19,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:26:19,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:26:19,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (1/1) ... [2024-10-11 13:26:19,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:26:19,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:26:19,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:26:19,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:26:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:26:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:26:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:26:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:26:19,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:26:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:26:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:26:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:26:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:26:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:26:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:26:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:26:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:26:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:26:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:26:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:26:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:26:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:26:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:26:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:26:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:26:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:26:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:26:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:26:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:26:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:26:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:26:19,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:26:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:26:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:26:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:26:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:26:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:26:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:26:19,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:26:19,631 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:26:19,633 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:26:19,950 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-11 13:26:19,951 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:26:19,973 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:26:19,974 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:26:19,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:26:19 BoogieIcfgContainer [2024-10-11 13:26:19,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:26:19,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:26:19,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:26:19,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:26:19,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:26:19" (1/3) ... [2024-10-11 13:26:19,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38303534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:26:19, skipping insertion in model container [2024-10-11 13:26:19,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:19" (2/3) ... [2024-10-11 13:26:19,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38303534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:26:19, skipping insertion in model container [2024-10-11 13:26:19,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:26:19" (3/3) ... [2024-10-11 13:26:19,981 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-31.i [2024-10-11 13:26:19,993 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:26:19,994 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:26:20,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:26:20,048 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;@a794741, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:26:20,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:26:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:26:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 13:26:20,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:20,058 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:20,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:20,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:20,063 INFO L85 PathProgramCache]: Analyzing trace with hash -781815559, now seen corresponding path program 1 times [2024-10-11 13:26:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419948267] [2024-10-11 13:26:20,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:20,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:20,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:20,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419948267] [2024-10-11 13:26:20,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419948267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:20,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:20,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:26:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51093465] [2024-10-11 13:26:20,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:20,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:26:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:26:20,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:26:20,361 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:26:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:20,399 INFO L93 Difference]: Finished difference Result 157 states and 251 transitions. [2024-10-11 13:26:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:26:20,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-11 13:26:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:20,427 INFO L225 Difference]: With dead ends: 157 [2024-10-11 13:26:20,427 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 13:26:20,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:26:20,439 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:20,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:26:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 13:26:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 13:26:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:26:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-10-11 13:26:20,510 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 89 [2024-10-11 13:26:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:20,510 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-10-11 13:26:20,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:26:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-10-11 13:26:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 13:26:20,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:20,515 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:20,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:26:20,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:20,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:20,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1798356429, now seen corresponding path program 1 times [2024-10-11 13:26:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:20,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182880499] [2024-10-11 13:26:20,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:21,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:21,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182880499] [2024-10-11 13:26:21,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182880499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:21,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:21,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:26:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62488309] [2024-10-11 13:26:21,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:21,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:26:21,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:21,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:26:21,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:26:21,267 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 13:26:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:21,387 INFO L93 Difference]: Finished difference Result 155 states and 231 transitions. [2024-10-11 13:26:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:26:21,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 89 [2024-10-11 13:26:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:21,393 INFO L225 Difference]: With dead ends: 155 [2024-10-11 13:26:21,393 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 13:26:21,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:26:21,394 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 171 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:21,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 266 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:26:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 13:26:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 13:26:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:26:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 115 transitions. [2024-10-11 13:26:21,405 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 115 transitions. Word has length 89 [2024-10-11 13:26:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:21,406 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 115 transitions. [2024-10-11 13:26:21,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 13:26:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2024-10-11 13:26:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 13:26:21,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:21,409 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:21,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:26:21,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:21,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1475542513, now seen corresponding path program 1 times [2024-10-11 13:26:21,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:21,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246980541] [2024-10-11 13:26:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:21,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:22,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246980541] [2024-10-11 13:26:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246980541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:22,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:22,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:26:22,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209261970] [2024-10-11 13:26:22,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:22,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:26:22,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:22,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:26:22,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:26:22,479 INFO L87 Difference]: Start difference. First operand 78 states and 115 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 13:26:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:22,851 INFO L93 Difference]: Finished difference Result 208 states and 304 transitions. [2024-10-11 13:26:22,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:26:22,851 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 89 [2024-10-11 13:26:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:22,854 INFO L225 Difference]: With dead ends: 208 [2024-10-11 13:26:22,854 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 13:26:22,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:26:22,855 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 444 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:22,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 474 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:26:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 13:26:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2024-10-11 13:26:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.4220183486238531) internal successors, (155), 110 states have internal predecessors, (155), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:26:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 187 transitions. [2024-10-11 13:26:22,876 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 187 transitions. Word has length 89 [2024-10-11 13:26:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:22,876 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 187 transitions. [2024-10-11 13:26:22,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 13:26:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 187 transitions. [2024-10-11 13:26:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:26:22,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:22,878 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:22,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:26:22,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:22,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:22,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1165057578, now seen corresponding path program 1 times [2024-10-11 13:26:22,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:22,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046401100] [2024-10-11 13:26:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:23,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:23,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046401100] [2024-10-11 13:26:23,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046401100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:23,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:23,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:26:23,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61960024] [2024-10-11 13:26:23,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:23,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:26:23,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:23,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:26:23,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:26:23,108 INFO L87 Difference]: Start difference. First operand 128 states and 187 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:23,162 INFO L93 Difference]: Finished difference Result 255 states and 373 transitions. [2024-10-11 13:26:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:26:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-11 13:26:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:23,164 INFO L225 Difference]: With dead ends: 255 [2024-10-11 13:26:23,164 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 13:26:23,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:26:23,166 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:23,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:26:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 13:26:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-11 13:26:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 110 states have internal predecessors, (153), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:26:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 185 transitions. [2024-10-11 13:26:23,183 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 185 transitions. Word has length 91 [2024-10-11 13:26:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:23,185 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 185 transitions. [2024-10-11 13:26:23,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:23,185 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 185 transitions. [2024-10-11 13:26:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:26:23,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:23,187 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:23,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:26:23,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:23,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash -484999208, now seen corresponding path program 1 times [2024-10-11 13:26:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:23,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174084901] [2024-10-11 13:26:23,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:23,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:23,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:23,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174084901] [2024-10-11 13:26:23,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174084901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:23,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:23,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:26:23,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126984947] [2024-10-11 13:26:23,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:23,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:26:23,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:23,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:26:23,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:26:23,886 INFO L87 Difference]: Start difference. First operand 128 states and 185 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:24,196 INFO L93 Difference]: Finished difference Result 279 states and 402 transitions. [2024-10-11 13:26:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:26:24,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-11 13:26:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:24,198 INFO L225 Difference]: With dead ends: 279 [2024-10-11 13:26:24,198 INFO L226 Difference]: Without dead ends: 152 [2024-10-11 13:26:24,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:26:24,199 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 229 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:24,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 554 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:26:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-11 13:26:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 103. [2024-10-11 13:26:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.369047619047619) internal successors, (115), 85 states have internal predecessors, (115), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:26:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 147 transitions. [2024-10-11 13:26:24,221 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 147 transitions. Word has length 91 [2024-10-11 13:26:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:24,221 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 147 transitions. [2024-10-11 13:26:24,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 147 transitions. [2024-10-11 13:26:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:26:24,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:24,222 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:24,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:26:24,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:24,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1927507371, now seen corresponding path program 1 times [2024-10-11 13:26:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660276307] [2024-10-11 13:26:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:24,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:24,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660276307] [2024-10-11 13:26:24,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660276307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:24,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:24,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:26:24,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206684582] [2024-10-11 13:26:24,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:24,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:26:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:24,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:26:24,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:26:24,285 INFO L87 Difference]: Start difference. First operand 103 states and 147 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:24,308 INFO L93 Difference]: Finished difference Result 191 states and 272 transitions. [2024-10-11 13:26:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:26:24,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-11 13:26:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:24,310 INFO L225 Difference]: With dead ends: 191 [2024-10-11 13:26:24,310 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 13:26:24,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:26:24,311 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:24,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:26:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 13:26:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 13:26:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 86 states have internal predecessors, (116), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:26:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 148 transitions. [2024-10-11 13:26:24,328 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 148 transitions. Word has length 91 [2024-10-11 13:26:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:24,329 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 148 transitions. [2024-10-11 13:26:24,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 148 transitions. [2024-10-11 13:26:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:26:24,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:24,331 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:24,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:26:24,331 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:24,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:24,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2109294487, now seen corresponding path program 1 times [2024-10-11 13:26:24,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:24,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57421658] [2024-10-11 13:26:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:24,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:24,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:24,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57421658] [2024-10-11 13:26:24,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57421658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:26:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758734524] [2024-10-11 13:26:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:24,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:26:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:26:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:26:24,466 INFO L87 Difference]: Start difference. First operand 104 states and 148 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:24,540 INFO L93 Difference]: Finished difference Result 224 states and 316 transitions. [2024-10-11 13:26:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:26:24,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-11 13:26:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:24,541 INFO L225 Difference]: With dead ends: 224 [2024-10-11 13:26:24,541 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 13:26:24,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-10-11 13:26:24,542 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 45 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:24,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 505 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:26:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 13:26:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2024-10-11 13:26:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 86 states have internal predecessors, (115), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:26:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2024-10-11 13:26:24,554 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 91 [2024-10-11 13:26:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:24,556 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2024-10-11 13:26:24,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2024-10-11 13:26:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 13:26:24,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:24,557 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:24,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:26:24,557 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:24,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:24,557 INFO L85 PathProgramCache]: Analyzing trace with hash 982542333, now seen corresponding path program 1 times [2024-10-11 13:26:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:24,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753826234] [2024-10-11 13:26:24,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:24,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:24,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753826234] [2024-10-11 13:26:24,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753826234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:24,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:24,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:26:24,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280720723] [2024-10-11 13:26:24,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:24,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:26:24,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:24,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:26:24,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:26:24,695 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:24,790 INFO L93 Difference]: Finished difference Result 217 states and 303 transitions. [2024-10-11 13:26:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:26:24,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2024-10-11 13:26:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:24,791 INFO L225 Difference]: With dead ends: 217 [2024-10-11 13:26:24,791 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 13:26:24,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-10-11 13:26:24,792 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 36 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:24,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 389 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:26:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 13:26:24,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 104. [2024-10-11 13:26:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 86 states have internal predecessors, (114), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:26:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-10-11 13:26:24,817 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 92 [2024-10-11 13:26:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:24,818 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-10-11 13:26:24,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-10-11 13:26:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 13:26:24,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:24,818 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:24,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:26:24,819 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:24,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:24,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1495639923, now seen corresponding path program 1 times [2024-10-11 13:26:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:24,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001326886] [2024-10-11 13:26:24,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:24,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:25,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:25,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001326886] [2024-10-11 13:26:25,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001326886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:25,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:25,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:26:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150538997] [2024-10-11 13:26:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:25,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:26:25,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:25,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:26:25,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:26:25,333 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 13:26:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:25,586 INFO L93 Difference]: Finished difference Result 276 states and 382 transitions. [2024-10-11 13:26:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:26:25,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 93 [2024-10-11 13:26:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:25,587 INFO L225 Difference]: With dead ends: 276 [2024-10-11 13:26:25,587 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 13:26:25,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:26:25,588 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 508 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:25,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 664 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:26:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 13:26:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-10-11 13:26:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 155 states have (on average 1.335483870967742) internal successors, (207), 157 states have internal predecessors, (207), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:26:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 257 transitions. [2024-10-11 13:26:25,621 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 257 transitions. Word has length 93 [2024-10-11 13:26:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:25,621 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 257 transitions. [2024-10-11 13:26:25,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 13:26:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 257 transitions. [2024-10-11 13:26:25,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:26:25,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:25,623 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:25,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:26:25,623 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:25,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:25,624 INFO L85 PathProgramCache]: Analyzing trace with hash -534709627, now seen corresponding path program 1 times [2024-10-11 13:26:25,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:25,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747300971] [2024-10-11 13:26:25,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:25,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:25,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747300971] [2024-10-11 13:26:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747300971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:25,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:25,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:26:25,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038570480] [2024-10-11 13:26:25,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:25,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:26:25,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:26:25,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:26:25,775 INFO L87 Difference]: Start difference. First operand 185 states and 257 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:25,858 INFO L93 Difference]: Finished difference Result 425 states and 588 transitions. [2024-10-11 13:26:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:26:25,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-11 13:26:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:25,860 INFO L225 Difference]: With dead ends: 425 [2024-10-11 13:26:25,860 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 13:26:25,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:26:25,861 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 41 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:25,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 439 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:26:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 13:26:25,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 193. [2024-10-11 13:26:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 165 states have internal predecessors, (215), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:26:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 265 transitions. [2024-10-11 13:26:25,885 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 265 transitions. Word has length 94 [2024-10-11 13:26:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:25,885 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 265 transitions. [2024-10-11 13:26:25,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 265 transitions. [2024-10-11 13:26:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:26:25,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:25,887 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:25,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:26:25,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:25,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash 424520389, now seen corresponding path program 1 times [2024-10-11 13:26:25,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:25,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905445140] [2024-10-11 13:26:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:25,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:25,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:25,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905445140] [2024-10-11 13:26:25,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905445140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:25,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:25,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:26:25,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553772252] [2024-10-11 13:26:25,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:25,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:26:25,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:25,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:26:25,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:26:25,999 INFO L87 Difference]: Start difference. First operand 193 states and 265 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:26,064 INFO L93 Difference]: Finished difference Result 376 states and 514 transitions. [2024-10-11 13:26:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:26:26,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-11 13:26:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:26,065 INFO L225 Difference]: With dead ends: 376 [2024-10-11 13:26:26,065 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 13:26:26,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:26:26,066 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:26,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:26:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 13:26:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2024-10-11 13:26:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 165 states have (on average 1.3151515151515152) internal successors, (217), 167 states have internal predecessors, (217), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:26:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 267 transitions. [2024-10-11 13:26:26,089 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 267 transitions. Word has length 94 [2024-10-11 13:26:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:26,090 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 267 transitions. [2024-10-11 13:26:26,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 267 transitions. [2024-10-11 13:26:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:26:26,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:26,091 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:26,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:26:26,092 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:26,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:26,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1766222405, now seen corresponding path program 1 times [2024-10-11 13:26:26,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:26,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719760272] [2024-10-11 13:26:26,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:26,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:26,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719760272] [2024-10-11 13:26:26,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719760272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:26,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:26,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:26:26,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740590259] [2024-10-11 13:26:26,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:26,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:26:26,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:26,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:26:26,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:26:26,298 INFO L87 Difference]: Start difference. First operand 195 states and 267 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:26,507 INFO L93 Difference]: Finished difference Result 489 states and 662 transitions. [2024-10-11 13:26:26,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:26:26,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-11 13:26:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:26,509 INFO L225 Difference]: With dead ends: 489 [2024-10-11 13:26:26,509 INFO L226 Difference]: Without dead ends: 310 [2024-10-11 13:26:26,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:26:26,509 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 136 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:26,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 676 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:26:26,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-11 13:26:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 203. [2024-10-11 13:26:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 173 states have (on average 1.323699421965318) internal successors, (229), 175 states have internal predecessors, (229), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 13:26:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 279 transitions. [2024-10-11 13:26:26,530 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 279 transitions. Word has length 94 [2024-10-11 13:26:26,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:26,530 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 279 transitions. [2024-10-11 13:26:26,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 279 transitions. [2024-10-11 13:26:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:26:26,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:26,531 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:26,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:26:26,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:26,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash 486358727, now seen corresponding path program 1 times [2024-10-11 13:26:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:26,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088261514] [2024-10-11 13:26:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088261514] [2024-10-11 13:26:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088261514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:26,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:26:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383530306] [2024-10-11 13:26:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:26,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:26:26,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:26:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:26:26,707 INFO L87 Difference]: Start difference. First operand 203 states and 279 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:26,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:26,837 INFO L93 Difference]: Finished difference Result 481 states and 651 transitions. [2024-10-11 13:26:26,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:26:26,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-11 13:26:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:26,839 INFO L225 Difference]: With dead ends: 481 [2024-10-11 13:26:26,839 INFO L226 Difference]: Without dead ends: 294 [2024-10-11 13:26:26,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:26:26,840 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 118 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:26,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 447 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:26:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-11 13:26:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 176. [2024-10-11 13:26:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 152 states have internal predecessors, (198), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:26:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2024-10-11 13:26:26,862 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 94 [2024-10-11 13:26:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:26,862 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2024-10-11 13:26:26,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2024-10-11 13:26:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:26:26,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:26,864 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:26,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:26:26,865 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:26,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1789474856, now seen corresponding path program 1 times [2024-10-11 13:26:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:26,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993112870] [2024-10-11 13:26:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:26:26,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [938990601] [2024-10-11 13:26:26,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:26,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:26:26,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:26:26,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:26:26,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:26:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:27,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 13:26:27,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:26:28,739 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 30 treesize of output 21 [2024-10-11 13:26:29,237 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 30 treesize of output 21 [2024-10-11 13:26:29,651 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 23 treesize of output 11 [2024-10-11 13:26:30,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2024-10-11 13:26:30,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-11 13:26:30,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-11 13:26:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-11 13:26:30,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:26:33,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:33,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993112870] [2024-10-11 13:26:33,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 13:26:33,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938990601] [2024-10-11 13:26:33,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938990601] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:26:33,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:26:33,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-11 13:26:33,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396013187] [2024-10-11 13:26:33,011 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 13:26:33,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:26:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:33,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:26:33,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:26:33,012 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 13:26:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:33,594 INFO L93 Difference]: Finished difference Result 466 states and 629 transitions. [2024-10-11 13:26:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:26:33,595 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 94 [2024-10-11 13:26:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:33,596 INFO L225 Difference]: With dead ends: 466 [2024-10-11 13:26:33,596 INFO L226 Difference]: Without dead ends: 291 [2024-10-11 13:26:33,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:26:33,597 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 148 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:33,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 958 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:26:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-11 13:26:33,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 244. [2024-10-11 13:26:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 206 states have (on average 1.296116504854369) internal successors, (267), 207 states have internal predecessors, (267), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 13:26:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 329 transitions. [2024-10-11 13:26:33,618 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 329 transitions. Word has length 94 [2024-10-11 13:26:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:33,618 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 329 transitions. [2024-10-11 13:26:33,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 13:26:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 329 transitions. [2024-10-11 13:26:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:26:33,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:33,619 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:33,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:26:33,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 13:26:33,824 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:33,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1121293249, now seen corresponding path program 1 times [2024-10-11 13:26:33,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:33,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951003010] [2024-10-11 13:26:33,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:33,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:26:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:26:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:26:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:26:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:26:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:26:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:26:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:26:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:26:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:26:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:26:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:33,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:26:33,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951003010] [2024-10-11 13:26:33,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951003010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:33,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:33,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:26:33,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029225394] [2024-10-11 13:26:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:33,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:26:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:26:33,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:26:33,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:26:33,937 INFO L87 Difference]: Start difference. First operand 244 states and 329 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:33,984 INFO L93 Difference]: Finished difference Result 427 states and 576 transitions. [2024-10-11 13:26:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:26:33,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2024-10-11 13:26:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:33,986 INFO L225 Difference]: With dead ends: 427 [2024-10-11 13:26:33,986 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 13:26:33,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:26:33,987 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:33,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 519 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:26:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 13:26:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2024-10-11 13:26:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 211 states have (on average 1.2890995260663507) internal successors, (272), 212 states have internal predecessors, (272), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 13:26:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 334 transitions. [2024-10-11 13:26:34,010 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 334 transitions. Word has length 95 [2024-10-11 13:26:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:34,011 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 334 transitions. [2024-10-11 13:26:34,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:34,011 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 334 transitions. [2024-10-11 13:26:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:26:34,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:34,012 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:34,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:26:34,012 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:34,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:34,012 INFO L85 PathProgramCache]: Analyzing trace with hash 627431752, now seen corresponding path program 1 times [2024-10-11 13:26:34,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:26:34,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300330396] [2024-10-11 13:26:34,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:34,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:26:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:26:34,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100473505] [2024-10-11 13:26:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:34,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:26:34,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:26:34,078 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:26:34,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:26:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:26:34,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:26:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:26:34,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:26:34,397 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:26:34,398 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:26:34,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 13:26:34,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 13:26:34,602 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:34,710 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:26:34,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:26:34 BoogieIcfgContainer [2024-10-11 13:26:34,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:26:34,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:26:34,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:26:34,713 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:26:34,714 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:26:19" (3/4) ... [2024-10-11 13:26:34,715 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:26:34,716 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:26:34,717 INFO L158 Benchmark]: Toolchain (without parser) took 15670.88ms. Allocated memory was 174.1MB in the beginning and 448.8MB in the end (delta: 274.7MB). Free memory was 145.7MB in the beginning and 397.1MB in the end (delta: -251.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-10-11 13:26:34,717 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:26:34,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.21ms. Allocated memory is still 174.1MB. Free memory was 145.7MB in the beginning and 130.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:26:34,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.46ms. Allocated memory is still 174.1MB. Free memory was 130.0MB in the beginning and 126.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:26:34,718 INFO L158 Benchmark]: Boogie Preprocessor took 71.59ms. Allocated memory is still 174.1MB. Free memory was 126.9MB in the beginning and 122.5MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:26:34,718 INFO L158 Benchmark]: RCFGBuilder took 527.80ms. Allocated memory is still 174.1MB. Free memory was 122.5MB in the beginning and 87.0MB in the end (delta: 35.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 13:26:34,719 INFO L158 Benchmark]: TraceAbstraction took 14737.14ms. Allocated memory was 174.1MB in the beginning and 448.8MB in the end (delta: 274.7MB). Free memory was 86.0MB in the beginning and 397.1MB in the end (delta: -311.2MB). Peak memory consumption was 217.3MB. Max. memory is 16.1GB. [2024-10-11 13:26:34,719 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 448.8MB. Free memory is still 397.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:26:34,721 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.12ms. Allocated memory is still 130.0MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.21ms. Allocated memory is still 174.1MB. Free memory was 145.7MB in the beginning and 130.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.46ms. Allocated memory is still 174.1MB. Free memory was 130.0MB in the beginning and 126.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.59ms. Allocated memory is still 174.1MB. Free memory was 126.9MB in the beginning and 122.5MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 527.80ms. Allocated memory is still 174.1MB. Free memory was 122.5MB in the beginning and 87.0MB in the end (delta: 35.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14737.14ms. Allocated memory was 174.1MB in the beginning and 448.8MB in the end (delta: 274.7MB). Free memory was 86.0MB in the beginning and 397.1MB in the end (delta: -311.2MB). Peak memory consumption was 217.3MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 448.8MB. Free memory is still 397.1MB. 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 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27-L29] double double_Array_0[2] = { 0.97, 32.6 }; [L27-L29] double double_Array_0[2] = { 0.97, 32.6 }; [L27-L29] double double_Array_0[2] = { 0.97, 32.6 }; [L30] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L32-L34] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L32-L34] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L32-L34] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L32-L34] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L32-L34] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L35] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0][0]); [L36] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer = &(signed_long_int_Array_0[1][0]); [L37] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer = &(signed_long_int_Array_0[0][1]); [L38] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer = &(signed_long_int_Array_0[1][1]); [L39-L41] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L39-L41] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L39-L41] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L44] double last_1_double_Array_0_0_ = 0.97; [L45] signed long int last_1_signed_long_int_Array_0_1__0_ = 4; [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L104] EXPR double_Array_0[0] [L104] last_1_double_Array_0_0_ = double_Array_0[0] [L105] EXPR signed_long_int_Array_0[1][0] [L105] last_1_signed_long_int_Array_0_1__0_ = signed_long_int_Array_0[1][0] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L85] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L86] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L87] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L87] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L87] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L88] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L89] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L90] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L90] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L90] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L91] double_Array_0[1] = __VERIFIER_nondet_double() [L92] EXPR double_Array_0[1] [L92] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L92] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L92] EXPR double_Array_0[1] [L92] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L92] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L92] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L92] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L92] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L93] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L94] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L95] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L95] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L95] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L96] signed_long_int_Array_0[0][1] = __VERIFIER_nondet_long() [L97] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L97] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L97] RET assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L98] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L98] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L98] RET assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L99] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L100] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L101] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L101] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L101] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L116] RET updateVariables() [L117] CALL step() [L49] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L49] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L49] COND FALSE !(! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) [L56] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L56] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L58] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L58] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L58] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L61] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L61] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) = ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) [L63] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L63] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L63] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L63] COND FALSE !(((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L74] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L74] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L76] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L76] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L77] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L77] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L77] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L77] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) = (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))))) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L108] EXPR (! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L108] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L108] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) [L108] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L108] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L108] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L108-L109] return ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))))))) && ((! ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : 1) : 1) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer))) < (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) 0.8)) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:8}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={6:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var3_Pointer={6:12}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 16, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1876 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1876 mSDsluCounter, 6934 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5094 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1755 IncrementalHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 1840 mSDtfsCounter, 1755 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=15, InterpolantAutomatonStates: 90, 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, 15 MinimizatonAttempts, 454 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1665 NumberOfCodeBlocks, 1665 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1366 ConstructedInterpolants, 0 QuantifiedInterpolants, 9270 SizeOfPredicates, 17 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 3172/3300 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-10-11 13:26:34,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:26:36,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:26:36,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:26:36,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:26:36,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:26:36,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:26:36,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:26:36,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:26:36,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:26:36,584 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:26:36,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:26:36,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:26:36,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:26:36,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:26:36,587 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:26:36,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:26:36,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:26:36,588 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:26:36,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:26:36,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:26:36,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:26:36,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:26:36,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:26:36,589 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:26:36,589 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:26:36,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:26:36,589 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:26:36,589 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:26:36,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:26:36,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:26:36,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:26:36,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:26:36,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:26:36,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:26:36,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:26:36,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:26:36,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:26:36,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:26:36,591 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:26:36,591 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:26:36,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:26:36,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:26:36,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:26:36,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:26:36,592 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:26:36,592 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 642511f0cc57b1630f0ad0545fc5a6d0fb09b97407825981361747f93de7622e [2024-10-11 13:26:36,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:26:36,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:26:36,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:26:36,867 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:26:36,868 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:26:36,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i [2024-10-11 13:26:38,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:26:38,283 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:26:38,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i [2024-10-11 13:26:38,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d058efe12/60b95f0171294dc8b9854f445b6e9cd3/FLAG46f6513c0 [2024-10-11 13:26:38,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d058efe12/60b95f0171294dc8b9854f445b6e9cd3 [2024-10-11 13:26:38,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:26:38,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:26:38,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:26:38,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:26:38,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:26:38,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6590d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38, skipping insertion in model container [2024-10-11 13:26:38,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:26:38,458 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2024-10-11 13:26:38,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:26:38,539 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:26:38,550 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-31.i[917,930] [2024-10-11 13:26:38,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:26:38,607 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:26:38,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38 WrapperNode [2024-10-11 13:26:38,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:26:38,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:26:38,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:26:38,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:26:38,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,663 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 423 [2024-10-11 13:26:38,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:26:38,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:26:38,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:26:38,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:26:38,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,707 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 20, 22, 33, 33]. 30 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 4, 2]. The 16 writes are split as follows [0, 2, 5, 6, 3]. [2024-10-11 13:26:38,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:26:38,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:26:38,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:26:38,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:26:38,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (1/1) ... [2024-10-11 13:26:38,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:26:38,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:26:38,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:26:38,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:26:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:26:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:26:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:26:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 13:26:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 13:26:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-11 13:26:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:26:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:26:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 13:26:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 13:26:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-11 13:26:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:26:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:26:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:26:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:26:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:26:38,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:26:38,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:26:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:26:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:26:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:26:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:26:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:26:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:26:38,965 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:26:38,966 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:26:39,417 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-11 13:26:39,417 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:26:39,460 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:26:39,461 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:26:39,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:26:39 BoogieIcfgContainer [2024-10-11 13:26:39,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:26:39,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:26:39,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:26:39,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:26:39,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:26:38" (1/3) ... [2024-10-11 13:26:39,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7edf86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:26:39, skipping insertion in model container [2024-10-11 13:26:39,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:26:38" (2/3) ... [2024-10-11 13:26:39,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7edf86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:26:39, skipping insertion in model container [2024-10-11 13:26:39,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:26:39" (3/3) ... [2024-10-11 13:26:39,468 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-31.i [2024-10-11 13:26:39,481 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:26:39,481 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:26:39,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:26:39,542 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;@282e5c07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:26:39,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:26:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:26:39,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 13:26:39,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:39,555 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:39,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:39,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash -781815559, now seen corresponding path program 1 times [2024-10-11 13:26:39,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:26:39,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039129782] [2024-10-11 13:26:39,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:39,572 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-10-11 13:26:39,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:26:39,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 13:26:39,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:26:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:39,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:26:39,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:26:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-11 13:26:39,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:26:39,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:26:39,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039129782] [2024-10-11 13:26:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039129782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:39,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:26:39,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099867423] [2024-10-11 13:26:39,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:39,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:26:39,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:26:39,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:26:39,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:26:39,886 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:26:39,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:39,924 INFO L93 Difference]: Finished difference Result 154 states and 246 transitions. [2024-10-11 13:26:39,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:26:39,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-11 13:26:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:39,934 INFO L225 Difference]: With dead ends: 154 [2024-10-11 13:26:39,934 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 13:26:39,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:26:39,940 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:39,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:26:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 13:26:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 13:26:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:26:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-10-11 13:26:39,978 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 89 [2024-10-11 13:26:39,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:39,979 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-10-11 13:26:39,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:26:39,979 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-10-11 13:26:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 13:26:39,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:39,983 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:39,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:26:40,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 13:26:40,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:40,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:40,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1798356429, now seen corresponding path program 1 times [2024-10-11 13:26:40,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:26:40,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186321594] [2024-10-11 13:26:40,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:40,188 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-10-11 13:26:40,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:26:40,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 13:26:40,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:26:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:40,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:26:40,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:26:40,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:26:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:40,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:26:40,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:26:40,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186321594] [2024-10-11 13:26:40,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186321594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:40,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:40,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:26:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194436251] [2024-10-11 13:26:40,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:40,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:26:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:26:40,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:26:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:26:40,523 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:40,600 INFO L93 Difference]: Finished difference Result 149 states and 217 transitions. [2024-10-11 13:26:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:26:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2024-10-11 13:26:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:40,603 INFO L225 Difference]: With dead ends: 149 [2024-10-11 13:26:40,603 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 13:26:40,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:26:40,604 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:40,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:26:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 13:26:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 13:26:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:26:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2024-10-11 13:26:40,614 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 89 [2024-10-11 13:26:40,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:40,616 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2024-10-11 13:26:40,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2024-10-11 13:26:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 13:26:40,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:40,618 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:40,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:26:40,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 13:26:40,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:40,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1475542513, now seen corresponding path program 1 times [2024-10-11 13:26:40,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:26:40,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351836634] [2024-10-11 13:26:40,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:40,820 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-10-11 13:26:40,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:26:40,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 13:26:40,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:26:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:41,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:26:41,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:26:42,634 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 23 treesize of output 11 [2024-10-11 13:26:42,689 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 34 treesize of output 29 [2024-10-11 13:26:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 121 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 13:26:42,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:26:42,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-10-11 13:26:43,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:26:43,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351836634] [2024-10-11 13:26:43,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351836634] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:26:43,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1729821292] [2024-10-11 13:26:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:43,170 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:26:43,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:26:43,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:26:43,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-11 13:26:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:43,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 13:26:43,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:26:44,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:26:45,395 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 23 treesize of output 11 [2024-10-11 13:26:45,477 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 34 treesize of output 29 [2024-10-11 13:26:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 121 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 13:26:45,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:26:45,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-10-11 13:26:45,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1729821292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:26:45,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:26:45,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-10-11 13:26:45,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288822838] [2024-10-11 13:26:45,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:26:45,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 13:26:45,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:26:45,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 13:26:45,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:26:45,850 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 20 states, 18 states have (on average 4.277777777777778) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-10-11 13:26:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:47,237 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2024-10-11 13:26:47,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 13:26:47,238 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.277777777777778) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 89 [2024-10-11 13:26:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:47,239 INFO L225 Difference]: With dead ends: 212 [2024-10-11 13:26:47,239 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 13:26:47,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 192 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 13:26:47,241 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 671 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:47,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 559 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:26:47,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 13:26:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2024-10-11 13:26:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 110 states have internal predecessors, (149), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:26:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 185 transitions. [2024-10-11 13:26:47,256 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 185 transitions. Word has length 89 [2024-10-11 13:26:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:47,257 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 185 transitions. [2024-10-11 13:26:47,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.277777777777778) internal successors, (77), 17 states have internal predecessors, (77), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2024-10-11 13:26:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 185 transitions. [2024-10-11 13:26:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:26:47,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:47,258 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:47,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:26:47,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:26:47,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate-clean/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-10-11 13:26:47,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:47,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1165057578, now seen corresponding path program 1 times [2024-10-11 13:26:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:26:47,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73903096] [2024-10-11 13:26:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:47,661 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-10-11 13:26:47,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:26:47,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 13:26:47,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Waiting until timeout for monitored process [2024-10-11 13:26:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:47,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:26:47,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:26:47,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:26:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:47,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:26:47,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:26:47,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73903096] [2024-10-11 13:26:47,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73903096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:47,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:47,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:26:47,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746833652] [2024-10-11 13:26:47,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:47,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:26:47,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:26:47,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:26:47,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:26:47,864 INFO L87 Difference]: Start difference. First operand 131 states and 185 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:47,902 INFO L93 Difference]: Finished difference Result 261 states and 369 transitions. [2024-10-11 13:26:47,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:26:47,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-11 13:26:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:47,905 INFO L225 Difference]: With dead ends: 261 [2024-10-11 13:26:47,905 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 13:26:47,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:26:47,906 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:47,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:26:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 13:26:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-11 13:26:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.348623853211009) internal successors, (147), 110 states have internal predecessors, (147), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:26:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 183 transitions. [2024-10-11 13:26:47,930 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 183 transitions. Word has length 91 [2024-10-11 13:26:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:47,931 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 183 transitions. [2024-10-11 13:26:47,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 183 transitions. [2024-10-11 13:26:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:26:47,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:47,932 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:47,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Forceful destruction successful, exit code 0 [2024-10-11 13:26:48,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 13:26:48,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:48,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash -484999208, now seen corresponding path program 1 times [2024-10-11 13:26:48,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:26:48,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804390615] [2024-10-11 13:26:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:48,134 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-10-11 13:26:48,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:26:48,136 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 13:26:48,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Waiting until timeout for monitored process [2024-10-11 13:26:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:48,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 13:26:48,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:26:49,421 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 32 treesize of output 27 [2024-10-11 13:26:49,532 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 54 treesize of output 48 [2024-10-11 13:26:49,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 98 [2024-10-11 13:26:49,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:26:49,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 62 [2024-10-11 13:26:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 121 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 13:26:49,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:26:50,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 156 [2024-10-11 13:26:50,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:26:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804390615] [2024-10-11 13:26:50,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804390615] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:26:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1427630459] [2024-10-11 13:26:50,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:50,543 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:26:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:26:50,545 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:26:50,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-11 13:26:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:51,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:26:51,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:26:51,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:26:52,144 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 24 treesize of output 24 [2024-10-11 13:26:52,273 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 47 treesize of output 45 [2024-10-11 13:26:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-11 13:26:52,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:26:52,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 156 [2024-10-11 13:26:52,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1427630459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:26:52,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:26:52,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2024-10-11 13:26:52,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654053335] [2024-10-11 13:26:52,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:26:52,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 13:26:52,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:26:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 13:26:52,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:26:52,980 INFO L87 Difference]: Start difference. First operand 131 states and 183 transitions. Second operand has 17 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 5 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-11 13:26:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:58,273 INFO L93 Difference]: Finished difference Result 298 states and 412 transitions. [2024-10-11 13:26:58,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 13:26:58,274 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 5 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 5 states have call successors, (22) Word has length 91 [2024-10-11 13:26:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:58,275 INFO L225 Difference]: With dead ends: 298 [2024-10-11 13:26:58,276 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 13:26:58,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 13:26:58,277 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 469 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:58,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 993 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 13:26:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 13:26:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 108. [2024-10-11 13:26:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.313953488372093) internal successors, (113), 87 states have internal predecessors, (113), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:26:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 149 transitions. [2024-10-11 13:26:58,293 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 149 transitions. Word has length 91 [2024-10-11 13:26:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:58,294 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 149 transitions. [2024-10-11 13:26:58,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 5 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-11 13:26:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2024-10-11 13:26:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:26:58,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:58,295 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:58,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Ended with exit code 0 [2024-10-11 13:26:58,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-11 13:26:58,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:26:58,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:58,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:58,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1927507371, now seen corresponding path program 1 times [2024-10-11 13:26:58,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:26:58,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888175378] [2024-10-11 13:26:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:58,697 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-10-11 13:26:58,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:26:58,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-11 13:26:58,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Waiting until timeout for monitored process [2024-10-11 13:26:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:58,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 13:26:58,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:26:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:58,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:26:58,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:26:58,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888175378] [2024-10-11 13:26:58,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888175378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:26:58,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:26:58,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:26:58,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183810315] [2024-10-11 13:26:58,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:58,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:26:58,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:26:58,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:26:58,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:26:58,870 INFO L87 Difference]: Start difference. First operand 108 states and 149 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:58,891 INFO L93 Difference]: Finished difference Result 197 states and 270 transitions. [2024-10-11 13:26:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:26:58,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-11 13:26:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:58,893 INFO L225 Difference]: With dead ends: 197 [2024-10-11 13:26:58,893 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 13:26:58,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:26:58,894 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:58,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:26:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 13:26:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 13:26:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 88 states have internal predecessors, (114), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:26:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 150 transitions. [2024-10-11 13:26:58,904 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 150 transitions. Word has length 91 [2024-10-11 13:26:58,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:58,904 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 150 transitions. [2024-10-11 13:26:58,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 150 transitions. [2024-10-11 13:26:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 13:26:58,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:58,905 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:58,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Forceful destruction successful, exit code 0 [2024-10-11 13:26:59,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-11 13:26:59,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:59,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:59,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2109294487, now seen corresponding path program 1 times [2024-10-11 13:26:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:26:59,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740445056] [2024-10-11 13:26:59,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:59,107 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-10-11 13:26:59,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:26:59,108 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-11 13:26:59,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (10)] Waiting until timeout for monitored process [2024-10-11 13:26:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:59,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:26:59,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:26:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 7 proven. 117 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 13:26:59,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:26:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:26:59,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:26:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740445056] [2024-10-11 13:26:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740445056] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:26:59,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:26:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-11 13:26:59,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904953985] [2024-10-11 13:26:59,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:26:59,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:26:59,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:26:59,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:26:59,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:26:59,487 INFO L87 Difference]: Start difference. First operand 109 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:26:59,548 INFO L93 Difference]: Finished difference Result 228 states and 310 transitions. [2024-10-11 13:26:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:26:59,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2024-10-11 13:26:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:26:59,550 INFO L225 Difference]: With dead ends: 228 [2024-10-11 13:26:59,550 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 13:26:59,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:26:59,551 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 82 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:26:59,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 350 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:26:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 13:26:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2024-10-11 13:26:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 88 states have internal predecessors, (113), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:26:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 149 transitions. [2024-10-11 13:26:59,570 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 149 transitions. Word has length 91 [2024-10-11 13:26:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:26:59,571 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 149 transitions. [2024-10-11 13:26:59,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:26:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 149 transitions. [2024-10-11 13:26:59,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 13:26:59,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:26:59,571 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:26:59,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (10)] Forceful destruction successful, exit code 0 [2024-10-11 13:26:59,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-11 13:26:59,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:26:59,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:26:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash 982542333, now seen corresponding path program 1 times [2024-10-11 13:26:59,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:26:59,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966728749] [2024-10-11 13:26:59,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:26:59,773 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-10-11 13:26:59,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:26:59,774 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-11 13:26:59,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (11)] Waiting until timeout for monitored process [2024-10-11 13:26:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:26:59,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:26:59,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:00,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-11 13:27:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 7 proven. 117 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 13:27:00,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:27:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:27:00,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:27:00,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966728749] [2024-10-11 13:27:00,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966728749] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:27:00,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:27:00,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-11 13:27:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747181037] [2024-10-11 13:27:00,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:27:00,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:27:00,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:27:00,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:27:00,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:27:00,203 INFO L87 Difference]: Start difference. First operand 109 states and 149 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:27:00,272 INFO L93 Difference]: Finished difference Result 221 states and 297 transitions. [2024-10-11 13:27:00,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:27:00,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2024-10-11 13:27:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:27:00,273 INFO L225 Difference]: With dead ends: 221 [2024-10-11 13:27:00,273 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 13:27:00,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:27:00,274 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 32 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:27:00,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 367 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:27:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 13:27:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 109. [2024-10-11 13:27:00,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 88 states have internal predecessors, (112), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 13:27:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 148 transitions. [2024-10-11 13:27:00,283 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 148 transitions. Word has length 92 [2024-10-11 13:27:00,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:27:00,284 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 148 transitions. [2024-10-11 13:27:00,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 148 transitions. [2024-10-11 13:27:00,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 13:27:00,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:27:00,287 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:27:00,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (11)] Forceful destruction successful, exit code 0 [2024-10-11 13:27:00,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-10-11 13:27:00,488 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:27:00,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:27:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1495639923, now seen corresponding path program 1 times [2024-10-11 13:27:00,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:27:00,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130462147] [2024-10-11 13:27:00,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:00,489 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-10-11 13:27:00,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:27:00,491 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-10-11 13:27:00,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (12)] Waiting until timeout for monitored process [2024-10-11 13:27:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:00,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:27:00,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:01,205 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-10-11 13:27:01,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-11 13:27:01,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:27:01,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 34 [2024-10-11 13:27:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 40 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 13:27:01,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:27:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:27:01,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:27:01,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130462147] [2024-10-11 13:27:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130462147] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:27:01,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:27:01,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2024-10-11 13:27:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844460427] [2024-10-11 13:27:01,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:27:01,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:27:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:27:01,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:27:01,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:27:01,607 INFO L87 Difference]: Start difference. First operand 109 states and 148 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:27:01,756 INFO L93 Difference]: Finished difference Result 284 states and 379 transitions. [2024-10-11 13:27:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:27:01,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 93 [2024-10-11 13:27:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:27:01,757 INFO L225 Difference]: With dead ends: 284 [2024-10-11 13:27:01,757 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 13:27:01,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:27:01,758 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 85 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:27:01,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 588 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:27:01,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 13:27:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-10-11 13:27:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 160 states have internal predecessors, (204), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:27:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 258 transitions. [2024-10-11 13:27:01,773 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 258 transitions. Word has length 93 [2024-10-11 13:27:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:27:01,774 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 258 transitions. [2024-10-11 13:27:01,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 258 transitions. [2024-10-11 13:27:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:27:01,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:27:01,775 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:27:01,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (12)] Forceful destruction successful, exit code 0 [2024-10-11 13:27:01,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-10-11 13:27:01,975 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:27:01,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:27:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash -534709627, now seen corresponding path program 1 times [2024-10-11 13:27:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:27:01,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850386847] [2024-10-11 13:27:01,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:01,976 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-10-11 13:27:01,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:27:01,977 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-10-11 13:27:01,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (13)] Waiting until timeout for monitored process [2024-10-11 13:27:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:02,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:27:02,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:27:02,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:27:02,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:27:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850386847] [2024-10-11 13:27:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850386847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:27:02,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:27:02,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:27:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966732104] [2024-10-11 13:27:02,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:27:02,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:27:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:27:02,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:27:02,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:27:02,164 INFO L87 Difference]: Start difference. First operand 192 states and 258 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:27:02,252 INFO L93 Difference]: Finished difference Result 431 states and 576 transitions. [2024-10-11 13:27:02,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:27:02,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-11 13:27:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:27:02,254 INFO L225 Difference]: With dead ends: 431 [2024-10-11 13:27:02,254 INFO L226 Difference]: Without dead ends: 259 [2024-10-11 13:27:02,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:27:02,255 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 37 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:27:02,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 426 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:27:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-11 13:27:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 200. [2024-10-11 13:27:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 166 states have (on average 1.2771084337349397) internal successors, (212), 168 states have internal predecessors, (212), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:27:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 266 transitions. [2024-10-11 13:27:02,274 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 266 transitions. Word has length 94 [2024-10-11 13:27:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:27:02,275 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 266 transitions. [2024-10-11 13:27:02,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 266 transitions. [2024-10-11 13:27:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:27:02,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:27:02,276 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:27:02,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (13)] Forceful destruction successful, exit code 0 [2024-10-11 13:27:02,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-10-11 13:27:02,477 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:27:02,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:27:02,477 INFO L85 PathProgramCache]: Analyzing trace with hash 424520389, now seen corresponding path program 1 times [2024-10-11 13:27:02,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:27:02,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262648398] [2024-10-11 13:27:02,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:02,477 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-10-11 13:27:02,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:27:02,478 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-10-11 13:27:02,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (14)] Waiting until timeout for monitored process [2024-10-11 13:27:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:02,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:27:02,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:27:02,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:27:02,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:27:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262648398] [2024-10-11 13:27:02,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262648398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:27:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:27:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:27:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899721005] [2024-10-11 13:27:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:27:02,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:27:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:27:02,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:27:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:27:02,642 INFO L87 Difference]: Start difference. First operand 200 states and 266 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:27:02,692 INFO L93 Difference]: Finished difference Result 386 states and 510 transitions. [2024-10-11 13:27:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:27:02,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-11 13:27:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:27:02,694 INFO L225 Difference]: With dead ends: 386 [2024-10-11 13:27:02,694 INFO L226 Difference]: Without dead ends: 206 [2024-10-11 13:27:02,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:27:02,694 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:27:02,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 396 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:27:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-11 13:27:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 202. [2024-10-11 13:27:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 168 states have (on average 1.2738095238095237) internal successors, (214), 170 states have internal predecessors, (214), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:27:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 268 transitions. [2024-10-11 13:27:02,708 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 268 transitions. Word has length 94 [2024-10-11 13:27:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:27:02,709 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 268 transitions. [2024-10-11 13:27:02,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 268 transitions. [2024-10-11 13:27:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:27:02,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:27:02,709 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:27:02,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (14)] Ended with exit code 0 [2024-10-11 13:27:02,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-10-11 13:27:02,910 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:27:02,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:27:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1766222405, now seen corresponding path program 1 times [2024-10-11 13:27:02,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:27:02,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278536584] [2024-10-11 13:27:02,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:02,911 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-10-11 13:27:02,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:27:02,912 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-10-11 13:27:02,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (15)] Waiting until timeout for monitored process [2024-10-11 13:27:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:03,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:27:03,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:03,664 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 23 treesize of output 11 [2024-10-11 13:27:03,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-11 13:27:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 121 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 13:27:03,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:27:03,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:27:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278536584] [2024-10-11 13:27:03,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278536584] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:27:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [265092972] [2024-10-11 13:27:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:03,780 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:27:03,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:27:03,781 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:27:03,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-10-11 13:27:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:04,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:27:04,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:05,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:27:05,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:27:05,407 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 15 treesize of output 15 [2024-10-11 13:27:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-11 13:27:05,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:27:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:27:05,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [265092972] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:27:05,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:27:05,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 20 [2024-10-11 13:27:05,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014254370] [2024-10-11 13:27:05,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:27:05,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:27:05,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:27:05,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:27:05,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:27:05,561 INFO L87 Difference]: Start difference. First operand 202 states and 268 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:27:05,721 INFO L93 Difference]: Finished difference Result 495 states and 650 transitions. [2024-10-11 13:27:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:27:05,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-11 13:27:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:27:05,723 INFO L225 Difference]: With dead ends: 495 [2024-10-11 13:27:05,723 INFO L226 Difference]: Without dead ends: 313 [2024-10-11 13:27:05,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:27:05,724 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 60 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:27:05,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 682 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:27:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-11 13:27:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 299. [2024-10-11 13:27:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 253 states have (on average 1.2766798418972332) internal successors, (323), 257 states have internal predecessors, (323), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 13:27:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 397 transitions. [2024-10-11 13:27:05,750 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 397 transitions. Word has length 94 [2024-10-11 13:27:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:27:05,752 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 397 transitions. [2024-10-11 13:27:05,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 397 transitions. [2024-10-11 13:27:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:27:05,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:27:05,753 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:27:05,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (15)] Ended with exit code 0 [2024-10-11 13:27:05,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-10-11 13:27:06,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:27:06,158 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:27:06,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:27:06,158 INFO L85 PathProgramCache]: Analyzing trace with hash 486358727, now seen corresponding path program 1 times [2024-10-11 13:27:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:27:06,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803141308] [2024-10-11 13:27:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:06,159 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-10-11 13:27:06,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:27:06,160 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/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-10-11 13:27:06,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (17)] Waiting until timeout for monitored process [2024-10-11 13:27:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:06,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:27:06,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:27:06,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:27:06,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:27:06,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803141308] [2024-10-11 13:27:06,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803141308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:27:06,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:27:06,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:27:06,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371366388] [2024-10-11 13:27:06,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:27:06,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:27:06,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:27:06,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:27:06,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:27:06,373 INFO L87 Difference]: Start difference. First operand 299 states and 397 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:27:06,561 INFO L93 Difference]: Finished difference Result 665 states and 873 transitions. [2024-10-11 13:27:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:27:06,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-10-11 13:27:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:27:06,566 INFO L225 Difference]: With dead ends: 665 [2024-10-11 13:27:06,566 INFO L226 Difference]: Without dead ends: 386 [2024-10-11 13:27:06,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 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-10-11 13:27:06,567 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 60 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:27:06,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 415 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:27:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-11 13:27:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 291. [2024-10-11 13:27:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 244 states have (on average 1.2622950819672132) internal successors, (308), 248 states have internal predecessors, (308), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 13:27:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 382 transitions. [2024-10-11 13:27:06,589 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 382 transitions. Word has length 94 [2024-10-11 13:27:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:27:06,589 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 382 transitions. [2024-10-11 13:27:06,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:27:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 382 transitions. [2024-10-11 13:27:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:27:06,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:27:06,590 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:27:06,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (17)] Forceful destruction successful, exit code 0 [2024-10-11 13:27:06,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/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-10-11 13:27:06,791 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:27:06,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:27:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1789474856, now seen corresponding path program 1 times [2024-10-11 13:27:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:27:06,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829500758] [2024-10-11 13:27:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:06,792 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-10-11 13:27:06,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:27:06,793 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/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-10-11 13:27:06,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (18)] Waiting until timeout for monitored process [2024-10-11 13:27:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:07,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 13:27:07,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:07,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 13:27:09,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-11 13:27:11,640 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 37 treesize of output 24 [2024-10-11 13:27:11,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-10-11 13:27:11,873 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 45 treesize of output 39 [2024-10-11 13:27:12,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:27:12,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 43 [2024-10-11 13:27:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-11 13:27:12,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:27:18,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:27:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829500758] [2024-10-11 13:27:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829500758] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:27:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [524179879] [2024-10-11 13:27:18,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:27:18,513 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:27:18,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:27:18,514 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:27:18,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-10-11 13:27:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:27:19,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 13:27:19,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:27:20,745 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 23 treesize of output 11 [2024-10-11 13:27:21,219 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 23 treesize of output 11 [2024-10-11 13:27:22,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2024-10-11 13:27:23,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2024-10-11 13:27:23,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2024-10-11 13:27:24,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 55 [2024-10-11 13:27:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 121 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 13:27:24,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:27:24,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 154 [2024-10-11 13:27:39,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [524179879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:27:39,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:27:39,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 13:27:39,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459827201] [2024-10-11 13:27:39,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:27:39,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 13:27:39,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:27:39,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 13:27:39,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1096, Unknown=3, NotChecked=0, Total=1260 [2024-10-11 13:27:39,778 INFO L87 Difference]: Start difference. First operand 291 states and 382 transitions. Second operand has 27 states, 25 states have (on average 3.68) internal successors, (92), 24 states have internal predecessors, (92), 7 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2024-10-11 13:27:41,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:43,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:46,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:27:47,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []