./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:25:30,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:25:30,697 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:25:30,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:25:30,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:25:30,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:25:30,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:25:30,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:25:30,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:25:30,732 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:25:30,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:25:30,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:25:30,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:25:30,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:25:30,734 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:25:30,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:25:30,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:25:30,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:25:30,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:25:30,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:25:30,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:25:30,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:25:30,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:25:30,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:25:30,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:25:30,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:25:30,736 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:25:30,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:25:30,736 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:25:30,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:25:30,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:25:30,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:25:30,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:25:30,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:25:30,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:25:30,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:25:30,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:25:30,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:25:30,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:25:30,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:25:30,738 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:25:30,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:25:30,739 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:25:30,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:25:30,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:25:30,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:25:30,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:25:30,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:25:30,740 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2024-11-28 02:25:31,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:25:31,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:25:31,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:25:31,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:25:31,099 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:25:31,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-28 02:25:34,359 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/data/2aed50abb/ade9ecc9123d4a668dbb0e0d11aae33d/FLAGab94ac3c7 [2024-11-28 02:25:34,682 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:25:34,683 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-28 02:25:34,693 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/data/2aed50abb/ade9ecc9123d4a668dbb0e0d11aae33d/FLAGab94ac3c7 [2024-11-28 02:25:34,712 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/data/2aed50abb/ade9ecc9123d4a668dbb0e0d11aae33d [2024-11-28 02:25:34,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:25:34,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:25:34,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:25:34,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:25:34,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:25:34,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:25:34" (1/1) ... [2024-11-28 02:25:34,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f66f637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:34, skipping insertion in model container [2024-11-28 02:25:34,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:25:34" (1/1) ... [2024-11-28 02:25:34,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:25:34,954 WARN L250 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_f5f622b3-a3f7-4939-ae6b-7499cb84762a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-28 02:25:35,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:25:35,106 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:25:35,123 WARN L250 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_f5f622b3-a3f7-4939-ae6b-7499cb84762a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-28 02:25:35,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:25:35,223 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:25:35,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35 WrapperNode [2024-11-28 02:25:35,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:25:35,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:25:35,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:25:35,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:25:35,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,328 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2024-11-28 02:25:35,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:25:35,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:25:35,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:25:35,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:25:35,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,380 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-28 02:25:35,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,418 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:25:35,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:25:35,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:25:35,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:25:35,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (1/1) ... [2024-11-28 02:25:35,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:25:35,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:25:35,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:25:35,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:25:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:25:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-28 02:25:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-28 02:25:35,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-28 02:25:35,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 02:25:35,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-28 02:25:35,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 02:25:35,534 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 02:25:35,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 02:25:35,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 02:25:35,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:25:35,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:25:35,690 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:25:35,692 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:25:36,646 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-28 02:25:36,647 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:25:36,664 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:25:36,666 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:25:36,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:25:36 BoogieIcfgContainer [2024-11-28 02:25:36,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:25:36,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:25:36,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:25:36,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:25:36,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:25:34" (1/3) ... [2024-11-28 02:25:36,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154dc30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:25:36, skipping insertion in model container [2024-11-28 02:25:36,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:25:35" (2/3) ... [2024-11-28 02:25:36,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154dc30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:25:36, skipping insertion in model container [2024-11-28 02:25:36,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:25:36" (3/3) ... [2024-11-28 02:25:36,684 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-28 02:25:36,705 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:25:36,708 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-24.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:25:36,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:25:36,820 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5565702a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:25:36,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:25:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:25:36,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:36,845 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:36,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:36,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash 341014851, now seen corresponding path program 1 times [2024-11-28 02:25:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:36,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107753172] [2024-11-28 02:25:36,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:36,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-28 02:25:37,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:37,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107753172] [2024-11-28 02:25:37,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107753172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:25:37,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249050226] [2024-11-28 02:25:37,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:37,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:25:37,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:25:37,478 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:25:37,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:25:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:37,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 02:25:37,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:25:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-28 02:25:37,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:25:37,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249050226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:37,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:25:37,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-28 02:25:37,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965136800] [2024-11-28 02:25:37,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:37,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:25:37,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:38,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:25:38,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:25:38,027 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:25:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:38,060 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-28 02:25:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:25:38,062 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-28 02:25:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:38,070 INFO L225 Difference]: With dead ends: 195 [2024-11-28 02:25:38,070 INFO L226 Difference]: Without dead ends: 97 [2024-11-28 02:25:38,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:25:38,077 INFO L435 NwaCegarLoop]: 139 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, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:38,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:25:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-28 02:25:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-28 02:25:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-28 02:25:38,136 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-28 02:25:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:38,137 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-28 02:25:38,137 INFO L472 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:25:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-28 02:25:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:25:38,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:38,144 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:38,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 02:25:38,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-28 02:25:38,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:38,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:38,346 INFO L85 PathProgramCache]: Analyzing trace with hash -984360163, now seen corresponding path program 1 times [2024-11-28 02:25:38,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:38,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941269477] [2024-11-28 02:25:38,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:38,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:39,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:39,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941269477] [2024-11-28 02:25:39,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941269477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:39,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:39,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:25:39,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322893715] [2024-11-28 02:25:39,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:39,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:25:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:39,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:25:39,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:25:39,013 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:25:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:39,094 INFO L93 Difference]: Finished difference Result 193 states and 278 transitions. [2024-11-28 02:25:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:25:39,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-28 02:25:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:39,098 INFO L225 Difference]: With dead ends: 193 [2024-11-28 02:25:39,100 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 02:25:39,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:25:39,102 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:39,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:25:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 02:25:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-28 02:25:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-28 02:25:39,123 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-28 02:25:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:39,125 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-28 02:25:39,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:25:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-28 02:25:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:25:39,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:39,130 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:39,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:25:39,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:39,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash -140354661, now seen corresponding path program 1 times [2024-11-28 02:25:39,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:39,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737235055] [2024-11-28 02:25:39,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:39,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:39,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737235055] [2024-11-28 02:25:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737235055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:39,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:39,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:25:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588061481] [2024-11-28 02:25:39,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:39,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:25:39,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:39,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:25:39,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:25:39,529 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:39,579 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-28 02:25:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:25:39,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-28 02:25:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:39,586 INFO L225 Difference]: With dead ends: 196 [2024-11-28 02:25:39,586 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 02:25:39,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:25:39,590 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:39,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:25:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 02:25:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-28 02:25:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-28 02:25:39,616 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 124 [2024-11-28 02:25:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:39,616 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-28 02:25:39,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-28 02:25:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:25:39,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:39,619 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:39,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:25:39,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:39,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:39,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1945792995, now seen corresponding path program 1 times [2024-11-28 02:25:39,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:39,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883822932] [2024-11-28 02:25:39,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:39,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:39,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:39,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883822932] [2024-11-28 02:25:39,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883822932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:39,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:39,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:25:39,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351270912] [2024-11-28 02:25:39,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:39,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:25:39,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:39,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:25:39,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:25:39,889 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:39,933 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-28 02:25:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:25:39,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-28 02:25:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:39,936 INFO L225 Difference]: With dead ends: 198 [2024-11-28 02:25:39,938 INFO L226 Difference]: Without dead ends: 101 [2024-11-28 02:25:39,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:25:39,940 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:39,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:25:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-28 02:25:39,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-28 02:25:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-28 02:25:39,959 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2024-11-28 02:25:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:39,960 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-28 02:25:39,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-28 02:25:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:25:39,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:39,965 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:39,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:25:39,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:39,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:39,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1328105947, now seen corresponding path program 1 times [2024-11-28 02:25:39,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:39,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537171107] [2024-11-28 02:25:39,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:40,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537171107] [2024-11-28 02:25:40,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537171107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:40,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:40,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:25:40,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082076655] [2024-11-28 02:25:40,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:40,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:25:40,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:40,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:25:40,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:25:40,361 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:40,419 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-11-28 02:25:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:25:40,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-28 02:25:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:40,423 INFO L225 Difference]: With dead ends: 202 [2024-11-28 02:25:40,424 INFO L226 Difference]: Without dead ends: 104 [2024-11-28 02:25:40,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:25:40,426 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:40,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:25:40,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-28 02:25:40,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-28 02:25:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-28 02:25:40,448 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-28 02:25:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:40,449 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-28 02:25:40,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-28 02:25:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:25:40,451 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:40,451 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:40,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:25:40,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:40,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2008164317, now seen corresponding path program 1 times [2024-11-28 02:25:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:40,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356750287] [2024-11-28 02:25:40,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:40,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:40,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:40,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356750287] [2024-11-28 02:25:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356750287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:40,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:40,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:25:40,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2692676] [2024-11-28 02:25:40,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:40,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:25:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:40,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:25:40,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:25:40,799 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:40,850 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-28 02:25:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:25:40,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-28 02:25:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:40,852 INFO L225 Difference]: With dead ends: 206 [2024-11-28 02:25:40,852 INFO L226 Difference]: Without dead ends: 106 [2024-11-28 02:25:40,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:25:40,856 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 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 [2024-11-28 02:25:40,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:25:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-28 02:25:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-28 02:25:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-28 02:25:40,872 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-28 02:25:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:40,872 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-28 02:25:40,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-28 02:25:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:25:40,875 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:40,875 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:40,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:25:40,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:40,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash -511795617, now seen corresponding path program 1 times [2024-11-28 02:25:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:40,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533541603] [2024-11-28 02:25:40,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:41,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:41,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533541603] [2024-11-28 02:25:41,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533541603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:41,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:41,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:25:41,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136496757] [2024-11-28 02:25:41,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:41,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:25:41,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:41,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:25:41,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:25:41,153 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:41,201 INFO L93 Difference]: Finished difference Result 210 states and 295 transitions. [2024-11-28 02:25:41,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:25:41,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-28 02:25:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:41,204 INFO L225 Difference]: With dead ends: 210 [2024-11-28 02:25:41,206 INFO L226 Difference]: Without dead ends: 108 [2024-11-28 02:25:41,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:25:41,207 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:41,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:25:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-28 02:25:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-28 02:25:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-11-28 02:25:41,227 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2024-11-28 02:25:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:41,227 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-11-28 02:25:41,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-11-28 02:25:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:25:41,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:41,231 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:41,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:25:41,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:41,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash -509948575, now seen corresponding path program 1 times [2024-11-28 02:25:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:41,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202358304] [2024-11-28 02:25:41,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:42,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:42,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202358304] [2024-11-28 02:25:42,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202358304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:42,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:42,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:25:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218235866] [2024-11-28 02:25:42,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:42,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:25:42,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:42,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:25:42,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:25:42,293 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:42,993 INFO L93 Difference]: Finished difference Result 263 states and 366 transitions. [2024-11-28 02:25:42,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:25:42,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-28 02:25:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:42,996 INFO L225 Difference]: With dead ends: 263 [2024-11-28 02:25:42,997 INFO L226 Difference]: Without dead ends: 159 [2024-11-28 02:25:42,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:25:42,998 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 189 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:42,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 420 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:25:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-28 02:25:43,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 116. [2024-11-28 02:25:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-11-28 02:25:43,020 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 124 [2024-11-28 02:25:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:43,020 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-11-28 02:25:43,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-11-28 02:25:43,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-28 02:25:43,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:43,026 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:43,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:25:43,027 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:43,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1378439380, now seen corresponding path program 1 times [2024-11-28 02:25:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:43,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866181807] [2024-11-28 02:25:43,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:44,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:44,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866181807] [2024-11-28 02:25:44,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866181807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:44,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:44,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:25:44,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438970719] [2024-11-28 02:25:44,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:44,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:25:44,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:44,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:25:44,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:25:44,361 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:45,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:45,340 INFO L93 Difference]: Finished difference Result 285 states and 398 transitions. [2024-11-28 02:25:45,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:25:45,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-28 02:25:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:45,343 INFO L225 Difference]: With dead ends: 285 [2024-11-28 02:25:45,343 INFO L226 Difference]: Without dead ends: 172 [2024-11-28 02:25:45,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:25:45,344 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 226 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:45,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 394 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:25:45,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-28 02:25:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 129. [2024-11-28 02:25:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2024-11-28 02:25:45,360 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 125 [2024-11-28 02:25:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:45,361 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2024-11-28 02:25:45,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2024-11-28 02:25:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-28 02:25:45,363 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:45,363 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:45,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:25:45,363 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:45,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:45,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1244425874, now seen corresponding path program 1 times [2024-11-28 02:25:45,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:45,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391255799] [2024-11-28 02:25:45,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:45,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:45,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391255799] [2024-11-28 02:25:45,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391255799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:45,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:45,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:25:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132390410] [2024-11-28 02:25:45,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:45,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:25:45,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:45,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:25:45,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:25:45,986 INFO L87 Difference]: Start difference. First operand 129 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:46,217 INFO L93 Difference]: Finished difference Result 257 states and 361 transitions. [2024-11-28 02:25:46,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:25:46,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-28 02:25:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:46,226 INFO L225 Difference]: With dead ends: 257 [2024-11-28 02:25:46,226 INFO L226 Difference]: Without dead ends: 131 [2024-11-28 02:25:46,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:25:46,227 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 27 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:46,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 345 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:25:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-28 02:25:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-28 02:25:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 112 states have internal predecessors, (150), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions. [2024-11-28 02:25:46,240 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 125 [2024-11-28 02:25:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:46,241 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 180 transitions. [2024-11-28 02:25:46,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions. [2024-11-28 02:25:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-28 02:25:46,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:46,242 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:46,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:25:46,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:46,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:46,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2064726594, now seen corresponding path program 1 times [2024-11-28 02:25:46,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:46,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989756472] [2024-11-28 02:25:46,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:46,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:47,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:47,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989756472] [2024-11-28 02:25:47,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989756472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:47,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:47,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:25:47,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016980989] [2024-11-28 02:25:47,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:47,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:25:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:47,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:25:47,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:25:47,285 INFO L87 Difference]: Start difference. First operand 129 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:47,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:47,954 INFO L93 Difference]: Finished difference Result 300 states and 418 transitions. [2024-11-28 02:25:47,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:25:47,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-28 02:25:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:47,958 INFO L225 Difference]: With dead ends: 300 [2024-11-28 02:25:47,958 INFO L226 Difference]: Without dead ends: 174 [2024-11-28 02:25:47,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:25:47,961 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 237 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:47,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 274 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:25:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-28 02:25:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2024-11-28 02:25:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2024-11-28 02:25:47,984 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 126 [2024-11-28 02:25:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:47,985 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2024-11-28 02:25:47,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2024-11-28 02:25:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-28 02:25:47,987 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:47,987 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:47,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:25:47,991 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:47,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash 236095996, now seen corresponding path program 1 times [2024-11-28 02:25:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:47,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823700603] [2024-11-28 02:25:47,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823700603] [2024-11-28 02:25:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823700603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:48,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:48,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:25:48,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996695086] [2024-11-28 02:25:48,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:48,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:25:48,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:48,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:25:48,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:25:48,555 INFO L87 Difference]: Start difference. First operand 131 states and 181 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:48,847 INFO L93 Difference]: Finished difference Result 299 states and 412 transitions. [2024-11-28 02:25:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:25:48,848 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-28 02:25:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:48,850 INFO L225 Difference]: With dead ends: 299 [2024-11-28 02:25:48,850 INFO L226 Difference]: Without dead ends: 171 [2024-11-28 02:25:48,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:25:48,851 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:48,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 390 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 02:25:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-28 02:25:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2024-11-28 02:25:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 115 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2024-11-28 02:25:48,865 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 126 [2024-11-28 02:25:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:48,866 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2024-11-28 02:25:48,866 INFO L472 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2024-11-28 02:25:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-28 02:25:48,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:48,868 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:48,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:25:48,868 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:48,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash -519849880, now seen corresponding path program 1 times [2024-11-28 02:25:48,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:48,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842344114] [2024-11-28 02:25:48,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:48,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:50,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:50,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842344114] [2024-11-28 02:25:50,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842344114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:50,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:50,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:25:50,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036817404] [2024-11-28 02:25:50,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:50,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:25:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:50,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:25:50,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:25:50,077 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:50,719 INFO L93 Difference]: Finished difference Result 310 states and 427 transitions. [2024-11-28 02:25:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:25:50,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-28 02:25:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:50,724 INFO L225 Difference]: With dead ends: 310 [2024-11-28 02:25:50,726 INFO L226 Difference]: Without dead ends: 181 [2024-11-28 02:25:50,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:25:50,728 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 235 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:50,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 425 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:25:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-28 02:25:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 136. [2024-11-28 02:25:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2024-11-28 02:25:50,754 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 126 [2024-11-28 02:25:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:50,755 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2024-11-28 02:25:50,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2024-11-28 02:25:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-28 02:25:50,761 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:50,762 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:50,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:25:50,762 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:50,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash 199899249, now seen corresponding path program 1 times [2024-11-28 02:25:50,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:50,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856671603] [2024-11-28 02:25:50,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:55,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856671603] [2024-11-28 02:25:55,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856671603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:55,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:55,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:25:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104549700] [2024-11-28 02:25:55,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:55,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:25:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:55,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:25:55,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:25:55,653 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:25:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:57,292 INFO L93 Difference]: Finished difference Result 321 states and 442 transitions. [2024-11-28 02:25:57,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:25:57,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2024-11-28 02:25:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:57,296 INFO L225 Difference]: With dead ends: 321 [2024-11-28 02:25:57,297 INFO L226 Difference]: Without dead ends: 188 [2024-11-28 02:25:57,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:25:57,301 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 343 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:57,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 413 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 02:25:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-28 02:25:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 145. [2024-11-28 02:25:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.328125) internal successors, (170), 128 states have internal predecessors, (170), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2024-11-28 02:25:57,336 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 127 [2024-11-28 02:25:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:57,336 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2024-11-28 02:25:57,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:25:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2024-11-28 02:25:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-28 02:25:57,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:57,339 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:57,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:25:57,340 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:57,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:57,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1744775963, now seen corresponding path program 1 times [2024-11-28 02:25:57,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:57,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352857168] [2024-11-28 02:25:57,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:57,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:25:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:25:58,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:25:58,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352857168] [2024-11-28 02:25:58,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352857168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:25:58,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:25:58,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:25:58,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978764307] [2024-11-28 02:25:58,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:25:58,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:25:58,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:25:58,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:25:58,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:25:58,563 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:25:59,684 INFO L93 Difference]: Finished difference Result 334 states and 459 transitions. [2024-11-28 02:25:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:25:59,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-11-28 02:25:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:25:59,689 INFO L225 Difference]: With dead ends: 334 [2024-11-28 02:25:59,689 INFO L226 Difference]: Without dead ends: 192 [2024-11-28 02:25:59,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:25:59,692 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 159 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:25:59,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 438 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 02:25:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-28 02:25:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 147. [2024-11-28 02:25:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:25:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. [2024-11-28 02:25:59,723 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 203 transitions. Word has length 127 [2024-11-28 02:25:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:25:59,725 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 203 transitions. [2024-11-28 02:25:59,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:25:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 203 transitions. [2024-11-28 02:25:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-28 02:25:59,728 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:25:59,728 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:25:59,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:25:59,730 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:25:59,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:25:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1335042000, now seen corresponding path program 1 times [2024-11-28 02:25:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:25:59,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15062661] [2024-11-28 02:25:59,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:25:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:25:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-28 02:26:00,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:26:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15062661] [2024-11-28 02:26:00,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15062661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:26:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586817607] [2024-11-28 02:26:00,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:00,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:26:00,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:26:00,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:26:00,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:26:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:00,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:26:00,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:26:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:26:00,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:26:00,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586817607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:26:00,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:26:00,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-28 02:26:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721664702] [2024-11-28 02:26:00,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:26:00,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:26:00,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:26:00,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:26:00,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:26:00,581 INFO L87 Difference]: Start difference. First operand 147 states and 203 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:00,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:00,653 INFO L93 Difference]: Finished difference Result 294 states and 407 transitions. [2024-11-28 02:26:00,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:26:00,654 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-28 02:26:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:00,656 INFO L225 Difference]: With dead ends: 294 [2024-11-28 02:26:00,656 INFO L226 Difference]: Without dead ends: 150 [2024-11-28 02:26:00,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:26:00,658 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:00,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:26:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-28 02:26:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-28 02:26:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 133 states have internal predecessors, (176), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:26:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 206 transitions. [2024-11-28 02:26:00,685 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 206 transitions. Word has length 128 [2024-11-28 02:26:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:00,686 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 206 transitions. [2024-11-28 02:26:00,686 INFO L472 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 206 transitions. [2024-11-28 02:26:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-28 02:26:00,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:00,688 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:00,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:26:00,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 02:26:00,889 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:26:00,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1305021189, now seen corresponding path program 1 times [2024-11-28 02:26:00,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:26:00,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647607180] [2024-11-28 02:26:00,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:00,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:26:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:26:01,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:26:01,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647607180] [2024-11-28 02:26:01,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647607180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:26:01,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:26:01,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:26:01,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831425055] [2024-11-28 02:26:01,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:26:01,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:26:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:26:01,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:26:01,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:26:01,912 INFO L87 Difference]: Start difference. First operand 150 states and 206 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:02,471 INFO L93 Difference]: Finished difference Result 341 states and 465 transitions. [2024-11-28 02:26:02,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:26:02,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-28 02:26:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:02,474 INFO L225 Difference]: With dead ends: 341 [2024-11-28 02:26:02,474 INFO L226 Difference]: Without dead ends: 194 [2024-11-28 02:26:02,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:26:02,476 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 261 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:02,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 331 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:26:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-28 02:26:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2024-11-28 02:26:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 129 states have (on average 1.317829457364341) internal successors, (170), 129 states have internal predecessors, (170), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:26:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2024-11-28 02:26:02,510 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 128 [2024-11-28 02:26:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:02,511 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2024-11-28 02:26:02,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2024-11-28 02:26:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-28 02:26:02,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:02,515 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:02,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 02:26:02,515 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:26:02,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash 62037240, now seen corresponding path program 1 times [2024-11-28 02:26:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:26:02,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045716930] [2024-11-28 02:26:02,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:26:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:26:07,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:26:07,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045716930] [2024-11-28 02:26:07,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045716930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:26:07,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:26:07,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:26:07,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22360123] [2024-11-28 02:26:07,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:26:07,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:26:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:26:07,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:26:07,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:26:07,511 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:26:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:09,754 INFO L93 Difference]: Finished difference Result 342 states and 465 transitions. [2024-11-28 02:26:09,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:26:09,755 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-28 02:26:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:09,757 INFO L225 Difference]: With dead ends: 342 [2024-11-28 02:26:09,758 INFO L226 Difference]: Without dead ends: 199 [2024-11-28 02:26:09,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:26:09,759 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 165 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:09,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 509 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 02:26:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-28 02:26:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 148. [2024-11-28 02:26:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:26:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2024-11-28 02:26:09,781 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 129 [2024-11-28 02:26:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:09,782 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2024-11-28 02:26:09,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:26:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2024-11-28 02:26:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-28 02:26:09,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:09,784 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:09,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:26:09,785 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:26:09,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:09,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1530403510, now seen corresponding path program 1 times [2024-11-28 02:26:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:26:09,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778251149] [2024-11-28 02:26:09,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:26:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:11,448 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-28 02:26:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:26:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778251149] [2024-11-28 02:26:11,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778251149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:26:11,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219855878] [2024-11-28 02:26:11,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:11,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:26:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:26:11,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:26:11,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:26:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:11,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 02:26:11,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:26:15,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 02:26:15,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 02:26:16,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 02:26:16,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:26:16,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-11-28 02:26:17,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:26:17,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:26:17,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:26:17,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:26:17,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:26:17,168 INFO L349 Elim1Store]: treesize reduction 90, result has 23.1 percent of original size [2024-11-28 02:26:17,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 49 [2024-11-28 02:26:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 153 proven. 65 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-28 02:26:17,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:26:17,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219855878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:26:17,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:26:17,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-28 02:26:17,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186704643] [2024-11-28 02:26:17,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:26:17,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:26:17,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:26:17,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:26:17,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-11-28 02:26:17,507 INFO L87 Difference]: Start difference. First operand 148 states and 203 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-28 02:26:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:19,417 INFO L93 Difference]: Finished difference Result 333 states and 457 transitions. [2024-11-28 02:26:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:26:19,418 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) Word has length 129 [2024-11-28 02:26:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:19,420 INFO L225 Difference]: With dead ends: 333 [2024-11-28 02:26:19,420 INFO L226 Difference]: Without dead ends: 188 [2024-11-28 02:26:19,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2024-11-28 02:26:19,422 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 402 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:19,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 384 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:26:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-28 02:26:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2024-11-28 02:26:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 147 states have (on average 1.2857142857142858) internal successors, (189), 148 states have internal predecessors, (189), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-28 02:26:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2024-11-28 02:26:19,462 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 239 transitions. Word has length 129 [2024-11-28 02:26:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:19,462 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 239 transitions. [2024-11-28 02:26:19,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-28 02:26:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 239 transitions. [2024-11-28 02:26:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-28 02:26:19,465 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:19,465 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:19,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:26:19,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:26:19,669 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:26:19,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1507771256, now seen corresponding path program 1 times [2024-11-28 02:26:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:26:19,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272234467] [2024-11-28 02:26:19,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:19,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:26:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:26:19,846 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:26:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:26:20,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 02:26:20,129 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 02:26:20,130 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 02:26:20,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 02:26:20,138 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:20,394 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:26:20,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:26:20 BoogieIcfgContainer [2024-11-28 02:26:20,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:26:20,399 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:26:20,399 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:26:20,399 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:26:20,400 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:25:36" (3/4) ... [2024-11-28 02:26:20,404 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 02:26:20,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:26:20,406 INFO L158 Benchmark]: Toolchain (without parser) took 45688.98ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 116.9MB in the beginning and 223.7MB in the end (delta: -106.8MB). Peak memory consumption was 342.1MB. Max. memory is 16.1GB. [2024-11-28 02:26:20,406 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:26:20,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.11ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 101.4MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:26:20,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.98ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 97.9MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:26:20,412 INFO L158 Benchmark]: Boogie Preprocessor took 116.54ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:26:20,412 INFO L158 Benchmark]: RCFGBuilder took 1221.88ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 63.4MB in the end (delta: 31.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 02:26:20,412 INFO L158 Benchmark]: TraceAbstraction took 43727.09ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 62.7MB in the beginning and 228.0MB in the end (delta: -165.3MB). Peak memory consumption was 283.4MB. Max. memory is 16.1GB. [2024-11-28 02:26:20,413 INFO L158 Benchmark]: Witness Printer took 6.16ms. Allocated memory is still 587.2MB. Free memory was 228.0MB in the beginning and 223.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:26:20,415 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.43ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.11ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 101.4MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.98ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 97.9MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 116.54ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1221.88ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 63.4MB in the end (delta: 31.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 43727.09ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 62.7MB in the beginning and 228.0MB in the end (delta: -165.3MB). Peak memory consumption was 283.4MB. Max. memory is 16.1GB. * Witness Printer took 6.16ms. Allocated memory is still 587.2MB. Free memory was 228.0MB in the beginning and 223.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 0, 16, 4, 0, 0, 55182, 0, 1, 1, 100, 2.25, 199.4, -128 }; [L55] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] signed char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] signed char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L59] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L60] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L61] unsigned short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L63] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L64] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L65] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L67] float* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L68] signed char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=0] [L125] isInitial = 1 [L126] FCALL initially() [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L94] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L100] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L103] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L106] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L107] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L112] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L115] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L116] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L129] RET updateVariables() [L130] CALL step() [L72] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L72] COND FALSE !(! (*(WrapperStruct00_var_1_2_Pointer))) [L75] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L75] (*(WrapperStruct00_var_1_12_Pointer)) = ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))) [L77] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L77] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_5_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L78] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L79] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L79] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L80] (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L80] (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L80] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L81] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L81] COND FALSE !((*(WrapperStruct00_var_1_12_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L84] EXPR (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] (*(WrapperStruct00_var_1_1_Pointer)) = (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))))) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] EXPR ((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L89] EXPR ((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] COND FALSE !(((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L121] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121-L122] return (((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.4s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2309 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2297 mSDsluCounter, 7124 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4736 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3909 IncrementalHoareTripleChecker+Invalid, 4083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 2388 mSDtfsCounter, 3909 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 578 GetRequests, 452 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=19, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 418 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 25.3s InterpolantComputationTime, 2898 NumberOfCodeBlocks, 2898 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2747 ConstructedInterpolants, 0 QuantifiedInterpolants, 17480 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1580 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 9093/9240 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 02:26:20,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:26:23,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:26:23,831 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 02:26:23,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:26:23,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:26:23,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:26:23,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:26:23,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:26:23,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:26:23,921 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:26:23,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:26:23,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:26:23,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:26:23,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:26:23,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:26:23,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:26:23,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:26:23,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:26:23,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:26:23,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:26:23,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:26:23,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:26:23,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:26:23,937 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:26:23,937 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 02:26:23,937 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 02:26:23,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:26:23,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:26:23,938 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:26:23,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:26:23,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:26:23,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:26:23,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:26:23,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:26:23,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:26:23,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:26:23,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:26:23,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:26:23,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:26:23,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:26:23,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:26:23,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:26:23,942 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:26:23,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:26:23,943 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 02:26:23,943 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 02:26:23,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:26:23,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:26:23,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:26:23,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:26:23,943 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2024-11-28 02:26:24,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:26:24,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:26:24,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:26:24,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:26:24,367 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:26:24,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-28 02:26:27,434 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/data/70576fdef/06b455efff3541e4825750b6ff1e54f1/FLAGfdd254f45 [2024-11-28 02:26:27,726 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:26:27,727 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-28 02:26:27,739 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/data/70576fdef/06b455efff3541e4825750b6ff1e54f1/FLAGfdd254f45 [2024-11-28 02:26:27,785 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/data/70576fdef/06b455efff3541e4825750b6ff1e54f1 [2024-11-28 02:26:27,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:26:27,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:26:27,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:26:27,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:26:27,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:26:27,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:26:27" (1/1) ... [2024-11-28 02:26:27,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2135c3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:27, skipping insertion in model container [2024-11-28 02:26:27,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:26:27" (1/1) ... [2024-11-28 02:26:27,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:26:27,985 WARN L250 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_f5f622b3-a3f7-4939-ae6b-7499cb84762a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-28 02:26:28,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:26:28,100 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:26:28,114 WARN L250 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_f5f622b3-a3f7-4939-ae6b-7499cb84762a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-28 02:26:28,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:26:28,213 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:26:28,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28 WrapperNode [2024-11-28 02:26:28,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:26:28,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:26:28,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:26:28,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:26:28,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,268 INFO L138 Inliner]: procedures = 34, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2024-11-28 02:26:28,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:26:28,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:26:28,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:26:28,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:26:28,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,303 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-28 02:26:28,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:26:28,353 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:26:28,353 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:26:28,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:26:28,354 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (1/1) ... [2024-11-28 02:26:28,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:26:28,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:26:28,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:26:28,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:26:28,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:26:28,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 02:26:28,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 02:26:28,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 02:26:28,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 02:26:28,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-28 02:26:28,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-28 02:26:28,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-28 02:26:28,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-28 02:26:28,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-28 02:26:28,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-28 02:26:28,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-28 02:26:28,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-28 02:26:28,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-28 02:26:28,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-28 02:26:28,420 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 02:26:28,420 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 02:26:28,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-28 02:26:28,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-28 02:26:28,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:26:28,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:26:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-28 02:26:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-28 02:26:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-28 02:26:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-28 02:26:28,576 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:26:28,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:26:46,909 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-28 02:26:46,909 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:26:46,919 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:26:46,920 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:26:46,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:26:46 BoogieIcfgContainer [2024-11-28 02:26:46,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:26:46,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:26:46,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:26:46,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:26:46,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:26:27" (1/3) ... [2024-11-28 02:26:46,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c26889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:26:46, skipping insertion in model container [2024-11-28 02:26:46,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:26:28" (2/3) ... [2024-11-28 02:26:46,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c26889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:26:46, skipping insertion in model container [2024-11-28 02:26:46,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:26:46" (3/3) ... [2024-11-28 02:26:46,930 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-28 02:26:46,942 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:26:46,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-24.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:26:47,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:26:47,017 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@33b6173e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:26:47,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:26:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:26:47,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:26:47,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:47,032 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:47,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:26:47,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:47,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1133390607, now seen corresponding path program 1 times [2024-11-28 02:26:47,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:26:47,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435924893] [2024-11-28 02:26:47,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:47,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:47,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:26:47,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 02:26:47,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-28 02:26:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:48,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 02:26:48,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:26:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-28 02:26:48,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:26:48,331 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:26:48,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435924893] [2024-11-28 02:26:48,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435924893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:26:48,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:26:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:26:48,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076849145] [2024-11-28 02:26:48,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:26:48,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:26:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:26:48,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:26:48,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:26:48,362 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:26:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:48,389 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-28 02:26:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:26:48,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-28 02:26:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:48,396 INFO L225 Difference]: With dead ends: 195 [2024-11-28 02:26:48,396 INFO L226 Difference]: Without dead ends: 97 [2024-11-28 02:26:48,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:26:48,402 INFO L435 NwaCegarLoop]: 139 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, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:48,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:26:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-28 02:26:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-28 02:26:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:26:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-28 02:26:48,451 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-28 02:26:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:48,452 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-28 02:26:48,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 02:26:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-28 02:26:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:26:48,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:48,482 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:48,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/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 0 [2024-11-28 02:26:48,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:48,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:26:48,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash -191984407, now seen corresponding path program 1 times [2024-11-28 02:26:48,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:26:48,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242103725] [2024-11-28 02:26:48,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:48,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:48,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:26:48,687 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 02:26:48,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-28 02:26:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:49,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 02:26:49,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:26:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:26:49,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:26:49,959 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:26:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242103725] [2024-11-28 02:26:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242103725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:26:49,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:26:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:26:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176561789] [2024-11-28 02:26:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:26:49,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:26:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:26:49,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:26:49,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:26:49,962 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:50,093 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-28 02:26:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:26:50,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-28 02:26:50,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:50,096 INFO L225 Difference]: With dead ends: 192 [2024-11-28 02:26:50,096 INFO L226 Difference]: Without dead ends: 98 [2024-11-28 02:26:50,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:26:50,097 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:50,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:26:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-28 02:26:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-28 02:26:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:26:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-28 02:26:50,108 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2024-11-28 02:26:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:50,110 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-28 02:26:50,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-28 02:26:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:26:50,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:50,112 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:50,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-28 02:26:50,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:50,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:26:50,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1997422741, now seen corresponding path program 1 times [2024-11-28 02:26:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:26:50,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50813461] [2024-11-28 02:26:50,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:50,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:50,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:26:50,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 02:26:50,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-28 02:26:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:51,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 02:26:51,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:26:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:26:51,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:26:51,719 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:26:51,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50813461] [2024-11-28 02:26:51,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50813461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:26:51,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:26:51,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:26:51,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255596071] [2024-11-28 02:26:51,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:26:51,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:26:51,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:26:51,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:26:51,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:26:51,722 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:51,849 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-28 02:26:51,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:26:51,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-28 02:26:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:51,852 INFO L225 Difference]: With dead ends: 194 [2024-11-28 02:26:51,855 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 02:26:51,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:26:51,857 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:51,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:26:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 02:26:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-28 02:26:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:26:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-28 02:26:51,868 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-28 02:26:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:51,872 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-28 02:26:51,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-28 02:26:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:26:51,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:51,880 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:51,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-28 02:26:52,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:52,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:26:52,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:52,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1276476201, now seen corresponding path program 1 times [2024-11-28 02:26:52,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:26:52,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002492365] [2024-11-28 02:26:52,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:52,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:52,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:26:52,085 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 02:26:52,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/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 (5)] Waiting until timeout for monitored process [2024-11-28 02:26:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:53,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:26:53,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:26:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:26:53,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:26:53,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:26:53,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002492365] [2024-11-28 02:26:53,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002492365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:26:53,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:26:53,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:26:53,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887291349] [2024-11-28 02:26:53,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:26:53,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:26:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:26:53,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:26:53,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:26:53,784 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:54,256 INFO L93 Difference]: Finished difference Result 200 states and 286 transitions. [2024-11-28 02:26:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:26:54,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-28 02:26:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:54,259 INFO L225 Difference]: With dead ends: 200 [2024-11-28 02:26:54,259 INFO L226 Difference]: Without dead ends: 104 [2024-11-28 02:26:54,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:26:54,261 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:54,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:26:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-28 02:26:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-28 02:26:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:26:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-28 02:26:54,272 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-28 02:26:54,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:54,273 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-28 02:26:54,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-28 02:26:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:26:54,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:54,275 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:54,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/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 (5)] Ended with exit code 0 [2024-11-28 02:26:54,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:54,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:26:54,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:54,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1956534571, now seen corresponding path program 1 times [2024-11-28 02:26:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:26:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324323784] [2024-11-28 02:26:54,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:54,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:54,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:26:54,482 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 02:26:54,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-28 02:26:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:55,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:26:55,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:26:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:26:56,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:26:56,166 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:26:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324323784] [2024-11-28 02:26:56,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324323784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:26:56,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:26:56,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:26:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981639829] [2024-11-28 02:26:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:26:56,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:26:56,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:26:56,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:26:56,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:26:56,168 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:56,794 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-28 02:26:56,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:26:56,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-28 02:26:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:56,798 INFO L225 Difference]: With dead ends: 206 [2024-11-28 02:26:56,799 INFO L226 Difference]: Without dead ends: 106 [2024-11-28 02:26:56,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:26:56,801 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:56,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:26:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-28 02:26:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-28 02:26:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:26:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-28 02:26:56,810 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-28 02:26:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:56,810 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-28 02:26:56,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-28 02:26:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:26:56,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:56,812 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:56,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-28 02:26:57,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:57,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:26:57,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash -563425363, now seen corresponding path program 1 times [2024-11-28 02:26:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:26:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850788502] [2024-11-28 02:26:57,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:57,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:57,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:26:57,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 02:26:57,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-28 02:26:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:26:58,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:26:58,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:26:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:26:58,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:26:58,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:26:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850788502] [2024-11-28 02:26:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850788502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:26:58,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:26:58,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:26:58,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405611645] [2024-11-28 02:26:58,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:26:58,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:26:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:26:58,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:26:58,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:26:58,831 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:26:59,687 INFO L93 Difference]: Finished difference Result 210 states and 295 transitions. [2024-11-28 02:26:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:26:59,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-28 02:26:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:26:59,690 INFO L225 Difference]: With dead ends: 210 [2024-11-28 02:26:59,690 INFO L226 Difference]: Without dead ends: 108 [2024-11-28 02:26:59,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:26:59,691 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:26:59,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 761 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 02:26:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-28 02:26:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-28 02:26:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 02:26:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-11-28 02:26:59,702 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2024-11-28 02:26:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:26:59,703 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-11-28 02:26:59,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:26:59,703 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-11-28 02:26:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 02:26:59,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:26:59,705 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:26:59,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-28 02:26:59,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:59,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:26:59,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:26:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash -561578321, now seen corresponding path program 1 times [2024-11-28 02:26:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:26:59,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164605759] [2024-11-28 02:26:59,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:26:59,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 02:26:59,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:26:59,908 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 02:26:59,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5f622b3-a3f7-4939-ae6b-7499cb84762a/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-28 02:27:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:27:01,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:27:01,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:27:12,997 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:27:18,432 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:27:26,698 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:28:00,601 WARN L286 SmtUtils]: Spent 20.51s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:28:07,999 WARN L286 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:28:20,472 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:28:28,750 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:28:32,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (= .cse1 |c_ULTIMATE.start_step_#t~mem35#1|) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2024-11-28 02:28:36,876 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (= .cse1 |c_ULTIMATE.start_step_#t~mem35#1|) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2024-11-28 02:28:44,977 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:28:53,135 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:29:01,415 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:29:05,457 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-28 02:29:09,528 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-28 02:29:17,625 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:29:25,772 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:29:34,043 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:29:34,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 84 [2024-11-28 02:29:45,898 WARN L286 SmtUtils]: Spent 7.72s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:29:51,884 WARN L286 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:30:00,026 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:30:12,256 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:30:20,353 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:30:28,503 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:30:32,586 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0)))) (or (and |c_ULTIMATE.start_property_#t~short74#1| (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 .cse4))) (and (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 .cse3)) (not (fp.geq .cse1 .cse2)))))))) (and (not |c_ULTIMATE.start_property_#t~short74#1|) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse6 .cse4))) (and (fp.gt .cse5 (fp.div roundNearestTiesToEven .cse6 .cse3)) (not (fp.geq .cse5 .cse6))))))))) is different from false [2024-11-28 02:30:36,620 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0)))) (or (and |c_ULTIMATE.start_property_#t~short74#1| (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 .cse4))) (and (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 .cse3)) (not (fp.geq .cse1 .cse2)))))))) (and (not |c_ULTIMATE.start_property_#t~short74#1|) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse6 .cse4))) (and (fp.gt .cse5 (fp.div roundNearestTiesToEven .cse6 .cse3)) (not (fp.geq .cse5 .cse6))))))))) is different from true [2024-11-28 02:30:48,766 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:30:56,941 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:31:00,984 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)))))) is different from false [2024-11-28 02:31:05,015 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)))))) is different from true [2024-11-28 02:31:17,166 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:31:25,318 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:31:36,404 WARN L286 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:31:44,560 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:31:56,716 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:32:04,870 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:32:15,747 WARN L286 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:32:23,846 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:32:34,834 WARN L286 SmtUtils]: Spent 6.95s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:32:43,007 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:32:55,001 WARN L286 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:33:03,149 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:33:15,300 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:33:23,468 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:33:34,380 WARN L286 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:33:42,531 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:33:54,455 WARN L286 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:34:02,612 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:34:14,780 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:34:22,960 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:34:35,126 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:34:43,290 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:34:53,736 WARN L286 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:35:01,877 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:35:13,725 WARN L286 SmtUtils]: Spent 7.80s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:35:21,888 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:35:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-28 02:35:21,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:35:21,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:35:21,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164605759] [2024-11-28 02:35:21,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164605759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:35:21,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:35:21,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:35:21,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075952372] [2024-11-28 02:35:21,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:35:21,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:35:21,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:35:21,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:35:21,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=11, Unknown=8, NotChecked=36, Total=72 [2024-11-28 02:35:21,890 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 02:35:26,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:35:29,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:35:31,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:35:34,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:35:35,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:35:38,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:35:40,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:35:44,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:35:47,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:35:51,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:35:54,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:35:58,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:02,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:07,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:10,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:14,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:17,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:20,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:23,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:28,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:32,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:36,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:40,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:44,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:46,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:50,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:54,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:36:59,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:02,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:06,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:10,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:12,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:14,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:16,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:18,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:20,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:22,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:26,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:28,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:30,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:32,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:36,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:39,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:43,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:45,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:49,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:53,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:54,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:37:58,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:02,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:06,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:10,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:14,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:16,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:20,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:24,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:28,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:33,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:37,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:41,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:44,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:48,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:51,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:54,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:38:58,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:03,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:07,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:10,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:12,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:16,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:20,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:24,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:28,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:31,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:33,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:36,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:41,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:45,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:49,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:52,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:39:56,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:40:00,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:40:05,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:40:09,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:40:13,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:40:17,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:40:19,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []