./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 d3e0774e78cf4ed6ba09a877be2127aeb0fe9129940fc78943597bbe0bd3d6c8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:14:51,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:14:51,340 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:14:51,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:14:51,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:14:51,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:14:51,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:14:51,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:14:51,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:14:51,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:14:51,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:14:51,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:14:51,380 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:14:51,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:14:51,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:14:51,384 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:14:51,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:14:51,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:14:51,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:14:51,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:14:51,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:14:51,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:14:51,392 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:14:51,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:14:51,392 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:14:51,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:14:51,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:14:51,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:14:51,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:51,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:14:51,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:14:51,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:14:51,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:14:51,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:14:51,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:14:51,398 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:14:51,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:14:51,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:14:51,399 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:14:51,399 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> d3e0774e78cf4ed6ba09a877be2127aeb0fe9129940fc78943597bbe0bd3d6c8 [2023-11-06 21:14:51,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:14:51,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:14:51,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:14:51,689 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:14:51,689 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:14:51,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i [2023-11-06 21:14:54,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:55,045 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:55,045 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i [2023-11-06 21:14:55,054 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/data/15e5b6e6b/4e1eda347c9b440eb11a50d5fb915f4c/FLAG6e67a9ccb [2023-11-06 21:14:55,067 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/data/15e5b6e6b/4e1eda347c9b440eb11a50d5fb915f4c [2023-11-06 21:14:55,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:55,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:55,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:55,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:55,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:55,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef30ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55, skipping insertion in model container [2023-11-06 21:14:55,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,118 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:55,270 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i[916,929] [2023-11-06 21:14:55,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:55,339 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:55,351 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i[916,929] [2023-11-06 21:14:55,394 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:55,416 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:55,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55 WrapperNode [2023-11-06 21:14:55,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:55,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:55,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:55,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:55,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,495 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2023-11-06 21:14:55,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:55,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:55,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:55,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:55,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:55,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:55,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:55,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:55,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (1/1) ... [2023-11-06 21:14:55,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:55,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:55,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:14:55,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:14:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 21:14:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:14:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 21:14:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:14:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 21:14:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:14:55,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:14:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:14:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:55,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:55,809 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:55,812 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:56,542 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:56,550 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:56,550 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:14:56,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:56 BoogieIcfgContainer [2023-11-06 21:14:56,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:56,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:14:56,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:14:56,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:14:56,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:55" (1/3) ... [2023-11-06 21:14:56,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565e8352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:56, skipping insertion in model container [2023-11-06 21:14:56,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:55" (2/3) ... [2023-11-06 21:14:56,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565e8352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:56, skipping insertion in model container [2023-11-06 21:14:56,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:56" (3/3) ... [2023-11-06 21:14:56,561 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-96.i [2023-11-06 21:14:56,577 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:14:56,577 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:14:56,630 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:14:56,637 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@362d2675, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:14:56,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:14:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 21:14:56,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:56,657 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:56,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:56,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash 407996187, now seen corresponding path program 1 times [2023-11-06 21:14:56,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958593201] [2023-11-06 21:14:56,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:14:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:14:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:14:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:57,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:57,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958593201] [2023-11-06 21:14:57,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958593201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:57,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:57,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:14:57,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866128629] [2023-11-06 21:14:57,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:57,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:14:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:57,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:14:57,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:14:57,253 INFO L87 Difference]: Start difference. First operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 21:14:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:57,312 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2023-11-06 21:14:57,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:14:57,315 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2023-11-06 21:14:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:57,324 INFO L225 Difference]: With dead ends: 209 [2023-11-06 21:14:57,324 INFO L226 Difference]: Without dead ends: 104 [2023-11-06 21:14:57,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:14:57,335 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:57,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-06 21:14:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-06 21:14:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-11-06 21:14:57,413 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 131 [2023-11-06 21:14:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:57,414 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-11-06 21:14:57,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 21:14:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-11-06 21:14:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 21:14:57,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:57,418 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:57,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:14:57,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:57,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash 575861183, now seen corresponding path program 1 times [2023-11-06 21:14:57,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:57,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103760642] [2023-11-06 21:14:57,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:57,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:14:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:14:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:14:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:57,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:57,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103760642] [2023-11-06 21:14:57,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103760642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:57,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:57,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:57,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485427175] [2023-11-06 21:14:57,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:57,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:57,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:57,986 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:58,075 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2023-11-06 21:14:58,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:58,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-11-06 21:14:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:58,080 INFO L225 Difference]: With dead ends: 217 [2023-11-06 21:14:58,080 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 21:14:58,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:58,083 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 21 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:58,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 443 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 21:14:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2023-11-06 21:14:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2023-11-06 21:14:58,098 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 131 [2023-11-06 21:14:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:58,100 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2023-11-06 21:14:58,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2023-11-06 21:14:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 21:14:58,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:58,103 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:58,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:14:58,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:58,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1255919553, now seen corresponding path program 1 times [2023-11-06 21:14:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:58,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212631767] [2023-11-06 21:14:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:14:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:14:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:14:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:58,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:58,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212631767] [2023-11-06 21:14:58,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212631767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:58,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179292859] [2023-11-06 21:14:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:58,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:58,330 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:58,394 INFO L93 Difference]: Finished difference Result 217 states and 316 transitions. [2023-11-06 21:14:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:58,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-11-06 21:14:58,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:58,399 INFO L225 Difference]: With dead ends: 217 [2023-11-06 21:14:58,399 INFO L226 Difference]: Without dead ends: 114 [2023-11-06 21:14:58,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:58,402 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 12 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:58,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 441 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-06 21:14:58,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-11-06 21:14:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2023-11-06 21:14:58,431 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 131 [2023-11-06 21:14:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:58,432 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2023-11-06 21:14:58,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2023-11-06 21:14:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 21:14:58,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:58,436 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:58,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:14:58,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:58,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:58,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1264040381, now seen corresponding path program 1 times [2023-11-06 21:14:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:58,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100115036] [2023-11-06 21:14:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:58,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:14:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:14:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:14:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:58,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:58,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100115036] [2023-11-06 21:14:58,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100115036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:58,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:14:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688418423] [2023-11-06 21:14:58,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:58,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:14:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:58,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:14:58,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:14:58,667 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:58,696 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2023-11-06 21:14:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:58,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-11-06 21:14:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:58,699 INFO L225 Difference]: With dead ends: 217 [2023-11-06 21:14:58,699 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 21:14:58,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:58,702 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 3 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:58,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 440 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:14:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 21:14:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-11-06 21:14:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2023-11-06 21:14:58,714 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 131 [2023-11-06 21:14:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:58,714 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2023-11-06 21:14:58,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2023-11-06 21:14:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 21:14:58,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:58,718 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:58,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:14:58,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:58,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1262193339, now seen corresponding path program 1 times [2023-11-06 21:14:58,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:58,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043857713] [2023-11-06 21:14:58,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:58,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:14:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:14:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:14:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:14:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:14:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:14:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:14:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:14:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:14:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:14:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:14:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:14:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:14:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:58,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:14:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:59,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:14:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:14:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:14:59,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:59,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043857713] [2023-11-06 21:14:59,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043857713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:59,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:59,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:14:59,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808411801] [2023-11-06 21:14:59,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:59,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:14:59,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:59,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:14:59,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:59,016 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:59,241 INFO L93 Difference]: Finished difference Result 219 states and 316 transitions. [2023-11-06 21:14:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:59,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-11-06 21:14:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:14:59,244 INFO L225 Difference]: With dead ends: 219 [2023-11-06 21:14:59,244 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 21:14:59,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:14:59,246 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 5 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:14:59,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 455 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:14:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 21:14:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-06 21:14:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:14:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2023-11-06 21:14:59,257 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 131 [2023-11-06 21:14:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:14:59,258 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2023-11-06 21:14:59,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:14:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2023-11-06 21:14:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 21:14:59,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:14:59,261 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:14:59,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:14:59,261 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:14:59,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1343830215, now seen corresponding path program 1 times [2023-11-06 21:14:59,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674376482] [2023-11-06 21:14:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:15:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:15:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:15:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:15:00,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:00,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674376482] [2023-11-06 21:15:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674376482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:00,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:00,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:15:00,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633242540] [2023-11-06 21:15:00,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:00,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:15:00,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:00,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:15:00,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:15:00,933 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 21:15:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:01,372 INFO L93 Difference]: Finished difference Result 325 states and 463 transitions. [2023-11-06 21:15:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:15:01,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2023-11-06 21:15:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:01,375 INFO L225 Difference]: With dead ends: 325 [2023-11-06 21:15:01,375 INFO L226 Difference]: Without dead ends: 216 [2023-11-06 21:15:01,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:15:01,377 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 172 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:01,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 548 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:15:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-06 21:15:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 182. [2023-11-06 21:15:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 159 states have (on average 1.3773584905660377) internal successors, (219), 160 states have internal predecessors, (219), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:15:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 259 transitions. [2023-11-06 21:15:01,393 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 259 transitions. Word has length 131 [2023-11-06 21:15:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:01,394 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 259 transitions. [2023-11-06 21:15:01,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 21:15:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 259 transitions. [2023-11-06 21:15:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 21:15:01,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:01,402 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:01,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:15:01,402 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:01,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:01,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1325067934, now seen corresponding path program 1 times [2023-11-06 21:15:01,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:01,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553018085] [2023-11-06 21:15:01,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:01,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:15:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:15:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:15:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:15:01,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:01,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553018085] [2023-11-06 21:15:01,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553018085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:01,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:01,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:01,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49334449] [2023-11-06 21:15:01,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:01,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:01,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:01,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:01,594 INFO L87 Difference]: Start difference. First operand 182 states and 259 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:01,630 INFO L93 Difference]: Finished difference Result 396 states and 562 transitions. [2023-11-06 21:15:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:01,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-06 21:15:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:01,634 INFO L225 Difference]: With dead ends: 396 [2023-11-06 21:15:01,634 INFO L226 Difference]: Without dead ends: 217 [2023-11-06 21:15:01,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:01,639 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 65 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:01,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 291 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:15:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-11-06 21:15:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 178. [2023-11-06 21:15:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.367741935483871) internal successors, (212), 156 states have internal predecessors, (212), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:15:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 252 transitions. [2023-11-06 21:15:01,659 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 252 transitions. Word has length 133 [2023-11-06 21:15:01,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:01,660 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 252 transitions. [2023-11-06 21:15:01,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:01,661 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 252 transitions. [2023-11-06 21:15:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 21:15:01,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:01,664 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:01,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:15:01,665 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:01,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash 215562725, now seen corresponding path program 1 times [2023-11-06 21:15:01,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:01,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968408396] [2023-11-06 21:15:01,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:01,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:15:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:15:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:15:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:15:01,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:01,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968408396] [2023-11-06 21:15:01,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968408396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:01,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:01,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:15:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630671447] [2023-11-06 21:15:01,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:01,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:15:01,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:01,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:15:01,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:15:01,935 INFO L87 Difference]: Start difference. First operand 178 states and 252 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:02,006 INFO L93 Difference]: Finished difference Result 395 states and 559 transitions. [2023-11-06 21:15:02,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:15:02,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-06 21:15:02,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:02,009 INFO L225 Difference]: With dead ends: 395 [2023-11-06 21:15:02,009 INFO L226 Difference]: Without dead ends: 220 [2023-11-06 21:15:02,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:15:02,012 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 79 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:02,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 571 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:15:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-06 21:15:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 184. [2023-11-06 21:15:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 161 states have (on average 1.3540372670807452) internal successors, (218), 162 states have internal predecessors, (218), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:15:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 258 transitions. [2023-11-06 21:15:02,030 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 258 transitions. Word has length 133 [2023-11-06 21:15:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:02,030 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 258 transitions. [2023-11-06 21:15:02,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2023-11-06 21:15:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 21:15:02,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:02,033 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:02,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:15:02,033 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:02,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:02,033 INFO L85 PathProgramCache]: Analyzing trace with hash -958332128, now seen corresponding path program 1 times [2023-11-06 21:15:02,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:02,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27102725] [2023-11-06 21:15:02,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:02,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:15:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:15:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:15:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:15:02,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:02,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27102725] [2023-11-06 21:15:02,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27102725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:02,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:02,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:02,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164117841] [2023-11-06 21:15:02,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:02,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:02,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:02,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:02,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:02,195 INFO L87 Difference]: Start difference. First operand 184 states and 258 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:02,224 INFO L93 Difference]: Finished difference Result 368 states and 515 transitions. [2023-11-06 21:15:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:02,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-06 21:15:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:02,227 INFO L225 Difference]: With dead ends: 368 [2023-11-06 21:15:02,227 INFO L226 Difference]: Without dead ends: 187 [2023-11-06 21:15:02,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:02,228 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 67 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:02,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 342 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:15:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-06 21:15:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2023-11-06 21:15:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 161 states have (on average 1.3478260869565217) internal successors, (217), 162 states have internal predecessors, (217), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:15:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 257 transitions. [2023-11-06 21:15:02,243 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 257 transitions. Word has length 133 [2023-11-06 21:15:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:02,244 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 257 transitions. [2023-11-06 21:15:02,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 257 transitions. [2023-11-06 21:15:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 21:15:02,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:02,247 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:02,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:15:02,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:02,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1794922117, now seen corresponding path program 1 times [2023-11-06 21:15:02,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:02,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400221572] [2023-11-06 21:15:02,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:02,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:15:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:15:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:15:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:15:02,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:02,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400221572] [2023-11-06 21:15:02,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400221572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:02,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:02,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:15:02,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806508453] [2023-11-06 21:15:02,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:02,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:02,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:02,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:02,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:02,505 INFO L87 Difference]: Start difference. First operand 184 states and 257 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:02,835 INFO L93 Difference]: Finished difference Result 538 states and 748 transitions. [2023-11-06 21:15:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:02,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-11-06 21:15:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:02,839 INFO L225 Difference]: With dead ends: 538 [2023-11-06 21:15:02,839 INFO L226 Difference]: Without dead ends: 357 [2023-11-06 21:15:02,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:15:02,841 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 235 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:02,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 316 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:15:02,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-11-06 21:15:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 300. [2023-11-06 21:15:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 255 states have (on average 1.3254901960784313) internal successors, (338), 257 states have internal predecessors, (338), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-06 21:15:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 418 transitions. [2023-11-06 21:15:02,866 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 418 transitions. Word has length 135 [2023-11-06 21:15:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:02,867 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 418 transitions. [2023-11-06 21:15:02,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 418 transitions. [2023-11-06 21:15:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 21:15:02,869 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:02,869 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:02,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:15:02,870 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:02,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1386351378, now seen corresponding path program 1 times [2023-11-06 21:15:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86902594] [2023-11-06 21:15:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:02,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:15:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:15:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:15:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:15:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:03,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86902594] [2023-11-06 21:15:03,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86902594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:03,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:03,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:15:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511030325] [2023-11-06 21:15:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:03,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:03,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:03,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:03,035 INFO L87 Difference]: Start difference. First operand 300 states and 418 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:03,115 INFO L93 Difference]: Finished difference Result 664 states and 921 transitions. [2023-11-06 21:15:03,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:15:03,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2023-11-06 21:15:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:03,119 INFO L225 Difference]: With dead ends: 664 [2023-11-06 21:15:03,119 INFO L226 Difference]: Without dead ends: 376 [2023-11-06 21:15:03,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:15:03,121 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 124 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:03,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 478 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:15:03,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-11-06 21:15:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 302. [2023-11-06 21:15:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 257 states have (on average 1.3229571984435797) internal successors, (340), 259 states have internal predecessors, (340), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-06 21:15:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2023-11-06 21:15:03,145 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 136 [2023-11-06 21:15:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:03,145 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2023-11-06 21:15:03,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2023-11-06 21:15:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 21:15:03,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:03,148 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:03,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:15:03,148 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:03,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash 365283024, now seen corresponding path program 1 times [2023-11-06 21:15:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:03,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454286789] [2023-11-06 21:15:03,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:03,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:15:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:15:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:15:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:15:03,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454286789] [2023-11-06 21:15:03,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454286789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:03,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:03,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:15:03,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710548705] [2023-11-06 21:15:03,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:03,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:15:03,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:03,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:15:03,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:15:03,409 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:03,500 INFO L93 Difference]: Finished difference Result 712 states and 989 transitions. [2023-11-06 21:15:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:15:03,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2023-11-06 21:15:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:03,503 INFO L225 Difference]: With dead ends: 712 [2023-11-06 21:15:03,504 INFO L226 Difference]: Without dead ends: 422 [2023-11-06 21:15:03,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:15:03,505 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 104 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:03,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 729 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:15:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-11-06 21:15:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 305. [2023-11-06 21:15:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 260 states have (on average 1.3192307692307692) internal successors, (343), 262 states have internal predecessors, (343), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-06 21:15:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 423 transitions. [2023-11-06 21:15:03,528 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 423 transitions. Word has length 136 [2023-11-06 21:15:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:03,529 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 423 transitions. [2023-11-06 21:15:03,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 423 transitions. [2023-11-06 21:15:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 21:15:03,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:03,531 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:03,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:15:03,531 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:03,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1069777158, now seen corresponding path program 1 times [2023-11-06 21:15:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:03,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729057919] [2023-11-06 21:15:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:15:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:15:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:15:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:15:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:15:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:15:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:15:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:15:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:15:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:15:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:15:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:15:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:15:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:15:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:15:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:15:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 21:15:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729057919] [2023-11-06 21:15:03,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729057919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:03,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:03,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:15:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742988348] [2023-11-06 21:15:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:03,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:15:03,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:03,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:15:03,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:15:03,997 INFO L87 Difference]: Start difference. First operand 305 states and 423 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:15:04,487 INFO L93 Difference]: Finished difference Result 506 states and 715 transitions. [2023-11-06 21:15:04,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:15:04,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-11-06 21:15:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:15:04,492 INFO L225 Difference]: With dead ends: 506 [2023-11-06 21:15:04,493 INFO L226 Difference]: Without dead ends: 504 [2023-11-06 21:15:04,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:15:04,494 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 192 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:15:04,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 764 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:15:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2023-11-06 21:15:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 352. [2023-11-06 21:15:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 295 states have (on average 1.3016949152542372) internal successors, (384), 297 states have internal predecessors, (384), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-06 21:15:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 484 transitions. [2023-11-06 21:15:04,540 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 484 transitions. Word has length 137 [2023-11-06 21:15:04,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:15:04,541 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 484 transitions. [2023-11-06 21:15:04,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 21:15:04,542 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 484 transitions. [2023-11-06 21:15:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 21:15:04,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:04,544 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:04,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:15:04,544 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:04,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1071624200, now seen corresponding path program 1 times [2023-11-06 21:15:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:04,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765725007] [2023-11-06 21:15:04,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:15:04,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:15:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:15:04,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:15:04,854 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:15:04,855 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:15:04,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:15:04,860 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:04,866 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:15:04,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:15:04 BoogieIcfgContainer [2023-11-06 21:15:04,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:15:04,961 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:15:04,961 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:15:04,968 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:15:04,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:56" (3/4) ... [2023-11-06 21:15:04,970 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:15:04,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:15:04,972 INFO L158 Benchmark]: Toolchain (without parser) took 9901.09ms. Allocated memory was 186.6MB in the beginning and 285.2MB in the end (delta: 98.6MB). Free memory was 139.9MB in the beginning and 109.8MB in the end (delta: 30.1MB). Peak memory consumption was 129.3MB. Max. memory is 16.1GB. [2023-11-06 21:15:04,972 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:15:04,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.04ms. Allocated memory is still 186.6MB. Free memory was 139.6MB in the beginning and 123.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 21:15:04,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.26ms. Allocated memory is still 186.6MB. Free memory was 123.5MB in the beginning and 119.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:15:04,974 INFO L158 Benchmark]: Boogie Preprocessor took 62.36ms. Allocated memory is still 186.6MB. Free memory was 119.3MB in the beginning and 115.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:04,975 INFO L158 Benchmark]: RCFGBuilder took 993.17ms. Allocated memory is still 186.6MB. Free memory was 115.9MB in the beginning and 137.2MB in the end (delta: -21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 21:15:04,976 INFO L158 Benchmark]: TraceAbstraction took 8406.06ms. Allocated memory was 186.6MB in the beginning and 285.2MB in the end (delta: 98.6MB). Free memory was 136.5MB in the beginning and 110.9MB in the end (delta: 25.6MB). Peak memory consumption was 126.6MB. Max. memory is 16.1GB. [2023-11-06 21:15:04,976 INFO L158 Benchmark]: Witness Printer took 10.23ms. Allocated memory is still 285.2MB. Free memory was 110.9MB in the beginning and 109.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:15:04,981 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.19ms. Allocated memory is still 138.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.04ms. Allocated memory is still 186.6MB. Free memory was 139.6MB in the beginning and 123.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.26ms. Allocated memory is still 186.6MB. Free memory was 123.5MB in the beginning and 119.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.36ms. Allocated memory is still 186.6MB. Free memory was 119.3MB in the beginning and 115.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 993.17ms. Allocated memory is still 186.6MB. Free memory was 115.9MB in the beginning and 137.2MB in the end (delta: -21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8406.06ms. Allocated memory was 186.6MB in the beginning and 285.2MB in the end (delta: 98.6MB). Free memory was 136.5MB in the beginning and 110.9MB in the end (delta: 25.6MB). Peak memory consumption was 126.6MB. Max. memory is 16.1GB. * Witness Printer took 10.23ms. Allocated memory is still 285.2MB. Free memory was 110.9MB in the beginning and 109.8MB in the end (delta: 1.0MB). 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 109, overapproximation of someBinaryFLOATComparisonOperation at line 118. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L57] unsigned char last_1_WrapperStruct00_var_1_5 = 1; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_5=1] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L115] EXPR WrapperStruct00.var_1_5 [L115] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00.var_1_2=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00.var_1_2=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L91] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_3=131070, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00.var_1_3=131070, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_3=131070, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00.var_1_3=131070, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L94] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L95] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L96] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L97] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00.var_1_6=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00.var_1_6=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00.var_1_9=512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00.var_1_9=512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L103] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00.var_1_10=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00.var_1_10=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L106] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00.var_1_13=131090, WrapperStruct00.var_1_13=131090, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )=1, WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F=1, WrapperStruct00.var_1_13=131090, WrapperStruct00.var_1_13=131090, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )=1, WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F=1, WrapperStruct00.var_1_13=131090, WrapperStruct00.var_1_13=131090, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_14 [L109] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_14 [L109] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00.var_1_14=131082, WrapperStruct00.var_1_14=131082, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )=1, WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F=1, WrapperStruct00.var_1_14=131082, WrapperStruct00.var_1_14=131082, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )=1, WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F=1, WrapperStruct00.var_1_14=131082, WrapperStruct00.var_1_14=131082, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L110] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L111] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00.var_1_18=-127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00.var_1_18=-127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L112] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00.var_1_18=-127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00.var_1_18=-127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L126] RET updateVariables() [L127] CALL step() [L61] COND FALSE !(! last_1_WrapperStruct00_var_1_5) [L64] EXPR WrapperStruct00.var_1_4 [L64] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_4 [L66] EXPR WrapperStruct00.var_1_6 [L66] unsigned char stepLocal_0 = WrapperStruct00.var_1_6; [L67] WrapperStruct00.var_1_2 VAL [WrapperStruct00.var_1_2=256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=1] [L67] COND FALSE !(WrapperStruct00.var_1_2) [L76] EXPR WrapperStruct00.var_1_1 [L76] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_1 [L77] EXPR WrapperStruct00.var_1_13 [L77] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_13 [L78] EXPR WrapperStruct00.var_1_18 [L78] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00.var_1_15=65534, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=1] [L79] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=1] [L79] EXPR WrapperStruct00.var_1_15 VAL [((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=1] [L79] COND FALSE !(((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR (! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) [L118] EXPR WrapperStruct00.var_1_1 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR (! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1) [L118] EXPR WrapperStruct00.var_1_2 VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)=1, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_2=256, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1 VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)=1, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1=1, WrapperStruct00.var_1_2=256, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1) VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)=1, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1=1, WrapperStruct00.var_1_2=256, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1) [L118] EXPR WrapperStruct00.var_1_15 VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)=1, (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)=1, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1=1, WrapperStruct00.var_1_2=256, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L118] EXPR WrapperStruct00.var_1_15 [L118] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)=1, (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)=1, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1=1, WrapperStruct00.var_1_2=256, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR WrapperStruct00.var_1_15 VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)=1, (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)=1, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1=1, WrapperStruct00.var_1_2=256, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1 VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)=1, (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)=1, (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1=1, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1=1, WrapperStruct00.var_1_2=256, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1) VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)=1, (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)=1, (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1=1, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1=1, WrapperStruct00.var_1_2=256, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1)) [L118] EXPR WrapperStruct00.var_1_15 [L118] EXPR WrapperStruct00.var_1_1 [L118] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1)) VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)=1, (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)=1, ((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))=1, (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1=1, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1=1, WrapperStruct00.var_1_2=256, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13)) [L118] EXPR WrapperStruct00.var_1_16 [L118] EXPR WrapperStruct00.var_1_13 [L118] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13)) VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)=1, (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)=1, ((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))=1, (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1=1, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=65534, WrapperStruct00.var_1_13=131090, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_16=131090, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1=1, WrapperStruct00.var_1_2=256, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18)) VAL [(! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))=1, ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)=1, (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)=1, ((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))=1, (((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13))=0, ((((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18))=0, (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1=1, ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)=65534, WrapperStruct00.var_1_13=131090, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_15=65534, WrapperStruct00.var_1_16=131090, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_1=-2, WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1=1, WrapperStruct00.var_1_2=256, WrapperStruct00.var_1_4=-2, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118-L119] return ((((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1082 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1079 mSDsluCounter, 5970 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3964 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1130 IncrementalHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 2006 mSDtfsCounter, 1130 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=352occurred in iteration=13, InterpolantAutomatonStates: 68, 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, 13 MinimizatonAttempts, 530 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1866 NumberOfCodeBlocks, 1866 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1716 ConstructedInterpolants, 0 QuantifiedInterpolants, 2465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 6240/6240 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 [2023-11-06 21:15:05,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 d3e0774e78cf4ed6ba09a877be2127aeb0fe9129940fc78943597bbe0bd3d6c8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:15:07,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:15:07,741 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 21:15:07,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:15:07,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:15:07,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:15:07,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:15:07,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:15:07,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:15:07,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:15:07,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:15:07,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:15:07,800 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:15:07,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:15:07,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:15:07,803 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:15:07,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:15:07,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:15:07,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:15:07,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:15:07,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:15:07,805 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:15:07,805 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:15:07,806 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:15:07,806 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:15:07,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:15:07,807 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:15:07,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:15:07,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:15:07,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:15:07,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:07,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:15:07,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:15:07,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:15:07,811 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:15:07,811 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:15:07,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:15:07,812 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:15:07,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:15:07,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:15:07,813 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:15:07,814 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:15:07,814 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> d3e0774e78cf4ed6ba09a877be2127aeb0fe9129940fc78943597bbe0bd3d6c8 [2023-11-06 21:15:08,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:15:08,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:15:08,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:15:08,251 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:15:08,251 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:15:08,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i [2023-11-06 21:15:11,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:15:11,652 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:15:11,653 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i [2023-11-06 21:15:11,666 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/data/a6e3ad22d/6bab2b7469fa4f668a2653eba2ee425d/FLAGccea8170c [2023-11-06 21:15:11,683 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/data/a6e3ad22d/6bab2b7469fa4f668a2653eba2ee425d [2023-11-06 21:15:11,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:15:11,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:15:11,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:11,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:15:11,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:15:11,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:11" (1/1) ... [2023-11-06 21:15:11,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647106db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:11, skipping insertion in model container [2023-11-06 21:15:11,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:11" (1/1) ... [2023-11-06 21:15:11,749 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:15:11,938 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i[916,929] [2023-11-06 21:15:12,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:12,052 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:15:12,069 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i[916,929] [2023-11-06 21:15:12,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:12,157 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:15:12,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12 WrapperNode [2023-11-06 21:15:12,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:12,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:12,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:15:12,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:15:12,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,260 INFO L138 Inliner]: procedures = 39, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2023-11-06 21:15:12,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:12,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:15:12,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:15:12,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:15:12,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:15:12,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:15:12,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:15:12,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:15:12,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:12,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:12,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:15:12,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:15:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:15:12,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 21:15:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 21:15:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 21:15:12,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 21:15:12,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:15:12,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 21:15:12,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 21:15:12,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 21:15:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 21:15:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 21:15:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 21:15:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 21:15:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:15:12,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:15:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:15:12,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:15:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 21:15:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 21:15:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 21:15:12,646 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:15:12,648 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:15:14,382 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:15:14,391 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:15:14,391 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:15:14,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:14 BoogieIcfgContainer [2023-11-06 21:15:14,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:15:14,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:15:14,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:15:14,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:15:14,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:15:11" (1/3) ... [2023-11-06 21:15:14,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437c5123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:14, skipping insertion in model container [2023-11-06 21:15:14,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12" (2/3) ... [2023-11-06 21:15:14,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437c5123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:14, skipping insertion in model container [2023-11-06 21:15:14,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:14" (3/3) ... [2023-11-06 21:15:14,409 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-96.i [2023-11-06 21:15:14,426 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:15:14,427 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:15:14,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:15:14,481 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@144140be, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:15:14,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:15:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 21:15:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 21:15:14,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:15:14,502 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:14,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:15:14,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1336021733, now seen corresponding path program 1 times [2023-11-06 21:15:14,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:15:14,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498097184] [2023-11-06 21:15:14,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:14,524 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 [2023-11-06 21:15:14,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:15:14,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 21:15:14,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:15:14,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 139 [2023-11-06 21:15:14,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 21:15:14,995 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 21:15:15,003 INFO L158 Benchmark]: Toolchain (without parser) took 3308.35ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 61.1MB in the beginning and 59.1MB in the end (delta: 2.0MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2023-11-06 21:15:15,005 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 86.0MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:15:15,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.27ms. Allocated memory is still 86.0MB. Free memory was 60.8MB in the beginning and 43.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 21:15:15,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.91ms. Allocated memory is still 86.0MB. Free memory was 43.3MB in the beginning and 39.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:15,008 INFO L158 Benchmark]: Boogie Preprocessor took 130.53ms. Allocated memory is still 86.0MB. Free memory was 39.5MB in the beginning and 35.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:15:15,013 INFO L158 Benchmark]: RCFGBuilder took 2002.18ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 35.9MB in the beginning and 82.7MB in the end (delta: -46.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2023-11-06 21:15:15,015 INFO L158 Benchmark]: TraceAbstraction took 598.32ms. Allocated memory is still 111.1MB. Free memory was 82.2MB in the beginning and 59.6MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:15,019 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.27ms. Allocated memory is still 86.0MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.27ms. Allocated memory is still 86.0MB. Free memory was 60.8MB in the beginning and 43.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.91ms. Allocated memory is still 86.0MB. Free memory was 43.3MB in the beginning and 39.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.53ms. Allocated memory is still 86.0MB. Free memory was 39.5MB in the beginning and 35.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2002.18ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 35.9MB in the beginning and 82.7MB in the end (delta: -46.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 598.32ms. Allocated memory is still 111.1MB. Free memory was 82.2MB in the beginning and 59.6MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 21:15:15,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e28fa9c-1260-4231-84b0-c9e007e08955/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.